Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 756K
-rw-r--r-- 1 mcc users 8.7K Feb 25 22:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 25 22:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 22:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 22:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 22:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 25 22:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 25 22:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 110K Feb 25 22:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 255K Mar 5 18:23 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-020-LTLFireability-00
FORMULA_NAME Railroad-PT-020-LTLFireability-01
FORMULA_NAME Railroad-PT-020-LTLFireability-02
FORMULA_NAME Railroad-PT-020-LTLFireability-03
FORMULA_NAME Railroad-PT-020-LTLFireability-04
FORMULA_NAME Railroad-PT-020-LTLFireability-05
FORMULA_NAME Railroad-PT-020-LTLFireability-06
FORMULA_NAME Railroad-PT-020-LTLFireability-07
FORMULA_NAME Railroad-PT-020-LTLFireability-08
FORMULA_NAME Railroad-PT-020-LTLFireability-09
FORMULA_NAME Railroad-PT-020-LTLFireability-10
FORMULA_NAME Railroad-PT-020-LTLFireability-11
FORMULA_NAME Railroad-PT-020-LTLFireability-12
FORMULA_NAME Railroad-PT-020-LTLFireability-13
FORMULA_NAME Railroad-PT-020-LTLFireability-14
FORMULA_NAME Railroad-PT-020-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679006913987

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Railroad-PT-020
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-16 22:48:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-16 22:48:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 22:48:35] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2023-03-16 22:48:35] [INFO ] Transformed 218 places.
[2023-03-16 22:48:35] [INFO ] Transformed 506 transitions.
[2023-03-16 22:48:35] [INFO ] Found NUPN structural information;
[2023-03-16 22:48:35] [INFO ] Parsed PT model containing 218 places and 506 transitions and 2968 arcs in 137 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 1 formulas.
Deduced a syphon composed of 61 places in 3 ms
Reduce places removed 61 places and 20 transitions.
FORMULA Railroad-PT-020-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 486/486 transitions.
Ensure Unique test removed 19 places
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 138 transition count 486
Applied a total of 19 rules in 115 ms. Remains 138 /157 variables (removed 19) and now considering 486/486 (removed 0) transitions.
// Phase 1: matrix 486 rows 138 cols
[2023-03-16 22:48:36] [INFO ] Invariants computation overflowed in 18 ms
[2023-03-16 22:48:36] [INFO ] Implicit Places using invariants in 226 ms returned []
// Phase 1: matrix 486 rows 138 cols
[2023-03-16 22:48:36] [INFO ] Invariants computation overflowed in 11 ms
[2023-03-16 22:48:36] [INFO ] Implicit Places using invariants and state equation in 420 ms returned [0, 1, 6, 9, 11, 15, 17, 39, 60, 62, 63, 66, 74, 75, 79, 82, 108, 113, 117, 123, 127, 131, 136]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 802 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 115/157 places, 486/486 transitions.
Applied a total of 0 rules in 5 ms. Remains 115 /115 variables (removed 0) and now considering 486/486 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 922 ms. Remains : 115/157 places, 486/486 transitions.
Support contains 42 out of 115 places after structural reductions.
[2023-03-16 22:48:36] [INFO ] Flatten gal took : 87 ms
[2023-03-16 22:48:36] [INFO ] Flatten gal took : 41 ms
[2023-03-16 22:48:37] [INFO ] Input system was already deterministic with 486 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 474 ms. (steps per millisecond=21 ) properties (out of 32) seen :22
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 10) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 486 rows 115 cols
[2023-03-16 22:48:37] [INFO ] Invariants computation overflowed in 6 ms
[2023-03-16 22:48:38] [INFO ] After 327ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:6
[2023-03-16 22:48:38] [INFO ] After 302ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :6
[2023-03-16 22:48:38] [INFO ] After 522ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :6
Attempting to minimize the solution found.
Minimization took 162 ms.
[2023-03-16 22:48:38] [INFO ] After 798ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :6
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 2 properties in 86 ms.
Support contains 6 out of 115 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 486/486 transitions.
Ensure Unique test removed 3 places
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 5 rules applied. Total rules applied 5 place count 112 transition count 484
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 110 transition count 484
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 7 place count 110 transition count 466
Deduced a syphon composed of 18 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 44 place count 91 transition count 466
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 90 transition count 465
Applied a total of 46 rules in 76 ms. Remains 90 /115 variables (removed 25) and now considering 465/486 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 90/115 places, 465/486 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 324358 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :{}
Probabilistic random walk after 324358 steps, saw 215898 distinct states, run finished after 3016 ms. (steps per millisecond=107 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 465 rows 90 cols
[2023-03-16 22:48:42] [INFO ] Invariants computation overflowed in 4 ms
[2023-03-16 22:48:42] [INFO ] After 250ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-16 22:48:43] [INFO ] After 406ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-16 22:48:43] [INFO ] After 530ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 68 ms.
[2023-03-16 22:48:43] [INFO ] After 666ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 22 ms.
Support contains 6 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 465/465 transitions.
Applied a total of 0 rules in 25 ms. Remains 90 /90 variables (removed 0) and now considering 465/465 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 90/90 places, 465/465 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 465/465 transitions.
Applied a total of 0 rules in 43 ms. Remains 90 /90 variables (removed 0) and now considering 465/465 (removed 0) transitions.
// Phase 1: matrix 465 rows 90 cols
[2023-03-16 22:48:43] [INFO ] Invariants computation overflowed in 9 ms
[2023-03-16 22:48:43] [INFO ] Implicit Places using invariants in 261 ms returned []
// Phase 1: matrix 465 rows 90 cols
[2023-03-16 22:48:43] [INFO ] Invariants computation overflowed in 3 ms
[2023-03-16 22:48:44] [INFO ] Implicit Places using invariants and state equation in 322 ms returned [87]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 585 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 89/90 places, 465/465 transitions.
Applied a total of 0 rules in 24 ms. Remains 89 /89 variables (removed 0) and now considering 465/465 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 654 ms. Remains : 89/90 places, 465/465 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 242 ms. (steps per millisecond=41 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 322055 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :{}
Probabilistic random walk after 322055 steps, saw 216751 distinct states, run finished after 3001 ms. (steps per millisecond=107 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 465 rows 89 cols
[2023-03-16 22:48:47] [INFO ] Invariants computation overflowed in 5 ms
[2023-03-16 22:48:47] [INFO ] After 194ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-16 22:48:47] [INFO ] After 123ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-16 22:48:47] [INFO ] After 240ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 59 ms.
[2023-03-16 22:48:48] [INFO ] After 343ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 32 ms.
Support contains 6 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 465/465 transitions.
Applied a total of 0 rules in 26 ms. Remains 89 /89 variables (removed 0) and now considering 465/465 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 89/89 places, 465/465 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 465/465 transitions.
Applied a total of 0 rules in 18 ms. Remains 89 /89 variables (removed 0) and now considering 465/465 (removed 0) transitions.
// Phase 1: matrix 465 rows 89 cols
[2023-03-16 22:48:48] [INFO ] Invariants computation overflowed in 5 ms
[2023-03-16 22:48:48] [INFO ] Implicit Places using invariants in 89 ms returned []
// Phase 1: matrix 465 rows 89 cols
[2023-03-16 22:48:48] [INFO ] Invariants computation overflowed in 5 ms
[2023-03-16 22:48:48] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 459 ms to find 0 implicit places.
[2023-03-16 22:48:48] [INFO ] Redundant transitions in 34 ms returned []
// Phase 1: matrix 465 rows 89 cols
[2023-03-16 22:48:48] [INFO ] Invariants computation overflowed in 10 ms
[2023-03-16 22:48:48] [INFO ] Dead Transitions using invariants and state equation in 171 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 692 ms. Remains : 89/89 places, 465/465 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 89 transition count 445
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 69 transition count 445
Applied a total of 40 rules in 11 ms. Remains 69 /89 variables (removed 20) and now considering 445/465 (removed 20) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 445 rows 69 cols
[2023-03-16 22:48:48] [INFO ] Computed 24 place invariants in 7 ms
[2023-03-16 22:48:48] [INFO ] [Real]Absence check using 22 positive place invariants in 3 ms returned sat
[2023-03-16 22:48:48] [INFO ] [Real]Absence check using 22 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-16 22:48:48] [INFO ] After 179ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-16 22:48:49] [INFO ] [Nat]Absence check using 22 positive place invariants in 3 ms returned sat
[2023-03-16 22:48:49] [INFO ] [Nat]Absence check using 22 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-16 22:48:49] [INFO ] After 137ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-16 22:48:49] [INFO ] After 239ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 64 ms.
[2023-03-16 22:48:49] [INFO ] After 360ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
FORMULA Railroad-PT-020-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 6 out of 115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 486/486 transitions.
Ensure Unique test removed 3 places
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 112 transition count 484
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 110 transition count 484
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 4 place count 110 transition count 464
Deduced a syphon composed of 20 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 41 rules applied. Total rules applied 45 place count 89 transition count 464
Applied a total of 45 rules in 86 ms. Remains 89 /115 variables (removed 26) and now considering 464/486 (removed 22) transitions.
// Phase 1: matrix 464 rows 89 cols
[2023-03-16 22:48:49] [INFO ] Computed 25 place invariants in 8 ms
[2023-03-16 22:48:49] [INFO ] Implicit Places using invariants in 130 ms returned []
[2023-03-16 22:48:49] [INFO ] Invariant cache hit.
[2023-03-16 22:48:50] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
[2023-03-16 22:48:50] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-16 22:48:50] [INFO ] Invariant cache hit.
[2023-03-16 22:48:50] [INFO ] Dead Transitions using invariants and state equation in 220 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 89/115 places, 464/486 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 730 ms. Remains : 89/115 places, 464/486 transitions.
Stuttering acceptance computed with spot in 229 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Railroad-PT-020-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=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s28 1) (EQ s32 1) (EQ s36 1)), p1:(AND (EQ s1 1) (EQ s52 1) (EQ s86 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 116 reset in 478 ms.
Stack based approach found an accepted trace after 2063 steps with 0 reset with depth 2064 and stack size 2064 in 11 ms.
FORMULA Railroad-PT-020-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-020-LTLFireability-00 finished in 1518 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||X((!p1||G(p2))))) U X(p0)))'
Support contains 7 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 486/486 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 112 transition count 486
Applied a total of 3 rules in 7 ms. Remains 112 /115 variables (removed 3) and now considering 486/486 (removed 0) transitions.
// Phase 1: matrix 486 rows 112 cols
[2023-03-16 22:48:51] [INFO ] Invariants computation overflowed in 3 ms
[2023-03-16 22:48:51] [INFO ] Implicit Places using invariants in 89 ms returned []
// Phase 1: matrix 486 rows 112 cols
[2023-03-16 22:48:51] [INFO ] Invariants computation overflowed in 2 ms
[2023-03-16 22:48:51] [INFO ] Implicit Places using invariants and state equation in 280 ms returned [64, 109]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 372 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 110/115 places, 486/486 transitions.
Applied a total of 0 rules in 2 ms. Remains 110 /110 variables (removed 0) and now considering 486/486 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 381 ms. Remains : 110/115 places, 486/486 transitions.
Stuttering acceptance computed with spot in 229 ms :[(NOT p0), (AND (NOT p2) (NOT p0) p1), (NOT p0), true, (NOT p2), (AND (NOT p2) p1), (AND (NOT p0) p1 (NOT p2))]
Running random walk in product with property : Railroad-PT-020-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 5}, { cond=(NOT p0), acceptance={0} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND p1 p2), acceptance={} source=5 dest: 4}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=true, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s21 1) (EQ s48 1) (EQ s56 1)), p1:(AND (EQ s24 1) (EQ s32 1) (EQ s56 1)), p2:(AND (EQ s5 1) (EQ s19 1) (EQ s56 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 35524 steps with 10929 reset in 106 ms.
FORMULA Railroad-PT-020-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Railroad-PT-020-LTLFireability-01 finished in 747 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 486/486 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 112 transition count 486
Applied a total of 3 rules in 3 ms. Remains 112 /115 variables (removed 3) and now considering 486/486 (removed 0) transitions.
// Phase 1: matrix 486 rows 112 cols
[2023-03-16 22:48:51] [INFO ] Invariants computation overflowed in 2 ms
[2023-03-16 22:48:52] [INFO ] Implicit Places using invariants in 78 ms returned []
// Phase 1: matrix 486 rows 112 cols
[2023-03-16 22:48:52] [INFO ] Invariants computation overflowed in 2 ms
[2023-03-16 22:48:52] [INFO ] Implicit Places using invariants and state equation in 446 ms returned [64, 109]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 528 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 110/115 places, 486/486 transitions.
Applied a total of 0 rules in 2 ms. Remains 110 /110 variables (removed 0) and now considering 486/486 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 534 ms. Remains : 110/115 places, 486/486 transitions.
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Railroad-PT-020-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s13 1) (EQ s50 1) (EQ s56 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Railroad-PT-020-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Railroad-PT-020-LTLFireability-02 finished in 641 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 3 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 486/486 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 112 transition count 486
Applied a total of 3 rules in 5 ms. Remains 112 /115 variables (removed 3) and now considering 486/486 (removed 0) transitions.
// Phase 1: matrix 486 rows 112 cols
[2023-03-16 22:48:52] [INFO ] Invariants computation overflowed in 2 ms
[2023-03-16 22:48:52] [INFO ] Implicit Places using invariants in 83 ms returned []
// Phase 1: matrix 486 rows 112 cols
[2023-03-16 22:48:52] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-16 22:48:53] [INFO ] Implicit Places using invariants and state equation in 427 ms returned [64, 109]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 513 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 110/115 places, 486/486 transitions.
Applied a total of 0 rules in 1 ms. Remains 110 /110 variables (removed 0) and now considering 486/486 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 520 ms. Remains : 110/115 places, 486/486 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Railroad-PT-020-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (EQ s17 1) (EQ s40 1) (EQ s56 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 112 reset in 330 ms.
Stack based approach found an accepted trace after 17117 steps with 17 reset with depth 496 and stack size 496 in 76 ms.
FORMULA Railroad-PT-020-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-020-LTLFireability-04 finished in 1060 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 486/486 transitions.
Ensure Unique test removed 3 places
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 112 transition count 484
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 110 transition count 484
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 4 place count 110 transition count 464
Deduced a syphon composed of 20 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 41 rules applied. Total rules applied 45 place count 89 transition count 464
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 47 place count 88 transition count 463
Applied a total of 47 rules in 35 ms. Remains 88 /115 variables (removed 27) and now considering 463/486 (removed 23) transitions.
// Phase 1: matrix 463 rows 88 cols
[2023-03-16 22:48:53] [INFO ] Invariants computation overflowed in 5 ms
[2023-03-16 22:48:53] [INFO ] Implicit Places using invariants in 75 ms returned []
// Phase 1: matrix 463 rows 88 cols
[2023-03-16 22:48:53] [INFO ] Invariants computation overflowed in 2 ms
[2023-03-16 22:48:54] [INFO ] Implicit Places using invariants and state equation in 232 ms returned [85]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 310 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/115 places, 463/486 transitions.
Applied a total of 0 rules in 29 ms. Remains 87 /87 variables (removed 0) and now considering 463/463 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 375 ms. Remains : 87/115 places, 463/486 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : Railroad-PT-020-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s12 1) (EQ s32 1) (EQ s36 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 436 reset in 375 ms.
Stack based approach found an accepted trace after 2775 steps with 11 reset with depth 422 and stack size 422 in 11 ms.
FORMULA Railroad-PT-020-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-020-LTLFireability-05 finished in 817 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 486/486 transitions.
Ensure Unique test removed 3 places
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 112 transition count 484
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 110 transition count 484
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 4 place count 110 transition count 464
Deduced a syphon composed of 20 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 41 rules applied. Total rules applied 45 place count 89 transition count 464
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 47 place count 88 transition count 463
Applied a total of 47 rules in 45 ms. Remains 88 /115 variables (removed 27) and now considering 463/486 (removed 23) transitions.
// Phase 1: matrix 463 rows 88 cols
[2023-03-16 22:48:54] [INFO ] Invariants computation overflowed in 6 ms
[2023-03-16 22:48:54] [INFO ] Implicit Places using invariants in 91 ms returned []
// Phase 1: matrix 463 rows 88 cols
[2023-03-16 22:48:54] [INFO ] Invariants computation overflowed in 2 ms
[2023-03-16 22:48:54] [INFO ] Implicit Places using invariants and state equation in 221 ms returned [85]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 316 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/115 places, 463/486 transitions.
Applied a total of 0 rules in 19 ms. Remains 87 /87 variables (removed 0) and now considering 463/463 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 380 ms. Remains : 87/115 places, 463/486 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : Railroad-PT-020-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s11 1) (EQ s32 1) (EQ s36 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 359 reset in 351 ms.
Stack based approach found an accepted trace after 605 steps with 3 reset with depth 25 and stack size 25 in 3 ms.
FORMULA Railroad-PT-020-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-020-LTLFireability-06 finished in 796 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&(X(F(p1))||((p1||G(p3))&&p2))))))'
Support contains 9 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 486/486 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 113 transition count 486
Applied a total of 2 rules in 3 ms. Remains 113 /115 variables (removed 2) and now considering 486/486 (removed 0) transitions.
// Phase 1: matrix 486 rows 113 cols
[2023-03-16 22:48:55] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-16 22:48:55] [INFO ] Implicit Places using invariants in 84 ms returned []
// Phase 1: matrix 486 rows 113 cols
[2023-03-16 22:48:55] [INFO ] Invariants computation overflowed in 2 ms
[2023-03-16 22:48:55] [INFO ] Implicit Places using invariants and state equation in 423 ms returned [110]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 508 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 112/115 places, 486/486 transitions.
Applied a total of 0 rules in 1 ms. Remains 112 /112 variables (removed 0) and now considering 486/486 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 514 ms. Remains : 112/115 places, 486/486 transitions.
Stuttering acceptance computed with spot in 291 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : Railroad-PT-020-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(OR (NOT p2) (AND (NOT p1) (NOT p3))), acceptance={} source=2 dest: 4}, { cond=(AND p2 (NOT p1) p3), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p3), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s64 1) (EQ s67 1)), p2:(AND (EQ s11 1) (EQ s49 1) (EQ s56 1)), p1:(AND (EQ s65 1) (EQ s92 1)), p3:(AND (EQ s20 1) (EQ s37 1) (EQ s56 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2166 reset in 290 ms.
Stack based approach found an accepted trace after 24707 steps with 524 reset with depth 25 and stack size 25 in 77 ms.
FORMULA Railroad-PT-020-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-020-LTLFireability-07 finished in 1202 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
Support contains 3 out of 115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 486/486 transitions.
Ensure Unique test removed 3 places
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 112 transition count 484
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 110 transition count 484
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 4 place count 110 transition count 464
Deduced a syphon composed of 20 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 41 rules applied. Total rules applied 45 place count 89 transition count 464
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 47 place count 88 transition count 463
Applied a total of 47 rules in 27 ms. Remains 88 /115 variables (removed 27) and now considering 463/486 (removed 23) transitions.
// Phase 1: matrix 463 rows 88 cols
[2023-03-16 22:48:56] [INFO ] Invariants computation overflowed in 6 ms
[2023-03-16 22:48:56] [INFO ] Implicit Places using invariants in 86 ms returned []
// Phase 1: matrix 463 rows 88 cols
[2023-03-16 22:48:56] [INFO ] Invariants computation overflowed in 3 ms
[2023-03-16 22:48:56] [INFO ] Implicit Places using invariants and state equation in 254 ms returned [85]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 343 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/115 places, 463/486 transitions.
Applied a total of 0 rules in 18 ms. Remains 87 /87 variables (removed 0) and now considering 463/463 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 388 ms. Remains : 87/115 places, 463/486 transitions.
Stuttering acceptance computed with spot in 67 ms :[p0, p0]
Running random walk in product with property : Railroad-PT-020-LTLFireability-09 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 s21 1) (EQ s32 1) (EQ s36 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 0 reset in 351 ms.
Product exploration explored 100000 steps with 0 reset in 526 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 111 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 123 ms :[p0, p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1384049 steps, run timeout after 3001 ms. (steps per millisecond=461 ) properties seen :{}
Probabilistic random walk after 1384049 steps, saw 875716 distinct states, run finished after 3001 ms. (steps per millisecond=461 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 463 rows 87 cols
[2023-03-16 22:49:01] [INFO ] Invariants computation overflowed in 7 ms
[2023-03-16 22:49:01] [INFO ] After 141ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 22:49:01] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 22:49:01] [INFO ] After 126ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-16 22:49:01] [INFO ] After 191ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 463/463 transitions.
Applied a total of 0 rules in 21 ms. Remains 87 /87 variables (removed 0) and now considering 463/463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 87/87 places, 463/463 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1407043 steps, run timeout after 3001 ms. (steps per millisecond=468 ) properties seen :{}
Probabilistic random walk after 1407043 steps, saw 888744 distinct states, run finished after 3003 ms. (steps per millisecond=468 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 463 rows 87 cols
[2023-03-16 22:49:04] [INFO ] Invariants computation overflowed in 7 ms
[2023-03-16 22:49:04] [INFO ] After 126ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 22:49:04] [INFO ] After 78ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 22:49:04] [INFO ] After 113ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-16 22:49:04] [INFO ] After 180ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 463/463 transitions.
Applied a total of 0 rules in 16 ms. Remains 87 /87 variables (removed 0) and now considering 463/463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 87/87 places, 463/463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 463/463 transitions.
Applied a total of 0 rules in 15 ms. Remains 87 /87 variables (removed 0) and now considering 463/463 (removed 0) transitions.
// Phase 1: matrix 463 rows 87 cols
[2023-03-16 22:49:04] [INFO ] Invariants computation overflowed in 6 ms
[2023-03-16 22:49:05] [INFO ] Implicit Places using invariants in 95 ms returned []
// Phase 1: matrix 463 rows 87 cols
[2023-03-16 22:49:05] [INFO ] Invariants computation overflowed in 3 ms
[2023-03-16 22:49:05] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
[2023-03-16 22:49:05] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 463 rows 87 cols
[2023-03-16 22:49:05] [INFO ] Invariants computation overflowed in 3 ms
[2023-03-16 22:49:05] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 514 ms. Remains : 87/87 places, 463/463 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 87 transition count 443
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 67 transition count 443
Applied a total of 40 rules in 7 ms. Remains 67 /87 variables (removed 20) and now considering 443/463 (removed 20) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 443 rows 67 cols
[2023-03-16 22:49:05] [INFO ] Invariants computation overflowed in 2 ms
[2023-03-16 22:49:05] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 22:49:05] [INFO ] After 105ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 22:49:05] [INFO ] After 145ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-16 22:49:05] [INFO ] After 195ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 131 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 64 ms :[p0, p0]
Stuttering acceptance computed with spot in 82 ms :[p0, p0]
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 463/463 transitions.
Applied a total of 0 rules in 25 ms. Remains 87 /87 variables (removed 0) and now considering 463/463 (removed 0) transitions.
// Phase 1: matrix 463 rows 87 cols
[2023-03-16 22:49:06] [INFO ] Invariants computation overflowed in 6 ms
[2023-03-16 22:49:06] [INFO ] Implicit Places using invariants in 92 ms returned []
// Phase 1: matrix 463 rows 87 cols
[2023-03-16 22:49:06] [INFO ] Invariants computation overflowed in 2 ms
[2023-03-16 22:49:06] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
[2023-03-16 22:49:06] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 463 rows 87 cols
[2023-03-16 22:49:06] [INFO ] Invariants computation overflowed in 3 ms
[2023-03-16 22:49:06] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 540 ms. Remains : 87/87 places, 463/463 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 121 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 84 ms :[p0, p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1329861 steps, run timeout after 3001 ms. (steps per millisecond=443 ) properties seen :{}
Probabilistic random walk after 1329861 steps, saw 844087 distinct states, run finished after 3001 ms. (steps per millisecond=443 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 463 rows 87 cols
[2023-03-16 22:49:09] [INFO ] Invariants computation overflowed in 4 ms
[2023-03-16 22:49:10] [INFO ] After 135ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 22:49:10] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 22:49:10] [INFO ] After 116ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-16 22:49:10] [INFO ] After 170ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 463/463 transitions.
Applied a total of 0 rules in 19 ms. Remains 87 /87 variables (removed 0) and now considering 463/463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 87/87 places, 463/463 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1380325 steps, run timeout after 3001 ms. (steps per millisecond=459 ) properties seen :{}
Probabilistic random walk after 1380325 steps, saw 873703 distinct states, run finished after 3002 ms. (steps per millisecond=459 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 463 rows 87 cols
[2023-03-16 22:49:13] [INFO ] Invariants computation overflowed in 7 ms
[2023-03-16 22:49:13] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 22:49:13] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 22:49:13] [INFO ] After 122ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-16 22:49:13] [INFO ] After 172ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 463/463 transitions.
Applied a total of 0 rules in 23 ms. Remains 87 /87 variables (removed 0) and now considering 463/463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 87/87 places, 463/463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 463/463 transitions.
Applied a total of 0 rules in 17 ms. Remains 87 /87 variables (removed 0) and now considering 463/463 (removed 0) transitions.
// Phase 1: matrix 463 rows 87 cols
[2023-03-16 22:49:13] [INFO ] Invariants computation overflowed in 5 ms
[2023-03-16 22:49:13] [INFO ] Implicit Places using invariants in 89 ms returned []
// Phase 1: matrix 463 rows 87 cols
[2023-03-16 22:49:13] [INFO ] Invariants computation overflowed in 3 ms
[2023-03-16 22:49:13] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
[2023-03-16 22:49:13] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 463 rows 87 cols
[2023-03-16 22:49:13] [INFO ] Invariants computation overflowed in 3 ms
[2023-03-16 22:49:14] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 528 ms. Remains : 87/87 places, 463/463 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 87 transition count 443
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 67 transition count 443
Applied a total of 40 rules in 9 ms. Remains 67 /87 variables (removed 20) and now considering 443/463 (removed 20) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 443 rows 67 cols
[2023-03-16 22:49:14] [INFO ] Invariants computation overflowed in 3 ms
[2023-03-16 22:49:14] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 22:49:14] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 22:49:14] [INFO ] After 116ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-16 22:49:14] [INFO ] After 170ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 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 62 ms :[p0, p0]
Stuttering acceptance computed with spot in 77 ms :[p0, p0]
Stuttering acceptance computed with spot in 74 ms :[p0, p0]
Product exploration explored 100000 steps with 0 reset in 380 ms.
Product exploration explored 100000 steps with 0 reset in 492 ms.
Built C files in :
/tmp/ltsmin15013724621728167881
[2023-03-16 22:49:15] [INFO ] Computing symmetric may disable matrix : 463 transitions.
[2023-03-16 22:49:15] [INFO ] Computation of Complete disable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 22:49:15] [INFO ] Computing symmetric may enable matrix : 463 transitions.
[2023-03-16 22:49:15] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 22:49:15] [INFO ] Computing Do-Not-Accords matrix : 463 transitions.
[2023-03-16 22:49:15] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 22:49:15] [INFO ] Built C files in 110ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15013724621728167881
Running compilation step : cd /tmp/ltsmin15013724621728167881;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1154 ms.
Running link step : cd /tmp/ltsmin15013724621728167881;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin15013724621728167881;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6931288780743868550.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 463/463 transitions.
Applied a total of 0 rules in 22 ms. Remains 87 /87 variables (removed 0) and now considering 463/463 (removed 0) transitions.
// Phase 1: matrix 463 rows 87 cols
[2023-03-16 22:49:30] [INFO ] Invariants computation overflowed in 5 ms
[2023-03-16 22:49:30] [INFO ] Implicit Places using invariants in 90 ms returned []
// Phase 1: matrix 463 rows 87 cols
[2023-03-16 22:49:30] [INFO ] Invariants computation overflowed in 3 ms
[2023-03-16 22:49:31] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
[2023-03-16 22:49:31] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 463 rows 87 cols
[2023-03-16 22:49:31] [INFO ] Invariants computation overflowed in 2 ms
[2023-03-16 22:49:31] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 515 ms. Remains : 87/87 places, 463/463 transitions.
Built C files in :
/tmp/ltsmin3771882385639784265
[2023-03-16 22:49:31] [INFO ] Computing symmetric may disable matrix : 463 transitions.
[2023-03-16 22:49:31] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 22:49:31] [INFO ] Computing symmetric may enable matrix : 463 transitions.
[2023-03-16 22:49:31] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 22:49:31] [INFO ] Computing Do-Not-Accords matrix : 463 transitions.
[2023-03-16 22:49:31] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 22:49:31] [INFO ] Built C files in 72ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3771882385639784265
Running compilation step : cd /tmp/ltsmin3771882385639784265;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1077 ms.
Running link step : cd /tmp/ltsmin3771882385639784265;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin3771882385639784265;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16998410926144950254.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 22:49:46] [INFO ] Flatten gal took : 25 ms
[2023-03-16 22:49:46] [INFO ] Flatten gal took : 22 ms
[2023-03-16 22:49:46] [INFO ] Time to serialize gal into /tmp/LTL1029862174400225464.gal : 4 ms
[2023-03-16 22:49:46] [INFO ] Time to serialize properties into /tmp/LTL12578071526353046113.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1029862174400225464.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1669101489969028077.hoa' '-atoms' '/tmp/LTL12578071526353046113.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL12578071526353046113.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1669101489969028077.hoa
Detected timeout of ITS tools.
[2023-03-16 22:50:01] [INFO ] Flatten gal took : 52 ms
[2023-03-16 22:50:01] [INFO ] Flatten gal took : 47 ms
[2023-03-16 22:50:01] [INFO ] Time to serialize gal into /tmp/LTL576410881935540994.gal : 4 ms
[2023-03-16 22:50:01] [INFO ] Time to serialize properties into /tmp/LTL11256918117588622703.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL576410881935540994.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11256918117588622703.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F("(((pl_P21_2==0)||(pl_P23_7==0))||(pl_P36_1==0))"))))
Formula 0 simplified : FG!"(((pl_P21_2==0)||(pl_P23_7==0))||(pl_P36_1==0))"
Detected timeout of ITS tools.
[2023-03-16 22:50:16] [INFO ] Flatten gal took : 17 ms
[2023-03-16 22:50:16] [INFO ] Applying decomposition
[2023-03-16 22:50:16] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph14149161043547789283.txt' '-o' '/tmp/graph14149161043547789283.bin' '-w' '/tmp/graph14149161043547789283.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph14149161043547789283.bin' '-l' '-1' '-v' '-w' '/tmp/graph14149161043547789283.weights' '-q' '0' '-e' '0.001'
[2023-03-16 22:50:16] [INFO ] Decomposing Gal with order
[2023-03-16 22:50:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 22:50:17] [INFO ] Removed a total of 1263 redundant transitions.
[2023-03-16 22:50:17] [INFO ] Flatten gal took : 153 ms
[2023-03-16 22:50:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 28 ms.
[2023-03-16 22:50:17] [INFO ] Time to serialize gal into /tmp/LTL1979078630448393644.gal : 20 ms
[2023-03-16 22:50:17] [INFO ] Time to serialize properties into /tmp/LTL15471729602708857587.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1979078630448393644.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15471729602708857587.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F("(((i4.u6.pl_P21_2==0)||(u23.pl_P23_7==0))||(i4.u6.pl_P36_1==0))"))))
Formula 0 simplified : FG!"(((i4.u6.pl_P21_2==0)||(u23.pl_P23_7==0))||(i4.u6.pl_P36_1==0))"
Reverse transition relation is NOT exact ! Due to transitions t444, t446, t447, t449, t451, t452, t453, t457, t458, t459, t460, t461, t468_t470_t56, i4.u6....266
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
50 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.558672,41140,1,0,67395,337,3229,47211,228,959,137139
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Railroad-PT-020-LTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property Railroad-PT-020-LTLFireability-09 finished in 81502 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(((p1 U X(p2))&&p0))||G(p3))))'
Support contains 7 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 486/486 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 112 transition count 486
Applied a total of 3 rules in 2 ms. Remains 112 /115 variables (removed 3) and now considering 486/486 (removed 0) transitions.
// Phase 1: matrix 486 rows 112 cols
[2023-03-16 22:50:18] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-16 22:50:18] [INFO ] Implicit Places using invariants in 184 ms returned []
// Phase 1: matrix 486 rows 112 cols
[2023-03-16 22:50:18] [INFO ] Invariants computation overflowed in 2 ms
[2023-03-16 22:50:18] [INFO ] Implicit Places using invariants and state equation in 352 ms returned [64, 109]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 549 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 110/115 places, 486/486 transitions.
Applied a total of 0 rules in 1 ms. Remains 110 /110 variables (removed 0) and now considering 486/486 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 552 ms. Remains : 110/115 places, 486/486 transitions.
Stuttering acceptance computed with spot in 203 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : Railroad-PT-020-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p3 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p3 p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p3) p0 p1), acceptance={0} source=1 dest: 2}, { cond=(AND p3 p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p3) p0 (NOT p1)), acceptance={0} source=1 dest: 3}], [{ cond=(AND p3 p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) p1 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p3 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p3) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(AND p3 (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p3) (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND p3 p0 p1 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p3) p0 p1 (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p3 p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p3) p0 (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p3:(AND (EQ s1 1) (EQ s4 1)), p0:(AND (EQ s1 1) (EQ s4 1)), p1:(AND (EQ s22 1) (EQ s45 1) (EQ s56 1)), p2:(AND (EQ s24 1) (EQ s49 1) (EQ s56 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 358 ms.
Stack based approach found an accepted trace after 28902 steps with 0 reset with depth 28903 and stack size 28903 in 110 ms.
FORMULA Railroad-PT-020-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-020-LTLFireability-10 finished in 1304 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 3 out of 115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 486/486 transitions.
Ensure Unique test removed 3 places
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 112 transition count 484
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 110 transition count 484
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 4 place count 110 transition count 464
Deduced a syphon composed of 20 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 41 rules applied. Total rules applied 45 place count 89 transition count 464
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 47 place count 88 transition count 463
Applied a total of 47 rules in 30 ms. Remains 88 /115 variables (removed 27) and now considering 463/486 (removed 23) transitions.
// Phase 1: matrix 463 rows 88 cols
[2023-03-16 22:50:19] [INFO ] Invariants computation overflowed in 2 ms
[2023-03-16 22:50:19] [INFO ] Implicit Places using invariants in 481 ms returned []
// Phase 1: matrix 463 rows 88 cols
[2023-03-16 22:50:19] [INFO ] Invariants computation overflowed in 2 ms
[2023-03-16 22:50:20] [INFO ] Implicit Places using invariants and state equation in 259 ms returned [85]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 769 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/115 places, 463/486 transitions.
Applied a total of 0 rules in 19 ms. Remains 87 /87 variables (removed 0) and now considering 463/463 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 819 ms. Remains : 87/115 places, 463/486 transitions.
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : Railroad-PT-020-LTLFireability-11 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:(AND (EQ s16 1) (EQ s32 1) (EQ s36 1)), p1:(OR (EQ s16 0) (EQ s32 0) (EQ s36 0))], 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 434 ms.
Stack based approach found an accepted trace after 17332 steps with 0 reset with depth 17333 and stack size 17307 in 69 ms.
FORMULA Railroad-PT-020-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-020-LTLFireability-11 finished in 1384 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0)) U (X((G((p2 U p0)) U p3))&&p1)))'
Support contains 7 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 486/486 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 113 transition count 486
Applied a total of 2 rules in 4 ms. Remains 113 /115 variables (removed 2) and now considering 486/486 (removed 0) transitions.
// Phase 1: matrix 486 rows 113 cols
[2023-03-16 22:50:20] [INFO ] Computed 27 place invariants in 2 ms
[2023-03-16 22:50:20] [INFO ] Implicit Places using invariants in 162 ms returned [64, 110]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 172 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 111/115 places, 486/486 transitions.
Applied a total of 0 rules in 1 ms. Remains 111 /111 variables (removed 0) and now considering 486/486 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 178 ms. Remains : 111/115 places, 486/486 transitions.
Stuttering acceptance computed with spot in 566 ms :[(OR (NOT p1) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3)), (NOT p3), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : Railroad-PT-020-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=p1, acceptance={0} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=2 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(OR (AND p1 (NOT p3)) (AND p0 (NOT p3)) (AND (NOT p3) p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) p2), acceptance={0} source=3 dest: 4}, { cond=(OR (AND (NOT p1) p0 (NOT p3)) (AND (NOT p1) (NOT p3) p2)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=4 dest: 4}, { cond=(AND p1 (NOT p0) p2), acceptance={0} source=4 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 1}, { cond=p1, acceptance={} source=5 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=5 dest: 4}, { cond=(OR (AND (NOT p1) p0) (AND (NOT p1) p2)), acceptance={} source=5 dest: 5}, { cond=(AND p1 (NOT p0) p2), acceptance={0} source=5 dest: 6}, { cond=(OR (AND p1 p0) (AND p1 p2)), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), acceptance={0} source=6 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p3)), acceptance={} source=6 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p3) (NOT p2)), acceptance={0} source=6 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) p2), acceptance={0} source=6 dest: 4}, { cond=(AND p1 (NOT p0) (NOT p3) p2), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), acceptance={0} source=7 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=7 dest: 1}, { cond=(AND p1 (NOT p3)), acceptance={} source=7 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p3) (NOT p2)), acceptance={0} source=7 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) p2), acceptance={0} source=7 dest: 4}, { cond=(OR (AND (NOT p1) p0 (NOT p3)) (AND (NOT p1) (NOT p3) p2)), acceptance={} source=7 dest: 5}, { cond=(AND p1 (NOT p0) (NOT p3) p2), acceptance={0} source=7 dest: 6}, { cond=(OR (AND p1 p0 (NOT p3)) (AND p1 (NOT p3) p2)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(AND (EQ s64 1) (EQ s89 1)), p0:(AND (EQ s23 1) (EQ s35 1) (EQ s56 1)), p3:(AND (EQ s28 1) (EQ s45 1) (EQ s56 1)), p2:(AND (EQ s64 1) (EQ s89 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 286 ms.
Stack based approach found an accepted trace after 8072 steps with 0 reset with depth 8073 and stack size 8073 in 24 ms.
FORMULA Railroad-PT-020-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-020-LTLFireability-12 finished in 1083 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U (F(G(!p1)) U p2)))'
Support contains 6 out of 115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 486/486 transitions.
Ensure Unique test removed 3 places
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 112 transition count 484
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 110 transition count 484
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 4 place count 110 transition count 466
Deduced a syphon composed of 18 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 41 place count 91 transition count 466
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 43 place count 90 transition count 465
Applied a total of 43 rules in 31 ms. Remains 90 /115 variables (removed 25) and now considering 465/486 (removed 21) transitions.
// Phase 1: matrix 465 rows 90 cols
[2023-03-16 22:50:21] [INFO ] Invariants computation overflowed in 2 ms
[2023-03-16 22:50:21] [INFO ] Implicit Places using invariants in 101 ms returned []
// Phase 1: matrix 465 rows 90 cols
[2023-03-16 22:50:21] [INFO ] Invariants computation overflowed in 2 ms
[2023-03-16 22:50:22] [INFO ] Implicit Places using invariants and state equation in 246 ms returned [87]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 381 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 89/115 places, 465/486 transitions.
Applied a total of 0 rules in 23 ms. Remains 89 /89 variables (removed 0) and now considering 465/465 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 435 ms. Remains : 89/115 places, 465/486 transitions.
Stuttering acceptance computed with spot in 216 ms :[(NOT p2), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : Railroad-PT-020-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(AND (EQ s30 1) (EQ s33 1) (EQ s38 1)), p1:(AND (EQ s27 1) (EQ s32 1) (EQ s38 1)), p0:(AND (EQ s30 1) (EQ s34 1) (EQ s38 1))], 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 14 reset in 340 ms.
Product exploration explored 100000 steps with 23 reset in 367 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 p2) (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p2)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 447 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(NOT p2), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Finished random walk after 347 steps, including 0 resets, run visited all 4 properties in 7 ms. (steps per millisecond=49 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p2)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F p2), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p2) (NOT p0) p1))]
Knowledge based reduction with 10 factoid took 556 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 140 ms :[(NOT p2), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 117 ms :[(NOT p2), (AND (NOT p0) p1), (AND (NOT p0) p1)]
// Phase 1: matrix 465 rows 89 cols
[2023-03-16 22:50:24] [INFO ] Invariants computation overflowed in 6 ms
[2023-03-16 22:50:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 22:50:24] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2023-03-16 22:50:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 22:50:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 22:50:25] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2023-03-16 22:50:25] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 0 ms to minimize.
[2023-03-16 22:50:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 83 ms
Proved EG (NOT p2)
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p2)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F p2), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p2) (NOT p0) p1)), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 10 factoid took 236 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Railroad-PT-020-LTLFireability-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Railroad-PT-020-LTLFireability-13 finished in 3604 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 5 out of 115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 486/486 transitions.
Ensure Unique test removed 3 places
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 112 transition count 484
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 110 transition count 484
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 4 place count 110 transition count 465
Deduced a syphon composed of 19 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 39 rules applied. Total rules applied 43 place count 90 transition count 465
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 45 place count 89 transition count 464
Applied a total of 45 rules in 34 ms. Remains 89 /115 variables (removed 26) and now considering 464/486 (removed 22) transitions.
// Phase 1: matrix 464 rows 89 cols
[2023-03-16 22:50:25] [INFO ] Computed 25 place invariants in 6 ms
[2023-03-16 22:50:25] [INFO ] Implicit Places using invariants in 139 ms returned [86]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 140 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 88/115 places, 464/486 transitions.
Applied a total of 0 rules in 18 ms. Remains 88 /88 variables (removed 0) and now considering 464/464 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 195 ms. Remains : 88/115 places, 464/486 transitions.
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : Railroad-PT-020-LTLFireability-14 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:(OR (EQ s24 0) (EQ s33 0) (EQ s37 0)), p1:(OR (EQ s14 0) (EQ s32 0) (EQ s37 0))], 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 383 ms.
Product exploration explored 100000 steps with 0 reset in 406 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 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 319 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 464 rows 88 cols
[2023-03-16 22:50:26] [INFO ] Computed 24 place invariants in 6 ms
[2023-03-16 22:50:27] [INFO ] [Real]Absence check using 22 positive place invariants in 2 ms returned sat
[2023-03-16 22:50:27] [INFO ] [Real]Absence check using 22 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-16 22:50:27] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-16 22:50:27] [INFO ] [Nat]Absence check using 22 positive place invariants in 3 ms returned sat
[2023-03-16 22:50:27] [INFO ] [Nat]Absence check using 22 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-16 22:50:27] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-16 22:50:27] [INFO ] After 120ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-16 22:50:27] [INFO ] After 184ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 464/464 transitions.
Applied a total of 0 rules in 16 ms. Remains 88 /88 variables (removed 0) and now considering 464/464 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 88/88 places, 464/464 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1401467 steps, run timeout after 3001 ms. (steps per millisecond=467 ) properties seen :{}
Probabilistic random walk after 1401467 steps, saw 905734 distinct states, run finished after 3001 ms. (steps per millisecond=467 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 22:50:30] [INFO ] Invariant cache hit.
[2023-03-16 22:50:30] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 22:50:30] [INFO ] [Nat]Absence check using 22 positive place invariants in 3 ms returned sat
[2023-03-16 22:50:30] [INFO ] [Nat]Absence check using 22 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-16 22:50:30] [INFO ] After 90ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 22:50:30] [INFO ] After 119ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-16 22:50:30] [INFO ] After 179ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 464/464 transitions.
Applied a total of 0 rules in 15 ms. Remains 88 /88 variables (removed 0) and now considering 464/464 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 88/88 places, 464/464 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 464/464 transitions.
Applied a total of 0 rules in 14 ms. Remains 88 /88 variables (removed 0) and now considering 464/464 (removed 0) transitions.
[2023-03-16 22:50:30] [INFO ] Invariant cache hit.
[2023-03-16 22:50:30] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-16 22:50:30] [INFO ] Invariant cache hit.
[2023-03-16 22:50:30] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
[2023-03-16 22:50:30] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-16 22:50:30] [INFO ] Invariant cache hit.
[2023-03-16 22:50:31] [INFO ] Dead Transitions using invariants and state equation in 230 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 552 ms. Remains : 88/88 places, 464/464 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 88 transition count 444
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 68 transition count 444
Applied a total of 40 rules in 7 ms. Remains 68 /88 variables (removed 20) and now considering 444/464 (removed 20) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 444 rows 68 cols
[2023-03-16 22:50:31] [INFO ] Invariants computation overflowed in 3 ms
[2023-03-16 22:50:31] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 22:50:31] [INFO ] After 86ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 22:50:31] [INFO ] After 121ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-16 22:50:31] [INFO ] After 172ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 10 factoid took 382 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p0) (NOT p1))]
Support contains 5 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 464/464 transitions.
Applied a total of 0 rules in 22 ms. Remains 88 /88 variables (removed 0) and now considering 464/464 (removed 0) transitions.
[2023-03-16 22:50:31] [INFO ] Invariant cache hit.
[2023-03-16 22:50:31] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-16 22:50:31] [INFO ] Invariant cache hit.
[2023-03-16 22:50:32] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
[2023-03-16 22:50:32] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-16 22:50:32] [INFO ] Invariant cache hit.
[2023-03-16 22:50:32] [INFO ] Dead Transitions using invariants and state equation in 222 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 549 ms. Remains : 88/88 places, 464/464 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 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 316 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-16 22:50:32] [INFO ] Invariant cache hit.
[2023-03-16 22:50:32] [INFO ] [Real]Absence check using 22 positive place invariants in 3 ms returned sat
[2023-03-16 22:50:32] [INFO ] [Real]Absence check using 22 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-16 22:50:32] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-16 22:50:32] [INFO ] [Nat]Absence check using 22 positive place invariants in 3 ms returned sat
[2023-03-16 22:50:32] [INFO ] [Nat]Absence check using 22 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-16 22:50:33] [INFO ] After 93ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-16 22:50:33] [INFO ] After 124ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-16 22:50:33] [INFO ] After 182ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 464/464 transitions.
Applied a total of 0 rules in 17 ms. Remains 88 /88 variables (removed 0) and now considering 464/464 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 88/88 places, 464/464 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1458921 steps, run timeout after 3001 ms. (steps per millisecond=486 ) properties seen :{}
Probabilistic random walk after 1458921 steps, saw 940282 distinct states, run finished after 3002 ms. (steps per millisecond=485 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 22:50:36] [INFO ] Invariant cache hit.
[2023-03-16 22:50:36] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 22:50:36] [INFO ] [Nat]Absence check using 22 positive place invariants in 3 ms returned sat
[2023-03-16 22:50:36] [INFO ] [Nat]Absence check using 22 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-16 22:50:36] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 22:50:36] [INFO ] After 116ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-16 22:50:36] [INFO ] After 175ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 5 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 464/464 transitions.
Applied a total of 0 rules in 16 ms. Remains 88 /88 variables (removed 0) and now considering 464/464 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 88/88 places, 464/464 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 464/464 transitions.
Applied a total of 0 rules in 15 ms. Remains 88 /88 variables (removed 0) and now considering 464/464 (removed 0) transitions.
[2023-03-16 22:50:36] [INFO ] Invariant cache hit.
[2023-03-16 22:50:36] [INFO ] Implicit Places using invariants in 105 ms returned []
[2023-03-16 22:50:36] [INFO ] Invariant cache hit.
[2023-03-16 22:50:36] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
[2023-03-16 22:50:36] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-16 22:50:36] [INFO ] Invariant cache hit.
[2023-03-16 22:50:36] [INFO ] Dead Transitions using invariants and state equation in 224 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 548 ms. Remains : 88/88 places, 464/464 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 88 transition count 444
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 68 transition count 444
Applied a total of 40 rules in 6 ms. Remains 68 /88 variables (removed 20) and now considering 444/464 (removed 20) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 444 rows 68 cols
[2023-03-16 22:50:36] [INFO ] Invariants computation overflowed in 3 ms
[2023-03-16 22:50:36] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 22:50:37] [INFO ] After 80ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 22:50:37] [INFO ] After 106ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-16 22:50:37] [INFO ] After 161ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 10 factoid took 406 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 382 ms.
Product exploration explored 100000 steps with 0 reset in 409 ms.
Built C files in :
/tmp/ltsmin13673060166860756766
[2023-03-16 22:50:38] [INFO ] Computing symmetric may disable matrix : 464 transitions.
[2023-03-16 22:50:38] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 22:50:38] [INFO ] Computing symmetric may enable matrix : 464 transitions.
[2023-03-16 22:50:38] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 22:50:38] [INFO ] Computing Do-Not-Accords matrix : 464 transitions.
[2023-03-16 22:50:38] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 22:50:38] [INFO ] Built C files in 63ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13673060166860756766
Running compilation step : cd /tmp/ltsmin13673060166860756766;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1117 ms.
Running link step : cd /tmp/ltsmin13673060166860756766;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin13673060166860756766;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17876318435160525447.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 464/464 transitions.
Applied a total of 0 rules in 25 ms. Remains 88 /88 variables (removed 0) and now considering 464/464 (removed 0) transitions.
[2023-03-16 22:50:53] [INFO ] Invariant cache hit.
[2023-03-16 22:50:53] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-03-16 22:50:53] [INFO ] Invariant cache hit.
[2023-03-16 22:50:53] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
[2023-03-16 22:50:53] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-16 22:50:53] [INFO ] Invariant cache hit.
[2023-03-16 22:50:54] [INFO ] Dead Transitions using invariants and state equation in 212 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 537 ms. Remains : 88/88 places, 464/464 transitions.
Built C files in :
/tmp/ltsmin10061989826258143144
[2023-03-16 22:50:54] [INFO ] Computing symmetric may disable matrix : 464 transitions.
[2023-03-16 22:50:54] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 22:50:54] [INFO ] Computing symmetric may enable matrix : 464 transitions.
[2023-03-16 22:50:54] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 22:50:54] [INFO ] Computing Do-Not-Accords matrix : 464 transitions.
[2023-03-16 22:50:54] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 22:50:54] [INFO ] Built C files in 63ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10061989826258143144
Running compilation step : cd /tmp/ltsmin10061989826258143144;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1062 ms.
Running link step : cd /tmp/ltsmin10061989826258143144;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin10061989826258143144;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13466954273878984956.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 22:51:09] [INFO ] Flatten gal took : 18 ms
[2023-03-16 22:51:09] [INFO ] Flatten gal took : 17 ms
[2023-03-16 22:51:09] [INFO ] Time to serialize gal into /tmp/LTL11545703046782689936.gal : 4 ms
[2023-03-16 22:51:09] [INFO ] Time to serialize properties into /tmp/LTL12439767565482765879.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11545703046782689936.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4932309076335553444.hoa' '-atoms' '/tmp/LTL12439767565482765879.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL12439767565482765879.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4932309076335553444.hoa
Detected timeout of ITS tools.
[2023-03-16 22:51:24] [INFO ] Flatten gal took : 16 ms
[2023-03-16 22:51:24] [INFO ] Flatten gal took : 15 ms
[2023-03-16 22:51:24] [INFO ] Time to serialize gal into /tmp/LTL3135763288841188627.gal : 4 ms
[2023-03-16 22:51:24] [INFO ] Time to serialize properties into /tmp/LTL11330017762935881232.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3135763288841188627.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11330017762935881232.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G("(((pl_P21_3==0)||(pl_P23_8==0))||(pl_P36_1==0))"))||(G("(((pl_P21_13==0)||(pl_P23_19==0))||(pl_P36_1==0))")))))
Formula 0 simplified : G(F!"(((pl_P21_3==0)||(pl_P23_8==0))||(pl_P36_1==0))" & F!"(((pl_P21_13==0)||(pl_P23_19==0))||(pl_P36_1==0))")
Detected timeout of ITS tools.
[2023-03-16 22:51:39] [INFO ] Flatten gal took : 46 ms
[2023-03-16 22:51:39] [INFO ] Applying decomposition
[2023-03-16 22:51:39] [INFO ] Flatten gal took : 32 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph16943098299750208843.txt' '-o' '/tmp/graph16943098299750208843.bin' '-w' '/tmp/graph16943098299750208843.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph16943098299750208843.bin' '-l' '-1' '-v' '-w' '/tmp/graph16943098299750208843.weights' '-q' '0' '-e' '0.001'
[2023-03-16 22:51:39] [INFO ] Decomposing Gal with order
[2023-03-16 22:51:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 22:51:39] [INFO ] Removed a total of 1263 redundant transitions.
[2023-03-16 22:51:39] [INFO ] Flatten gal took : 58 ms
[2023-03-16 22:51:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 7 ms.
[2023-03-16 22:51:39] [INFO ] Time to serialize gal into /tmp/LTL16019750073265194854.gal : 3 ms
[2023-03-16 22:51:39] [INFO ] Time to serialize properties into /tmp/LTL234425371277465542.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16019750073265194854.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL234425371277465542.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F((G("(((i5.u6.pl_P21_3==0)||(u25.pl_P23_8==0))||(i5.u6.pl_P36_1==0))"))||(G("(((i2.u3.pl_P21_13==0)||(u20.pl_P23_19==0))||(i5.u6.p...173
Formula 0 simplified : G(F!"(((i5.u6.pl_P21_3==0)||(u25.pl_P23_8==0))||(i5.u6.pl_P36_1==0))" & F!"(((i2.u3.pl_P21_13==0)||(u20.pl_P23_19==0))||(i5.u6.pl_P3...165
Reverse transition relation is NOT exact ! Due to transitions t445, t448, t449, t450, t451, t452, t456, t457, t458, t459, t460, t461, t468_t470_t56, i5.u6....266
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
410 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,4.12582,175980,1,0,357809,372,3241,445936,229,1281,766931
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Railroad-PT-020-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property Railroad-PT-020-LTLFireability-14 finished in 79594 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&G(p1))))'
Support contains 5 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 486/486 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 113 transition count 486
Applied a total of 2 rules in 4 ms. Remains 113 /115 variables (removed 2) and now considering 486/486 (removed 0) transitions.
// Phase 1: matrix 486 rows 113 cols
[2023-03-16 22:51:44] [INFO ] Computed 27 place invariants in 4 ms
[2023-03-16 22:51:45] [INFO ] Implicit Places using invariants in 182 ms returned [65, 110]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 183 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 111/115 places, 486/486 transitions.
Applied a total of 0 rules in 1 ms. Remains 111 /111 variables (removed 0) and now considering 486/486 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 190 ms. Remains : 111/115 places, 486/486 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Railroad-PT-020-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(OR (EQ s23 0) (EQ s51 0) (EQ s57 0)), p0:(OR (EQ s2 0) (EQ s4 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 51733 steps with 0 reset in 189 ms.
FORMULA Railroad-PT-020-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Railroad-PT-020-LTLFireability-15 finished in 513 ms.
All properties solved by simple procedures.
Total runtime 189998 ms.

BK_STOP 1679007106433

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is Railroad-PT-020, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r325-tall-167889197100380"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Railroad-PT-020.tgz
mv Railroad-PT-020 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;