Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 9.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Apr 23 07:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 13:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Apr 12 13:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 13:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Apr 12 13:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:46 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 32K May 18 16:43 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 Railroad-PT-005-LTLFireability-00
FORMULA_NAME Railroad-PT-005-LTLFireability-01
FORMULA_NAME Railroad-PT-005-LTLFireability-02
FORMULA_NAME Railroad-PT-005-LTLFireability-03
FORMULA_NAME Railroad-PT-005-LTLFireability-04
FORMULA_NAME Railroad-PT-005-LTLFireability-05
FORMULA_NAME Railroad-PT-005-LTLFireability-06
FORMULA_NAME Railroad-PT-005-LTLFireability-07
FORMULA_NAME Railroad-PT-005-LTLFireability-08
FORMULA_NAME Railroad-PT-005-LTLFireability-09
FORMULA_NAME Railroad-PT-005-LTLFireability-10
FORMULA_NAME Railroad-PT-005-LTLFireability-11
FORMULA_NAME Railroad-PT-005-LTLFireability-12
FORMULA_NAME Railroad-PT-005-LTLFireability-13
FORMULA_NAME Railroad-PT-005-LTLFireability-14
FORMULA_NAME Railroad-PT-005-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716857104814

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Railroad-PT-005
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-28 00:45:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 00:45:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 00:45:06] [INFO ] Load time of PNML (sax parser for PT used): 37 ms
[2024-05-28 00:45:06] [INFO ] Transformed 68 places.
[2024-05-28 00:45:06] [INFO ] Transformed 56 transitions.
[2024-05-28 00:45:06] [INFO ] Found NUPN structural information;
[2024-05-28 00:45:06] [INFO ] Parsed PT model containing 68 places and 56 transitions and 313 arcs in 109 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 5 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA Railroad-PT-005-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-005-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-005-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 51/51 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 48 transition count 51
Applied a total of 4 rules in 11 ms. Remains 48 /52 variables (removed 4) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 48 cols
[2024-05-28 00:45:06] [INFO ] Computed 22 invariants in 11 ms
[2024-05-28 00:45:07] [INFO ] Implicit Places using invariants in 337 ms returned [33]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 360 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 47/52 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 47 /47 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 372 ms. Remains : 47/52 places, 51/51 transitions.
Support contains 36 out of 47 places after structural reductions.
[2024-05-28 00:45:07] [INFO ] Flatten gal took : 22 ms
[2024-05-28 00:45:07] [INFO ] Flatten gal took : 9 ms
[2024-05-28 00:45:07] [INFO ] Input system was already deterministic with 51 transitions.
Finished random walk after 574 steps, including 0 resets, run visited all 26 properties in 46 ms. (steps per millisecond=12 )
Parikh walk visited 0 properties in 0 ms.
FORMULA Railroad-PT-005-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Railroad-PT-005-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 8 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 51/51 transitions.
Ensure Unique test removed 2 places
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 0 with 8 rules applied. Total rules applied 8 place count 41 transition count 47
Applied a total of 8 rules in 11 ms. Remains 41 /47 variables (removed 6) and now considering 47/51 (removed 4) transitions.
// Phase 1: matrix 47 rows 41 cols
[2024-05-28 00:45:07] [INFO ] Computed 19 invariants in 6 ms
[2024-05-28 00:45:07] [INFO ] Implicit Places using invariants in 76 ms returned [13, 15, 16, 18, 19, 20, 37, 38]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 78 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 33/47 places, 47/51 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 33 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 32 transition count 46
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 32 transition count 45
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 31 transition count 45
Applied a total of 4 rules in 6 ms. Remains 31 /33 variables (removed 2) and now considering 45/47 (removed 2) transitions.
// Phase 1: matrix 45 rows 31 cols
[2024-05-28 00:45:07] [INFO ] Computed 11 invariants in 2 ms
[2024-05-28 00:45:07] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-28 00:45:07] [INFO ] Invariant cache hit.
[2024-05-28 00:45:07] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 31/47 places, 45/51 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 233 ms. Remains : 31/47 places, 45/51 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 250 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Railroad-PT-005-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s11 0) (EQ s15 0) (EQ s22 0)), p1:(AND (EQ s5 1) (EQ s12 1) (EQ s21 1) (OR (EQ s8 0) (EQ s13 0)))], 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 0 reset in 277 ms.
Stack based approach found an accepted trace after 38 steps with 0 reset with depth 39 and stack size 39 in 1 ms.
FORMULA Railroad-PT-005-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-005-LTLFireability-00 finished in 808 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(F(p0))||G(p1)))))'
Support contains 5 out of 47 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 51/51 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 44 transition count 51
Applied a total of 3 rules in 4 ms. Remains 44 /47 variables (removed 3) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 44 cols
[2024-05-28 00:45:08] [INFO ] Computed 18 invariants in 1 ms
[2024-05-28 00:45:08] [INFO ] Implicit Places using invariants in 58 ms returned [14, 15, 16, 17, 19, 20, 21, 39, 40]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 60 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 35/47 places, 51/51 transitions.
Applied a total of 0 rules in 0 ms. Remains 35 /35 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 65 ms. Remains : 35/47 places, 51/51 transitions.
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : Railroad-PT-005-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s13 0) (EQ s19 0) (EQ s25 0)), p0:(OR (EQ s13 0) (EQ s20 0) (EQ s28 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 999 reset in 185 ms.
Product exploration explored 100000 steps with 995 reset in 191 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 p1 p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 51 rows 35 cols
[2024-05-28 00:45:09] [INFO ] Computed 9 invariants in 2 ms
[2024-05-28 00:45:09] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2024-05-28 00:45:09] [INFO ] [Real]Absence check using 7 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-28 00:45:09] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 130 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 5 out of 35 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 35/35 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 35 /35 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2024-05-28 00:45:10] [INFO ] Invariant cache hit.
[2024-05-28 00:45:10] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-28 00:45:10] [INFO ] Invariant cache hit.
[2024-05-28 00:45:10] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2024-05-28 00:45:10] [INFO ] Invariant cache hit.
[2024-05-28 00:45:10] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 129 ms. Remains : 35/35 places, 51/51 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 p1 p0), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 67 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Finished random walk after 35 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=17 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 119 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 980 reset in 139 ms.
Product exploration explored 100000 steps with 973 reset in 155 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 5 out of 35 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 35/35 places, 51/51 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 35 transition count 51
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 2 place count 35 transition count 51
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 35 transition count 51
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 6 place count 33 transition count 49
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 33 transition count 49
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 11 place count 33 transition count 49
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 11 rules in 11 ms. Remains 33 /35 variables (removed 2) and now considering 49/51 (removed 2) transitions.
[2024-05-28 00:45:11] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 49 rows 33 cols
[2024-05-28 00:45:11] [INFO ] Computed 9 invariants in 1 ms
[2024-05-28 00:45:11] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 33/35 places, 49/51 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 71 ms. Remains : 33/35 places, 49/51 transitions.
Built C files in :
/tmp/ltsmin2481386171904529928
[2024-05-28 00:45:11] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2481386171904529928
Running compilation step : cd /tmp/ltsmin2481386171904529928;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 222 ms.
Running link step : cd /tmp/ltsmin2481386171904529928;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin2481386171904529928;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8514022573352850015.hoa' '--buchi-type=spotba'
LTSmin run took 266 ms.
FORMULA Railroad-PT-005-LTLFireability-02 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Railroad-PT-005-LTLFireability-02 finished in 4130 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U p1)||X((G(p3)||p2))))'
Support contains 10 out of 47 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 51/51 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 44 transition count 51
Applied a total of 3 rules in 1 ms. Remains 44 /47 variables (removed 3) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 44 cols
[2024-05-28 00:45:12] [INFO ] Computed 18 invariants in 1 ms
[2024-05-28 00:45:12] [INFO ] Implicit Places using invariants in 52 ms returned [14, 15, 17, 21, 39, 40]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 53 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 38/47 places, 51/51 transitions.
Applied a total of 0 rules in 0 ms. Remains 38 /38 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 55 ms. Remains : 38/47 places, 51/51 transitions.
Stuttering acceptance computed with spot in 289 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : Railroad-PT-005-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p3), acceptance={} source=3 dest: 0}, { cond=p3, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p2) p3), acceptance={} source=4 dest: 3}], [{ cond=(AND (NOT p1) p0 (NOT p2) (NOT p3)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2) p3), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p2) p3), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p1) p0 p3), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p1) (NOT p0) p3), acceptance={} source=6 dest: 6}]], initial=2, aps=[p1:(AND (EQ s16 1) (EQ s35 1)), p0:(AND (EQ s13 1) (EQ s24 1) (EQ s29 1)), p3:(OR (EQ s2 0) (EQ s15 0) (EQ s17 0)), p2:(OR (EQ s14 0) (EQ s18 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 138 ms.
Product exploration explored 100000 steps with 50000 reset in 132 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p3) p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) p3))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) p0 (NOT p2) p3))), (X (NOT (AND (NOT p2) p3))), (X (X (AND (NOT p1) (NOT p0)))), true, (X (X p3)), (X (X (AND (NOT p1) (NOT p0) p3))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 p3))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 15 factoid took 23 ms. Reduced automaton from 7 states, 17 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Railroad-PT-005-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Railroad-PT-005-LTLFireability-03 finished in 656 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
Support contains 3 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 51/51 transitions.
Ensure Unique test removed 3 places
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 0 with 8 rules applied. Total rules applied 8 place count 40 transition count 47
Applied a total of 8 rules in 9 ms. Remains 40 /47 variables (removed 7) and now considering 47/51 (removed 4) transitions.
// Phase 1: matrix 47 rows 40 cols
[2024-05-28 00:45:13] [INFO ] Computed 18 invariants in 1 ms
[2024-05-28 00:45:13] [INFO ] Implicit Places using invariants in 52 ms returned [13, 14, 15, 16, 18, 19, 20, 36, 37]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 53 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 31/47 places, 47/51 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 31 transition count 45
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 29 transition count 45
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 29 transition count 43
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 27 transition count 43
Applied a total of 8 rules in 3 ms. Remains 27 /31 variables (removed 4) and now considering 43/47 (removed 4) transitions.
// Phase 1: matrix 43 rows 27 cols
[2024-05-28 00:45:13] [INFO ] Computed 9 invariants in 0 ms
[2024-05-28 00:45:13] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-28 00:45:13] [INFO ] Invariant cache hit.
[2024-05-28 00:45:13] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 27/47 places, 43/51 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 150 ms. Remains : 27/47 places, 43/51 transitions.
Stuttering acceptance computed with spot in 144 ms :[p0, p0]
Running random walk in product with property : Railroad-PT-005-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s11 1) (EQ s18 1) (EQ s23 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 438 reset in 128 ms.
Product exploration explored 100000 steps with 395 reset in 126 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 67 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[p0, p0]
Finished random walk after 148 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=37 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[p0, p0]
Stuttering acceptance computed with spot in 67 ms :[p0, p0]
Support contains 3 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 43/43 transitions.
Applied a total of 0 rules in 5 ms. Remains 27 /27 variables (removed 0) and now considering 43/43 (removed 0) transitions.
[2024-05-28 00:45:14] [INFO ] Invariant cache hit.
[2024-05-28 00:45:14] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-28 00:45:14] [INFO ] Invariant cache hit.
[2024-05-28 00:45:14] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2024-05-28 00:45:14] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-28 00:45:14] [INFO ] Invariant cache hit.
[2024-05-28 00:45:14] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 122 ms. Remains : 27/27 places, 43/43 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 65 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[p0, p0]
Finished random walk after 179 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=89 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[p0, p0]
Stuttering acceptance computed with spot in 68 ms :[p0, p0]
Stuttering acceptance computed with spot in 84 ms :[p0, p0]
Product exploration explored 100000 steps with 425 reset in 127 ms.
Product exploration explored 100000 steps with 410 reset in 134 ms.
Built C files in :
/tmp/ltsmin5175688234378203844
[2024-05-28 00:45:15] [INFO ] Computing symmetric may disable matrix : 43 transitions.
[2024-05-28 00:45:15] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 00:45:15] [INFO ] Computing symmetric may enable matrix : 43 transitions.
[2024-05-28 00:45:15] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 00:45:15] [INFO ] Computing Do-Not-Accords matrix : 43 transitions.
[2024-05-28 00:45:15] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 00:45:15] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5175688234378203844
Running compilation step : cd /tmp/ltsmin5175688234378203844;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 136 ms.
Running link step : cd /tmp/ltsmin5175688234378203844;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin5175688234378203844;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4358459928661727259.hoa' '--buchi-type=spotba'
LTSmin run took 66 ms.
FORMULA Railroad-PT-005-LTLFireability-04 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Railroad-PT-005-LTLFireability-04 finished in 2145 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((!p1&&X((!p1 U (!p2||G(!p1)))))||p0))))'
Support contains 5 out of 47 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 51/51 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 44 transition count 51
Applied a total of 3 rules in 1 ms. Remains 44 /47 variables (removed 3) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 44 cols
[2024-05-28 00:45:15] [INFO ] Computed 18 invariants in 1 ms
[2024-05-28 00:45:15] [INFO ] Implicit Places using invariants in 51 ms returned [14, 15, 16, 17, 19, 20, 21, 39, 40]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 53 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 35/47 places, 51/51 transitions.
Applied a total of 0 rules in 0 ms. Remains 35 /35 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 54 ms. Remains : 35/47 places, 51/51 transitions.
Stuttering acceptance computed with spot in 147 ms :[true, (AND (NOT p0) p1), (AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p1 p2))]
Running random walk in product with property : Railroad-PT-005-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(OR (AND (NOT p0) p1) (AND p1 p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (EQ s9 0) (EQ s14 0)), p1:(AND (EQ s13 1) (EQ s19 1) (EQ s25 1)), p2:(AND (EQ s9 1) (EQ s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 31 steps with 0 reset in 1 ms.
FORMULA Railroad-PT-005-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Railroad-PT-005-LTLFireability-06 finished in 218 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 51/51 transitions.
Ensure Unique test removed 3 places
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 0 with 8 rules applied. Total rules applied 8 place count 40 transition count 47
Applied a total of 8 rules in 6 ms. Remains 40 /47 variables (removed 7) and now considering 47/51 (removed 4) transitions.
// Phase 1: matrix 47 rows 40 cols
[2024-05-28 00:45:15] [INFO ] Computed 18 invariants in 1 ms
[2024-05-28 00:45:15] [INFO ] Implicit Places using invariants in 48 ms returned [13, 14, 15, 16, 18, 19, 20, 36, 37]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 49 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 31/47 places, 47/51 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 31 transition count 45
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 29 transition count 45
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 29 transition count 43
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 27 transition count 43
Applied a total of 8 rules in 4 ms. Remains 27 /31 variables (removed 4) and now considering 43/47 (removed 4) transitions.
// Phase 1: matrix 43 rows 27 cols
[2024-05-28 00:45:15] [INFO ] Computed 9 invariants in 1 ms
[2024-05-28 00:45:15] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-28 00:45:15] [INFO ] Invariant cache hit.
[2024-05-28 00:45:15] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 27/47 places, 43/51 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 133 ms. Remains : 27/47 places, 43/51 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : Railroad-PT-005-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s11 1) (EQ s18 1) (EQ s23 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 133 ms.
Stack based approach found an accepted trace after 35 steps with 0 reset with depth 36 and stack size 36 in 1 ms.
FORMULA Railroad-PT-005-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-005-LTLFireability-07 finished in 321 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(F(p1) U p2))))'
Support contains 7 out of 47 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 51/51 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 44 transition count 51
Applied a total of 3 rules in 1 ms. Remains 44 /47 variables (removed 3) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 44 cols
[2024-05-28 00:45:15] [INFO ] Computed 18 invariants in 2 ms
[2024-05-28 00:45:15] [INFO ] Implicit Places using invariants in 49 ms returned [14, 15, 17, 19, 20, 21, 39, 40]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 50 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 36/47 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 36 /36 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 52 ms. Remains : 36/47 places, 51/51 transitions.
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Railroad-PT-005-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s13 0) (EQ s21 0) (EQ s28 0)), p2:(AND (EQ s13 1) (EQ s20 1) (EQ s31 1)), p1:(AND (EQ s14 1) (EQ s16 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 748 reset in 132 ms.
Stack based approach found an accepted trace after 51 steps with 0 reset with depth 52 and stack size 52 in 0 ms.
FORMULA Railroad-PT-005-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-005-LTLFireability-08 finished in 385 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0) U X(!p1)))'
Support contains 5 out of 47 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 51/51 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 44 transition count 51
Applied a total of 3 rules in 2 ms. Remains 44 /47 variables (removed 3) and now considering 51/51 (removed 0) transitions.
[2024-05-28 00:45:16] [INFO ] Invariant cache hit.
[2024-05-28 00:45:16] [INFO ] Implicit Places using invariants in 54 ms returned [14, 15, 16, 17, 19, 20, 21, 39, 40]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 55 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 35/47 places, 51/51 transitions.
Applied a total of 0 rules in 0 ms. Remains 35 /35 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 58 ms. Remains : 35/47 places, 51/51 transitions.
Stuttering acceptance computed with spot in 162 ms :[p1, p1, (AND p0 p1), p0]
Running random walk in product with property : Railroad-PT-005-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s13 1) (EQ s17 1) (EQ s24 1)), p1:(AND (EQ s6 1) (EQ s14 1))], nbAcceptance=0, 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]]
Product exploration explored 100000 steps with 50000 reset in 94 ms.
Product exploration explored 100000 steps with 50000 reset in 103 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 p0 p1))), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 16 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Railroad-PT-005-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Railroad-PT-005-LTLFireability-10 finished in 460 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((F(p1)&&p0))&&F(p2))))'
Support contains 5 out of 47 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 51/51 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 46 transition count 51
Applied a total of 1 rules in 2 ms. Remains 46 /47 variables (removed 1) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 46 cols
[2024-05-28 00:45:16] [INFO ] Computed 20 invariants in 2 ms
[2024-05-28 00:45:16] [INFO ] Implicit Places using invariants in 46 ms returned [16, 17, 18, 21, 22, 23, 41, 42]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 47 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 38/47 places, 51/51 transitions.
Applied a total of 0 rules in 0 ms. Remains 38 /38 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 51 ms. Remains : 38/47 places, 51/51 transitions.
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p2), true, (NOT p1)]
Running random walk in product with property : Railroad-PT-005-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(AND (EQ s15 1) (EQ s16 1) (EQ s25 1)), p0:(AND (EQ s10 1) (EQ s13 1)), p1:(OR (EQ s10 0) (EQ s13 0))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Railroad-PT-005-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Railroad-PT-005-LTLFireability-12 finished in 294 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))||F(p1))))'
Support contains 5 out of 47 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 51/51 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 44 transition count 51
Applied a total of 3 rules in 1 ms. Remains 44 /47 variables (removed 3) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 44 cols
[2024-05-28 00:45:17] [INFO ] Computed 18 invariants in 0 ms
[2024-05-28 00:45:17] [INFO ] Implicit Places using invariants in 48 ms returned [14, 15, 16, 17, 19, 20, 21, 39, 40]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 49 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 35/47 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 35 /35 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 51 ms. Remains : 35/47 places, 51/51 transitions.
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Railroad-PT-005-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s13 0) (EQ s21 0) (EQ s24 0)), p0:(AND (EQ s13 1) (EQ s20 1) (EQ s28 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 90 ms.
Product exploration explored 100000 steps with 50000 reset in 98 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 p1 (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 12 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Railroad-PT-005-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Railroad-PT-005-LTLFireability-13 finished in 378 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((F(p1)||G(p2))&&p0)))'
Support contains 8 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 51/51 transitions.
Ensure Unique test removed 3 places
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 41 transition count 48
Applied a total of 6 rules in 8 ms. Remains 41 /47 variables (removed 6) and now considering 48/51 (removed 3) transitions.
// Phase 1: matrix 48 rows 41 cols
[2024-05-28 00:45:17] [INFO ] Computed 18 invariants in 1 ms
[2024-05-28 00:45:17] [INFO ] Implicit Places using invariants in 39 ms returned [13, 14, 15, 16, 18, 19, 36, 37]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 40 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 33/47 places, 48/51 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 33 transition count 46
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 31 transition count 46
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 31 transition count 44
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 29 transition count 44
Applied a total of 8 rules in 5 ms. Remains 29 /33 variables (removed 4) and now considering 44/48 (removed 4) transitions.
// Phase 1: matrix 44 rows 29 cols
[2024-05-28 00:45:17] [INFO ] Computed 10 invariants in 1 ms
[2024-05-28 00:45:17] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-28 00:45:17] [INFO ] Invariant cache hit.
[2024-05-28 00:45:17] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 29/47 places, 44/51 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 118 ms. Remains : 29/47 places, 44/51 transitions.
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Railroad-PT-005-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s11 1) (EQ s14 1) (EQ s27 1)), p1:(AND (EQ s1 1) (EQ s12 1) (EQ s13 1)), p2:(OR (EQ s11 0) (EQ s17 0) (EQ s26 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 13941 reset in 146 ms.
Stack based approach found an accepted trace after 106 steps with 8 reset with depth 24 and stack size 24 in 0 ms.
FORMULA Railroad-PT-005-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-005-LTLFireability-15 finished in 382 ms.
All properties solved by simple procedures.
Total runtime 11397 ms.

BK_STOP 1716857118654

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is Railroad-PT-005, 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 r329-tall-171662362000298"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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