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.r329-tall-167889202000388.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 ltsminxred
Input is Railroad-PT-050, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r329-tall-167889202000388
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 7.0K Feb 25 22:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 25 22:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 22:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 22:32 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 3.6K Feb 25 16:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 22:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Feb 25 22:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 22:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 25 22:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:42 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 1.4M 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-050-LTLFireability-00
FORMULA_NAME Railroad-PT-050-LTLFireability-01
FORMULA_NAME Railroad-PT-050-LTLFireability-02
FORMULA_NAME Railroad-PT-050-LTLFireability-03
FORMULA_NAME Railroad-PT-050-LTLFireability-04
FORMULA_NAME Railroad-PT-050-LTLFireability-05
FORMULA_NAME Railroad-PT-050-LTLFireability-06
FORMULA_NAME Railroad-PT-050-LTLFireability-07
FORMULA_NAME Railroad-PT-050-LTLFireability-08
FORMULA_NAME Railroad-PT-050-LTLFireability-09
FORMULA_NAME Railroad-PT-050-LTLFireability-10
FORMULA_NAME Railroad-PT-050-LTLFireability-11
FORMULA_NAME Railroad-PT-050-LTLFireability-12
FORMULA_NAME Railroad-PT-050-LTLFireability-13
FORMULA_NAME Railroad-PT-050-LTLFireability-14
FORMULA_NAME Railroad-PT-050-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679125030831

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Railroad-PT-050
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-18 07:37:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 07:37:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 07:37:12] [INFO ] Load time of PNML (sax parser for PT used): 158 ms
[2023-03-18 07:37:12] [INFO ] Transformed 518 places.
[2023-03-18 07:37:12] [INFO ] Transformed 2756 transitions.
[2023-03-18 07:37:12] [INFO ] Found NUPN structural information;
[2023-03-18 07:37:12] [INFO ] Parsed PT model containing 518 places and 2756 transitions and 16378 arcs in 252 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 4 formulas.
Deduced a syphon composed of 151 places in 22 ms
Reduce places removed 151 places and 50 transitions.
FORMULA Railroad-PT-050-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-050-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-050-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-050-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 367 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 367/367 places, 2706/2706 transitions.
Ensure Unique test removed 50 places
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 317 transition count 2706
Applied a total of 50 rules in 128 ms. Remains 317 /367 variables (removed 50) and now considering 2706/2706 (removed 0) transitions.
// Phase 1: matrix 2706 rows 317 cols
[2023-03-18 07:37:12] [INFO ] Invariants computation overflowed in 23 ms
[2023-03-18 07:37:13] [INFO ] Implicit Places using invariants in 430 ms returned []
// Phase 1: matrix 2706 rows 317 cols
[2023-03-18 07:37:13] [INFO ] Invariants computation overflowed in 10 ms
[2023-03-18 07:37:15] [INFO ] Implicit Places using invariants and state equation in 1928 ms returned [0, 1, 6, 7, 8, 11, 12, 17, 18, 19, 24, 25, 26, 29, 35, 137, 138, 144, 145, 146, 148, 149, 151, 156, 157, 160, 165, 166, 167, 169, 170, 172, 174, 177, 230, 233, 237, 247, 248, 249, 250, 254, 267, 271, 273, 275, 277, 279, 280, 281, 283, 293, 296, 303, 304]
Discarding 55 places :
Implicit Place search using SMT with State Equation took 2453 ms to find 55 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 262/367 places, 2706/2706 transitions.
Applied a total of 0 rules in 23 ms. Remains 262 /262 variables (removed 0) and now considering 2706/2706 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2605 ms. Remains : 262/367 places, 2706/2706 transitions.
Support contains 47 out of 262 places after structural reductions.
[2023-03-18 07:37:15] [INFO ] Flatten gal took : 238 ms
[2023-03-18 07:37:15] [INFO ] Flatten gal took : 159 ms
[2023-03-18 07:37:16] [INFO ] Input system was already deterministic with 2706 transitions.
Support contains 45 out of 262 places (down from 47) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 620 ms. (steps per millisecond=16 ) properties (out of 30) seen :11
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
// Phase 1: matrix 2706 rows 262 cols
[2023-03-18 07:37:16] [INFO ] Invariants computation overflowed in 10 ms
[2023-03-18 07:37:19] [INFO ] After 2148ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:18
[2023-03-18 07:37:21] [INFO ] After 1716ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :18
[2023-03-18 07:37:23] [INFO ] After 3802ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :18
Attempting to minimize the solution found.
Minimization took 1284 ms.
[2023-03-18 07:37:24] [INFO ] After 5298ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :18
Fused 19 Parikh solutions to 18 different solutions.
Parikh walk visited 17 properties in 817 ms.
Support contains 3 out of 262 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 262/262 places, 2706/2706 transitions.
Ensure Unique test removed 2 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 4 rules applied. Total rules applied 4 place count 260 transition count 2704
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 258 transition count 2704
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 6 place count 258 transition count 2653
Deduced a syphon composed of 51 places in 3 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 108 place count 207 transition count 2653
Applied a total of 108 rules in 683 ms. Remains 207 /262 variables (removed 55) and now considering 2653/2706 (removed 53) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 684 ms. Remains : 207/262 places, 2653/2706 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 696727 steps, run timeout after 3001 ms. (steps per millisecond=232 ) properties seen :{}
Probabilistic random walk after 696727 steps, saw 607741 distinct states, run finished after 3002 ms. (steps per millisecond=232 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2653 rows 207 cols
[2023-03-18 07:37:29] [INFO ] Invariants computation overflowed in 17 ms
[2023-03-18 07:37:29] [INFO ] After 572ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 07:37:30] [INFO ] After 475ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 07:37:30] [INFO ] After 584ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 67 ms.
[2023-03-18 07:37:30] [INFO ] After 707ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 3 out of 207 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 2653/2653 transitions.
Applied a total of 0 rules in 567 ms. Remains 207 /207 variables (removed 0) and now considering 2653/2653 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 567 ms. Remains : 207/207 places, 2653/2653 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 2653/2653 transitions.
Applied a total of 0 rules in 504 ms. Remains 207 /207 variables (removed 0) and now considering 2653/2653 (removed 0) transitions.
// Phase 1: matrix 2653 rows 207 cols
[2023-03-18 07:37:31] [INFO ] Invariants computation overflowed in 16 ms
[2023-03-18 07:37:31] [INFO ] Implicit Places using invariants in 269 ms returned []
// Phase 1: matrix 2653 rows 207 cols
[2023-03-18 07:37:31] [INFO ] Invariants computation overflowed in 16 ms
[2023-03-18 07:37:32] [INFO ] Implicit Places using invariants and state equation in 1060 ms returned []
Implicit Place search using SMT with State Equation took 1339 ms to find 0 implicit places.
[2023-03-18 07:37:33] [INFO ] Redundant transitions in 176 ms returned []
// Phase 1: matrix 2653 rows 207 cols
[2023-03-18 07:37:33] [INFO ] Invariants computation overflowed in 11 ms
[2023-03-18 07:37:33] [INFO ] Dead Transitions using invariants and state equation in 787 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2826 ms. Remains : 207/207 places, 2653/2653 transitions.
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 50 Pre rules applied. Total rules applied 0 place count 207 transition count 2603
Deduced a syphon composed of 50 places in 4 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 0 with 100 rules applied. Total rules applied 100 place count 157 transition count 2603
Applied a total of 100 rules in 74 ms. Remains 157 /207 variables (removed 50) and now considering 2603/2653 (removed 50) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2603 rows 157 cols
[2023-03-18 07:37:33] [INFO ] Invariants computation overflowed in 11 ms
[2023-03-18 07:37:34] [INFO ] After 542ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 07:37:35] [INFO ] After 460ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 07:37:35] [INFO ] After 573ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 74 ms.
[2023-03-18 07:37:35] [INFO ] After 698ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
FORMULA Railroad-PT-050-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
FORMULA Railroad-PT-050-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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' '!(X(X(X(X(F((p0&&X(p1))))))))'
Support contains 5 out of 262 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 2706/2706 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 260 transition count 2706
Applied a total of 2 rules in 11 ms. Remains 260 /262 variables (removed 2) and now considering 2706/2706 (removed 0) transitions.
// Phase 1: matrix 2706 rows 260 cols
[2023-03-18 07:37:35] [INFO ] Invariants computation overflowed in 9 ms
[2023-03-18 07:37:35] [INFO ] Implicit Places using invariants in 264 ms returned []
// Phase 1: matrix 2706 rows 260 cols
[2023-03-18 07:37:35] [INFO ] Invariants computation overflowed in 4 ms
[2023-03-18 07:37:37] [INFO ] Implicit Places using invariants and state equation in 1099 ms returned []
Implicit Place search using SMT with State Equation took 1365 ms to find 0 implicit places.
// Phase 1: matrix 2706 rows 260 cols
[2023-03-18 07:37:37] [INFO ] Invariants computation overflowed in 9 ms
[2023-03-18 07:37:37] [INFO ] Dead Transitions using invariants and state equation in 778 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 260/262 places, 2706/2706 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2158 ms. Remains : 260/262 places, 2706/2706 transitions.
Stuttering acceptance computed with spot in 389 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Railroad-PT-050-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(OR (EQ s66 0) (EQ s72 0) (EQ s214 0)), p1:(OR (EQ s54 0) (EQ s75 0) (EQ s214 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 16666 reset in 1704 ms.
Product exploration explored 100000 steps with 16666 reset in 1600 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), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 96 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 262 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 261 ms. (steps per millisecond=38 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 275871 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :{}
Probabilistic random walk after 275871 steps, saw 245969 distinct states, run finished after 3001 ms. (steps per millisecond=91 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 2706 rows 260 cols
[2023-03-18 07:37:45] [INFO ] Invariants computation overflowed in 12 ms
[2023-03-18 07:37:45] [INFO ] After 554ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-18 07:37:46] [INFO ] After 542ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-18 07:37:46] [INFO ] After 769ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 150 ms.
[2023-03-18 07:37:46] [INFO ] After 994ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 21 ms.
Support contains 5 out of 260 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 260/260 places, 2706/2706 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 260 transition count 2704
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 258 transition count 2704
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 4 place count 258 transition count 2654
Deduced a syphon composed of 50 places in 2 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 104 place count 208 transition count 2654
Applied a total of 104 rules in 475 ms. Remains 208 /260 variables (removed 52) and now considering 2654/2706 (removed 52) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 476 ms. Remains : 208/260 places, 2654/2706 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 703521 steps, run timeout after 3001 ms. (steps per millisecond=234 ) properties seen :{}
Probabilistic random walk after 703521 steps, saw 613676 distinct states, run finished after 3004 ms. (steps per millisecond=234 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2654 rows 208 cols
[2023-03-18 07:37:50] [INFO ] Invariants computation overflowed in 15 ms
[2023-03-18 07:37:50] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 07:37:51] [INFO ] After 446ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 07:37:51] [INFO ] After 559ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 76 ms.
[2023-03-18 07:37:51] [INFO ] After 692ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 5 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 2654/2654 transitions.
Applied a total of 0 rules in 469 ms. Remains 208 /208 variables (removed 0) and now considering 2654/2654 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 469 ms. Remains : 208/208 places, 2654/2654 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 2654/2654 transitions.
Applied a total of 0 rules in 459 ms. Remains 208 /208 variables (removed 0) and now considering 2654/2654 (removed 0) transitions.
// Phase 1: matrix 2654 rows 208 cols
[2023-03-18 07:37:52] [INFO ] Invariants computation overflowed in 8 ms
[2023-03-18 07:37:52] [INFO ] Implicit Places using invariants in 259 ms returned []
// Phase 1: matrix 2654 rows 208 cols
[2023-03-18 07:37:52] [INFO ] Invariants computation overflowed in 10 ms
[2023-03-18 07:37:53] [INFO ] Implicit Places using invariants and state equation in 1293 ms returned []
Implicit Place search using SMT with State Equation took 1572 ms to find 0 implicit places.
[2023-03-18 07:37:53] [INFO ] Redundant transitions in 181 ms returned []
// Phase 1: matrix 2654 rows 208 cols
[2023-03-18 07:37:53] [INFO ] Invariants computation overflowed in 9 ms
[2023-03-18 07:37:54] [INFO ] Dead Transitions using invariants and state equation in 755 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2977 ms. Remains : 208/208 places, 2654/2654 transitions.
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 50 Pre rules applied. Total rules applied 0 place count 208 transition count 2604
Deduced a syphon composed of 50 places in 3 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 0 with 100 rules applied. Total rules applied 100 place count 158 transition count 2604
Applied a total of 100 rules in 56 ms. Remains 158 /208 variables (removed 50) and now considering 2604/2654 (removed 50) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2604 rows 158 cols
[2023-03-18 07:37:54] [INFO ] Invariants computation overflowed in 7 ms
[2023-03-18 07:37:54] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 07:37:55] [INFO ] After 447ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 07:37:55] [INFO ] After 560ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 78 ms.
[2023-03-18 07:37:55] [INFO ] After 677ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), true, (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 169 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 252 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 235 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Support contains 5 out of 260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 260/260 places, 2706/2706 transitions.
Applied a total of 0 rules in 10 ms. Remains 260 /260 variables (removed 0) and now considering 2706/2706 (removed 0) transitions.
// Phase 1: matrix 2706 rows 260 cols
[2023-03-18 07:37:56] [INFO ] Invariants computation overflowed in 6 ms
[2023-03-18 07:37:56] [INFO ] Implicit Places using invariants in 251 ms returned []
// Phase 1: matrix 2706 rows 260 cols
[2023-03-18 07:37:56] [INFO ] Invariants computation overflowed in 4 ms
[2023-03-18 07:37:57] [INFO ] Implicit Places using invariants and state equation in 1061 ms returned []
Implicit Place search using SMT with State Equation took 1313 ms to find 0 implicit places.
// Phase 1: matrix 2706 rows 260 cols
[2023-03-18 07:37:57] [INFO ] Invariants computation overflowed in 12 ms
[2023-03-18 07:37:58] [INFO ] Dead Transitions using invariants and state equation in 819 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2143 ms. Remains : 260/260 places, 2706/2706 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 98 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 257 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 2) 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 2) 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 2) seen :0
Interrupted probabilistic random walk after 336917 steps, run timeout after 3001 ms. (steps per millisecond=112 ) properties seen :{}
Probabilistic random walk after 336917 steps, saw 298215 distinct states, run finished after 3001 ms. (steps per millisecond=112 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2706 rows 260 cols
[2023-03-18 07:38:01] [INFO ] Invariants computation overflowed in 12 ms
[2023-03-18 07:38:02] [INFO ] After 606ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 07:38:03] [INFO ] After 530ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 07:38:03] [INFO ] After 756ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 146 ms.
[2023-03-18 07:38:03] [INFO ] After 968ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 1 properties in 19 ms.
Support contains 3 out of 260 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 260/260 places, 2706/2706 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 260 transition count 2704
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 258 transition count 2704
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 4 place count 258 transition count 2653
Deduced a syphon composed of 51 places in 3 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 106 place count 207 transition count 2653
Applied a total of 106 rules in 467 ms. Remains 207 /260 variables (removed 53) and now considering 2653/2706 (removed 53) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 470 ms. Remains : 207/260 places, 2653/2706 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 632010 steps, run timeout after 3001 ms. (steps per millisecond=210 ) properties seen :{}
Probabilistic random walk after 632010 steps, saw 552161 distinct states, run finished after 3001 ms. (steps per millisecond=210 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2653 rows 207 cols
[2023-03-18 07:38:07] [INFO ] Invariants computation overflowed in 9 ms
[2023-03-18 07:38:07] [INFO ] After 502ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 07:38:08] [INFO ] After 495ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 07:38:08] [INFO ] After 659ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 66 ms.
[2023-03-18 07:38:08] [INFO ] After 784ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 3 out of 207 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 2653/2653 transitions.
Applied a total of 0 rules in 452 ms. Remains 207 /207 variables (removed 0) and now considering 2653/2653 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 452 ms. Remains : 207/207 places, 2653/2653 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 2653/2653 transitions.
Applied a total of 0 rules in 479 ms. Remains 207 /207 variables (removed 0) and now considering 2653/2653 (removed 0) transitions.
// Phase 1: matrix 2653 rows 207 cols
[2023-03-18 07:38:09] [INFO ] Invariants computation overflowed in 10 ms
[2023-03-18 07:38:09] [INFO ] Implicit Places using invariants in 247 ms returned []
// Phase 1: matrix 2653 rows 207 cols
[2023-03-18 07:38:09] [INFO ] Invariants computation overflowed in 7 ms
[2023-03-18 07:38:10] [INFO ] Implicit Places using invariants and state equation in 951 ms returned []
Implicit Place search using SMT with State Equation took 1200 ms to find 0 implicit places.
[2023-03-18 07:38:10] [INFO ] Redundant transitions in 81 ms returned []
// Phase 1: matrix 2653 rows 207 cols
[2023-03-18 07:38:10] [INFO ] Invariants computation overflowed in 9 ms
[2023-03-18 07:38:11] [INFO ] Dead Transitions using invariants and state equation in 759 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2528 ms. Remains : 207/207 places, 2653/2653 transitions.
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 50 Pre rules applied. Total rules applied 0 place count 207 transition count 2603
Deduced a syphon composed of 50 places in 3 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 0 with 100 rules applied. Total rules applied 100 place count 157 transition count 2603
Applied a total of 100 rules in 62 ms. Remains 157 /207 variables (removed 50) and now considering 2603/2653 (removed 50) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2603 rows 157 cols
[2023-03-18 07:38:11] [INFO ] Invariants computation overflowed in 12 ms
[2023-03-18 07:38:11] [INFO ] After 446ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 07:38:12] [INFO ] After 451ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 07:38:12] [INFO ] After 559ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 64 ms.
[2023-03-18 07:38:12] [INFO ] After 672ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 259 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 246 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 234 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 16666 reset in 1490 ms.
Product exploration explored 100000 steps with 16666 reset in 1511 ms.
Applying partial POR strategy [true, false, false, false, false, false]
Stuttering acceptance computed with spot in 278 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Support contains 5 out of 260 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 260/260 places, 2706/2706 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 260 transition count 2706
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 2 place count 260 transition count 2706
Deduced a syphon composed of 4 places in 3 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 260 transition count 2706
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 6 place count 258 transition count 2704
Deduced a syphon composed of 2 places in 3 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 258 transition count 2704
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 50 places in 3 ms
Iterating global reduction 1 with 48 rules applied. Total rules applied 56 place count 258 transition count 2704
Deduced a syphon composed of 50 places in 3 ms
Applied a total of 56 rules in 714 ms. Remains 258 /260 variables (removed 2) and now considering 2704/2706 (removed 2) transitions.
[2023-03-18 07:38:17] [INFO ] Redundant transitions in 59 ms returned []
// Phase 1: matrix 2704 rows 258 cols
[2023-03-18 07:38:17] [INFO ] Invariants computation overflowed in 9 ms
[2023-03-18 07:38:18] [INFO ] Dead Transitions using invariants and state equation in 751 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 258/260 places, 2704/2706 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1542 ms. Remains : 258/260 places, 2704/2706 transitions.
Support contains 5 out of 260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 260/260 places, 2706/2706 transitions.
Applied a total of 0 rules in 11 ms. Remains 260 /260 variables (removed 0) and now considering 2706/2706 (removed 0) transitions.
// Phase 1: matrix 2706 rows 260 cols
[2023-03-18 07:38:18] [INFO ] Invariants computation overflowed in 6 ms
[2023-03-18 07:38:18] [INFO ] Implicit Places using invariants in 257 ms returned []
// Phase 1: matrix 2706 rows 260 cols
[2023-03-18 07:38:18] [INFO ] Invariants computation overflowed in 5 ms
[2023-03-18 07:38:19] [INFO ] Implicit Places using invariants and state equation in 1039 ms returned []
Implicit Place search using SMT with State Equation took 1298 ms to find 0 implicit places.
// Phase 1: matrix 2706 rows 260 cols
[2023-03-18 07:38:19] [INFO ] Invariants computation overflowed in 4 ms
[2023-03-18 07:38:20] [INFO ] Dead Transitions using invariants and state equation in 693 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2002 ms. Remains : 260/260 places, 2706/2706 transitions.
Treatment of property Railroad-PT-050-LTLFireability-00 finished in 45222 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((G(p0) U X(X((F(G(!p2))&&p1))))))'
Support contains 7 out of 262 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 2706/2706 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 260 transition count 2706
Applied a total of 2 rules in 21 ms. Remains 260 /262 variables (removed 2) and now considering 2706/2706 (removed 0) transitions.
// Phase 1: matrix 2706 rows 260 cols
[2023-03-18 07:38:20] [INFO ] Invariants computation overflowed in 5 ms
[2023-03-18 07:38:21] [INFO ] Implicit Places using invariants in 228 ms returned []
// Phase 1: matrix 2706 rows 260 cols
[2023-03-18 07:38:21] [INFO ] Invariants computation overflowed in 5 ms
[2023-03-18 07:38:22] [INFO ] Implicit Places using invariants and state equation in 984 ms returned []
Implicit Place search using SMT with State Equation took 1214 ms to find 0 implicit places.
// Phase 1: matrix 2706 rows 260 cols
[2023-03-18 07:38:22] [INFO ] Invariants computation overflowed in 4 ms
[2023-03-18 07:38:22] [INFO ] Dead Transitions using invariants and state equation in 741 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 260/262 places, 2706/2706 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1990 ms. Remains : 260/262 places, 2706/2706 transitions.
Stuttering acceptance computed with spot in 264 ms :[(OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2), true, p2, (OR (NOT p1) p2), (NOT p0)]
Running random walk in product with property : Railroad-PT-050-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 6}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=p1, acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 5}, { cond=p2, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 4}, { cond=p1, acceptance={} source=6 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 7}], [{ cond=(NOT p0), acceptance={} source=7 dest: 4}, { cond=p0, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(AND (EQ s50 1) (EQ s99 1) (EQ s214 1)), p1:(AND (EQ s46 1) (EQ s74 1) (EQ s214 1)), p2:(AND (EQ s61 1) (EQ s94 1) (EQ s214 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA Railroad-PT-050-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Railroad-PT-050-LTLFireability-01 finished in 2301 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((p0||X(F(p1))||G(p2)||G(p3))))'
Support contains 7 out of 262 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 2706/2706 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 260 transition count 2706
Applied a total of 2 rules in 14 ms. Remains 260 /262 variables (removed 2) and now considering 2706/2706 (removed 0) transitions.
// Phase 1: matrix 2706 rows 260 cols
[2023-03-18 07:38:23] [INFO ] Invariants computation overflowed in 4 ms
[2023-03-18 07:38:23] [INFO ] Implicit Places using invariants in 240 ms returned []
// Phase 1: matrix 2706 rows 260 cols
[2023-03-18 07:38:23] [INFO ] Invariants computation overflowed in 4 ms
[2023-03-18 07:38:24] [INFO ] Implicit Places using invariants and state equation in 979 ms returned []
Implicit Place search using SMT with State Equation took 1221 ms to find 0 implicit places.
// Phase 1: matrix 2706 rows 260 cols
[2023-03-18 07:38:24] [INFO ] Invariants computation overflowed in 4 ms
[2023-03-18 07:38:25] [INFO ] Dead Transitions using invariants and state equation in 745 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 260/262 places, 2706/2706 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1982 ms. Remains : 260/262 places, 2706/2706 transitions.
Stuttering acceptance computed with spot in 203 ms :[(NOT p1), (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2))]
Running random walk in product with property : Railroad-PT-050-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p3), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p2 p3), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p3 (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p2) p3 (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND p2 (NOT p3) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p2 p3 (NOT p1)), acceptance={} source=5 dest: 5}]], initial=1, aps=[p1:(OR (EQ s30 0) (EQ s105 0) (EQ s214 0)), p0:(AND (EQ s30 1) (EQ s105 1) (EQ s214 1)), p2:(AND (EQ s36 1) (EQ s73 1) (EQ s214 1)), p3:(AND (EQ s69 1) (E...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 534 ms.
Product exploration explored 100000 steps with 33333 reset in 558 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2) (NOT p3)), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) p3))), (X (AND (NOT p0) (NOT p2) (NOT p3))), (X (NOT (AND (NOT p0) p2 p3))), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (X (X (NOT (AND p2 p3 (NOT p1))))), (X (X (NOT (AND p2 (NOT p3) (NOT p1))))), (X (X (NOT (AND p3 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) p3 (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p1))
Knowledge based reduction with 14 factoid took 278 ms. Reduced automaton from 6 states, 14 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Railroad-PT-050-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Railroad-PT-050-LTLFireability-02 finished in 3589 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)&&F(G(p1))))'
Support contains 5 out of 262 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 262/262 places, 2706/2706 transitions.
Ensure Unique test removed 2 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 260 transition count 2704
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 258 transition count 2704
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 4 place count 258 transition count 2654
Deduced a syphon composed of 50 places in 3 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 104 place count 208 transition count 2654
Applied a total of 104 rules in 526 ms. Remains 208 /262 variables (removed 54) and now considering 2654/2706 (removed 52) transitions.
// Phase 1: matrix 2654 rows 208 cols
[2023-03-18 07:38:27] [INFO ] Invariants computation overflowed in 9 ms
[2023-03-18 07:38:27] [INFO ] Implicit Places using invariants in 256 ms returned []
// Phase 1: matrix 2654 rows 208 cols
[2023-03-18 07:38:27] [INFO ] Invariants computation overflowed in 4 ms
[2023-03-18 07:38:28] [INFO ] Implicit Places using invariants and state equation in 1159 ms returned []
Implicit Place search using SMT with State Equation took 1418 ms to find 0 implicit places.
[2023-03-18 07:38:28] [INFO ] Redundant transitions in 82 ms returned []
// Phase 1: matrix 2654 rows 208 cols
[2023-03-18 07:38:28] [INFO ] Invariants computation overflowed in 11 ms
[2023-03-18 07:38:29] [INFO ] Dead Transitions using invariants and state equation in 684 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 208/262 places, 2654/2706 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2718 ms. Remains : 208/262 places, 2654/2706 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Railroad-PT-050-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s28 0) (EQ s71 0) (EQ s162 0)), p1:(OR (EQ s47 0) (EQ s70 0) (EQ s162 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 1047 ms.
Product exploration explored 100000 steps with 0 reset in 1311 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 p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 212 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p1)]
Finished random walk after 4975 steps, including 1 resets, run visited all 1 properties in 57 ms. (steps per millisecond=87 )
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 179 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p1)]
Support contains 3 out of 208 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 208/208 places, 2654/2654 transitions.
Applied a total of 0 rules in 527 ms. Remains 208 /208 variables (removed 0) and now considering 2654/2654 (removed 0) transitions.
// Phase 1: matrix 2654 rows 208 cols
[2023-03-18 07:38:33] [INFO ] Invariants computation overflowed in 9 ms
[2023-03-18 07:38:33] [INFO ] Implicit Places using invariants in 256 ms returned []
// Phase 1: matrix 2654 rows 208 cols
[2023-03-18 07:38:33] [INFO ] Invariants computation overflowed in 3 ms
[2023-03-18 07:38:34] [INFO ] Implicit Places using invariants and state equation in 1206 ms returned []
Implicit Place search using SMT with State Equation took 1464 ms to find 0 implicit places.
[2023-03-18 07:38:34] [INFO ] Redundant transitions in 84 ms returned []
// Phase 1: matrix 2654 rows 208 cols
[2023-03-18 07:38:34] [INFO ] Invariants computation overflowed in 10 ms
[2023-03-18 07:38:35] [INFO ] Dead Transitions using invariants and state equation in 693 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2784 ms. Remains : 208/208 places, 2654/2654 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 : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p1)]
Finished random walk after 8171 steps, including 2 resets, run visited all 1 properties in 92 ms. (steps per millisecond=88 )
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 139 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
Product exploration explored 100000 steps with 0 reset in 1041 ms.
Product exploration explored 100000 steps with 0 reset in 1083 ms.
Support contains 3 out of 208 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 208/208 places, 2654/2654 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 208 transition count 2653
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 207 transition count 2653
Applied a total of 2 rules in 478 ms. Remains 207 /208 variables (removed 1) and now considering 2653/2654 (removed 1) transitions.
// Phase 1: matrix 2653 rows 207 cols
[2023-03-18 07:38:38] [INFO ] Invariants computation overflowed in 6 ms
[2023-03-18 07:38:38] [INFO ] Implicit Places using invariants in 249 ms returned []
// Phase 1: matrix 2653 rows 207 cols
[2023-03-18 07:38:38] [INFO ] Invariants computation overflowed in 4 ms
[2023-03-18 07:38:39] [INFO ] Implicit Places using invariants and state equation in 965 ms returned []
Implicit Place search using SMT with State Equation took 1216 ms to find 0 implicit places.
[2023-03-18 07:38:39] [INFO ] Redundant transitions in 81 ms returned []
// Phase 1: matrix 2653 rows 207 cols
[2023-03-18 07:38:39] [INFO ] Invariants computation overflowed in 14 ms
[2023-03-18 07:38:40] [INFO ] Dead Transitions using invariants and state equation in 708 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 207/208 places, 2653/2654 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2493 ms. Remains : 207/208 places, 2653/2654 transitions.
Treatment of property Railroad-PT-050-LTLFireability-04 finished in 13890 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(((G(p2)||p1)&&p0))))'
Support contains 7 out of 262 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 262/262 places, 2706/2706 transitions.
Ensure Unique test removed 2 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 260 transition count 2704
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 258 transition count 2704
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 49 Pre rules applied. Total rules applied 4 place count 258 transition count 2655
Deduced a syphon composed of 49 places in 3 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 102 place count 209 transition count 2655
Applied a total of 102 rules in 545 ms. Remains 209 /262 variables (removed 53) and now considering 2655/2706 (removed 51) transitions.
// Phase 1: matrix 2655 rows 209 cols
[2023-03-18 07:38:41] [INFO ] Invariants computation overflowed in 8 ms
[2023-03-18 07:38:41] [INFO ] Implicit Places using invariants in 236 ms returned []
// Phase 1: matrix 2655 rows 209 cols
[2023-03-18 07:38:41] [INFO ] Invariants computation overflowed in 10 ms
[2023-03-18 07:38:42] [INFO ] Implicit Places using invariants and state equation in 1041 ms returned []
Implicit Place search using SMT with State Equation took 1278 ms to find 0 implicit places.
[2023-03-18 07:38:42] [INFO ] Redundant transitions in 83 ms returned []
// Phase 1: matrix 2655 rows 209 cols
[2023-03-18 07:38:42] [INFO ] Invariants computation overflowed in 9 ms
[2023-03-18 07:38:43] [INFO ] Dead Transitions using invariants and state equation in 688 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 209/262 places, 2655/2706 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2608 ms. Remains : 209/262 places, 2655/2706 transitions.
Stuttering acceptance computed with spot in 77 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : Railroad-PT-050-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p1)) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND p2 p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s59 0) (EQ s72 0) (EQ s163 0)), p0:(AND (EQ s62 1) (EQ s71 1) (EQ s163 1)), p2:(AND (EQ s47 1) (EQ s70 1) (EQ s163 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 1061 ms.
Stack based approach found an accepted trace after 8096 steps with 0 reset with depth 8097 and stack size 8097 in 89 ms.
FORMULA Railroad-PT-050-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-050-LTLFireability-06 finished in 3862 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 4 out of 262 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 262/262 places, 2706/2706 transitions.
Ensure Unique test removed 2 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 260 transition count 2704
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 258 transition count 2704
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 4 place count 258 transition count 2653
Deduced a syphon composed of 51 places in 3 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 106 place count 207 transition count 2653
Applied a total of 106 rules in 510 ms. Remains 207 /262 variables (removed 55) and now considering 2653/2706 (removed 53) transitions.
// Phase 1: matrix 2653 rows 207 cols
[2023-03-18 07:38:44] [INFO ] Invariants computation overflowed in 8 ms
[2023-03-18 07:38:45] [INFO ] Implicit Places using invariants in 239 ms returned []
// Phase 1: matrix 2653 rows 207 cols
[2023-03-18 07:38:45] [INFO ] Invariants computation overflowed in 11 ms
[2023-03-18 07:38:46] [INFO ] Implicit Places using invariants and state equation in 1010 ms returned []
Implicit Place search using SMT with State Equation took 1251 ms to find 0 implicit places.
[2023-03-18 07:38:46] [INFO ] Redundant transitions in 82 ms returned []
// Phase 1: matrix 2653 rows 207 cols
[2023-03-18 07:38:46] [INFO ] Invariants computation overflowed in 8 ms
[2023-03-18 07:38:47] [INFO ] Dead Transitions using invariants and state equation in 692 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 207/262 places, 2653/2706 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2544 ms. Remains : 207/262 places, 2653/2706 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Railroad-PT-050-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (EQ s45 1) (EQ s70 1) (EQ s161 1) (EQ s36 1)) (AND (EQ s36 1) (EQ s70 1) (EQ s161 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 121 reset in 1053 ms.
Stack based approach found an accepted trace after 2278 steps with 3 reset with depth 771 and stack size 771 in 24 ms.
FORMULA Railroad-PT-050-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-050-LTLFireability-07 finished in 3707 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) U p1)))'
Support contains 5 out of 262 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 2706/2706 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 260 transition count 2706
Applied a total of 2 rules in 14 ms. Remains 260 /262 variables (removed 2) and now considering 2706/2706 (removed 0) transitions.
// Phase 1: matrix 2706 rows 260 cols
[2023-03-18 07:38:48] [INFO ] Invariants computation overflowed in 10 ms
[2023-03-18 07:38:48] [INFO ] Implicit Places using invariants in 251 ms returned []
// Phase 1: matrix 2706 rows 260 cols
[2023-03-18 07:38:48] [INFO ] Invariants computation overflowed in 4 ms
[2023-03-18 07:38:49] [INFO ] Implicit Places using invariants and state equation in 989 ms returned []
Implicit Place search using SMT with State Equation took 1242 ms to find 0 implicit places.
// Phase 1: matrix 2706 rows 260 cols
[2023-03-18 07:38:49] [INFO ] Invariants computation overflowed in 4 ms
[2023-03-18 07:38:50] [INFO ] Dead Transitions using invariants and state equation in 772 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 260/262 places, 2706/2706 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2029 ms. Remains : 260/262 places, 2706/2706 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p1), (NOT p1), true, p0]
Running random walk in product with property : Railroad-PT-050-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s60 1) (EQ s99 1) (EQ s214 1)), p0:(AND (EQ s38 1) (EQ s79 1) (EQ s214 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 215 steps with 0 reset in 5 ms.
FORMULA Railroad-PT-050-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Railroad-PT-050-LTLFireability-08 finished in 2187 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)||F(G((p1&&(p1 U (!p2||G(p1))))))))'
Support contains 5 out of 262 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 262/262 places, 2706/2706 transitions.
Ensure Unique test removed 2 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 260 transition count 2704
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 258 transition count 2704
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 49 Pre rules applied. Total rules applied 4 place count 258 transition count 2655
Deduced a syphon composed of 49 places in 3 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 102 place count 209 transition count 2655
Applied a total of 102 rules in 527 ms. Remains 209 /262 variables (removed 53) and now considering 2655/2706 (removed 51) transitions.
// Phase 1: matrix 2655 rows 209 cols
[2023-03-18 07:38:50] [INFO ] Invariants computation overflowed in 12 ms
[2023-03-18 07:38:51] [INFO ] Implicit Places using invariants in 243 ms returned []
// Phase 1: matrix 2655 rows 209 cols
[2023-03-18 07:38:51] [INFO ] Invariants computation overflowed in 3 ms
[2023-03-18 07:38:52] [INFO ] Implicit Places using invariants and state equation in 1008 ms returned []
Implicit Place search using SMT with State Equation took 1252 ms to find 0 implicit places.
[2023-03-18 07:38:52] [INFO ] Redundant transitions in 83 ms returned []
// Phase 1: matrix 2655 rows 209 cols
[2023-03-18 07:38:52] [INFO ] Invariants computation overflowed in 8 ms
[2023-03-18 07:38:52] [INFO ] Dead Transitions using invariants and state equation in 685 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 209/262 places, 2655/2706 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2556 ms. Remains : 209/262 places, 2655/2706 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Railroad-PT-050-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s59 1) (EQ s72 1) (EQ s163 1)), p1:(OR (NEQ s25 1) (NEQ s70 1) (NEQ s163 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 1029 ms.
Product exploration explored 100000 steps with 0 reset in 1091 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 184 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 680405 steps, run timeout after 3001 ms. (steps per millisecond=226 ) properties seen :{}
Probabilistic random walk after 680405 steps, saw 593123 distinct states, run finished after 3001 ms. (steps per millisecond=226 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2655 rows 209 cols
[2023-03-18 07:38:58] [INFO ] Invariants computation overflowed in 11 ms
[2023-03-18 07:38:58] [INFO ] After 485ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 07:38:59] [INFO ] After 443ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 07:38:59] [INFO ] After 551ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 67 ms.
[2023-03-18 07:38:59] [INFO ] After 672ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 248 steps, including 5 resets, run visited all 1 properties in 5 ms. (steps per millisecond=49 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 195 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p1)]
Support contains 3 out of 209 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 209/209 places, 2655/2655 transitions.
Applied a total of 0 rules in 482 ms. Remains 209 /209 variables (removed 0) and now considering 2655/2655 (removed 0) transitions.
// Phase 1: matrix 2655 rows 209 cols
[2023-03-18 07:39:00] [INFO ] Invariants computation overflowed in 10 ms
[2023-03-18 07:39:00] [INFO ] Implicit Places using invariants in 237 ms returned []
// Phase 1: matrix 2655 rows 209 cols
[2023-03-18 07:39:00] [INFO ] Invariants computation overflowed in 4 ms
[2023-03-18 07:39:01] [INFO ] Implicit Places using invariants and state equation in 994 ms returned []
Implicit Place search using SMT with State Equation took 1231 ms to find 0 implicit places.
[2023-03-18 07:39:01] [INFO ] Redundant transitions in 80 ms returned []
// Phase 1: matrix 2655 rows 209 cols
[2023-03-18 07:39:01] [INFO ] Invariants computation overflowed in 11 ms
[2023-03-18 07:39:02] [INFO ] Dead Transitions using invariants and state equation in 693 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2495 ms. Remains : 209/209 places, 2655/2655 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 : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 672355 steps, run timeout after 3001 ms. (steps per millisecond=224 ) properties seen :{}
Probabilistic random walk after 672355 steps, saw 586239 distinct states, run finished after 3001 ms. (steps per millisecond=224 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2655 rows 209 cols
[2023-03-18 07:39:05] [INFO ] Invariants computation overflowed in 11 ms
[2023-03-18 07:39:06] [INFO ] After 489ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 07:39:06] [INFO ] After 443ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 07:39:06] [INFO ] After 549ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 71 ms.
[2023-03-18 07:39:06] [INFO ] After 673ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 3 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 2655/2655 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 209 transition count 2653
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 207 transition count 2653
Applied a total of 4 rules in 448 ms. Remains 207 /209 variables (removed 2) and now considering 2653/2655 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 450 ms. Remains : 207/209 places, 2653/2655 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 671693 steps, run timeout after 3001 ms. (steps per millisecond=223 ) properties seen :{}
Probabilistic random walk after 671693 steps, saw 586183 distinct states, run finished after 3001 ms. (steps per millisecond=223 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2653 rows 207 cols
[2023-03-18 07:39:10] [INFO ] Invariants computation overflowed in 5 ms
[2023-03-18 07:39:11] [INFO ] After 538ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 07:39:11] [INFO ] After 462ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 07:39:11] [INFO ] After 564ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 67 ms.
[2023-03-18 07:39:11] [INFO ] After 689ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 80 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=40 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 127 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p1)]
Product exploration explored 100000 steps with 0 reset in 1124 ms.
Product exploration explored 100000 steps with 0 reset in 1112 ms.
Support contains 3 out of 209 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 209/209 places, 2655/2655 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 209 transition count 2653
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 207 transition count 2653
Applied a total of 4 rules in 479 ms. Remains 207 /209 variables (removed 2) and now considering 2653/2655 (removed 2) transitions.
// Phase 1: matrix 2653 rows 207 cols
[2023-03-18 07:39:14] [INFO ] Invariants computation overflowed in 9 ms
[2023-03-18 07:39:14] [INFO ] Implicit Places using invariants in 251 ms returned []
// Phase 1: matrix 2653 rows 207 cols
[2023-03-18 07:39:14] [INFO ] Invariants computation overflowed in 7 ms
[2023-03-18 07:39:15] [INFO ] Implicit Places using invariants and state equation in 1009 ms returned []
Implicit Place search using SMT with State Equation took 1262 ms to find 0 implicit places.
[2023-03-18 07:39:16] [INFO ] Redundant transitions in 82 ms returned []
// Phase 1: matrix 2653 rows 207 cols
[2023-03-18 07:39:16] [INFO ] Invariants computation overflowed in 11 ms
[2023-03-18 07:39:16] [INFO ] Dead Transitions using invariants and state equation in 705 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 207/209 places, 2653/2655 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2537 ms. Remains : 207/209 places, 2653/2655 transitions.
Treatment of property Railroad-PT-050-LTLFireability-10 finished in 26504 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)&&F(G(p1)))))'
Support contains 5 out of 262 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 262/262 places, 2706/2706 transitions.
Ensure Unique test removed 2 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 260 transition count 2704
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 258 transition count 2704
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 4 place count 258 transition count 2653
Deduced a syphon composed of 51 places in 3 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 106 place count 207 transition count 2653
Applied a total of 106 rules in 516 ms. Remains 207 /262 variables (removed 55) and now considering 2653/2706 (removed 53) transitions.
// Phase 1: matrix 2653 rows 207 cols
[2023-03-18 07:39:17] [INFO ] Invariants computation overflowed in 8 ms
[2023-03-18 07:39:17] [INFO ] Implicit Places using invariants in 268 ms returned []
// Phase 1: matrix 2653 rows 207 cols
[2023-03-18 07:39:17] [INFO ] Invariants computation overflowed in 4 ms
[2023-03-18 07:39:18] [INFO ] Implicit Places using invariants and state equation in 1098 ms returned []
Implicit Place search using SMT with State Equation took 1369 ms to find 0 implicit places.
[2023-03-18 07:39:18] [INFO ] Redundant transitions in 85 ms returned []
// Phase 1: matrix 2653 rows 207 cols
[2023-03-18 07:39:18] [INFO ] Invariants computation overflowed in 10 ms
[2023-03-18 07:39:19] [INFO ] Dead Transitions using invariants and state equation in 684 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 207/262 places, 2653/2706 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2669 ms. Remains : 207/262 places, 2653/2706 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Railroad-PT-050-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s42 0) (EQ s161 0) (EQ s188 0)), p1:(AND (EQ s51 1) (EQ s70 1) (EQ s161 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 0 reset in 1042 ms.
Stack based approach found an accepted trace after 597 steps with 0 reset with depth 598 and stack size 598 in 7 ms.
FORMULA Railroad-PT-050-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-050-LTLFireability-14 finished in 3869 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((p0||(p1 U p2))) U ((!p3&&X((p0||(p1 U p2))))||X(G((p0||(p1 U p2)))))))'
Support contains 8 out of 262 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 2706/2706 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 261 transition count 2706
Applied a total of 1 rules in 15 ms. Remains 261 /262 variables (removed 1) and now considering 2706/2706 (removed 0) transitions.
// Phase 1: matrix 2706 rows 261 cols
[2023-03-18 07:39:20] [INFO ] Invariants computation overflowed in 8 ms
[2023-03-18 07:39:21] [INFO ] Implicit Places using invariants in 255 ms returned []
// Phase 1: matrix 2706 rows 261 cols
[2023-03-18 07:39:21] [INFO ] Invariants computation overflowed in 4 ms
[2023-03-18 07:39:21] [INFO ] Implicit Places using invariants and state equation in 932 ms returned []
Implicit Place search using SMT with State Equation took 1188 ms to find 0 implicit places.
// Phase 1: matrix 2706 rows 261 cols
[2023-03-18 07:39:21] [INFO ] Invariants computation overflowed in 5 ms
[2023-03-18 07:39:22] [INFO ] Dead Transitions using invariants and state equation in 815 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 261/262 places, 2706/2706 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2019 ms. Remains : 261/262 places, 2706/2706 transitions.
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true, (NOT p2), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Railroad-PT-050-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 0}, { cond=(OR (AND p3 p0) (AND p3 p2) (AND p3 p1)), acceptance={} source=1 dest: 1}, { cond=(AND p3 (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p3 (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=(AND p3 p0 (NOT p2) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p3 (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(AND p3 p0 (NOT p2) p1), acceptance={} source=4 dest: 4}, { cond=(AND p3 (NOT p0) (NOT p2) p1), acceptance={0} source=4 dest: 4}]], initial=1, aps=[p0:(AND (EQ s24 1) (EQ s99 1) (EQ s215 1)), p2:(AND (EQ s57 1) (EQ s104 1) (EQ s215 1)), p1:(AND (EQ s133 1) (EQ s239 1)), p3:(AND (EQ s24 1) (EQ s79 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Railroad-PT-050-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Railroad-PT-050-LTLFireability-15 finished in 2232 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(X(X(F((p0&&X(p1))))))))'
Found a Shortening insensitive property : Railroad-PT-050-LTLFireability-00
Stuttering acceptance computed with spot in 223 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Support contains 5 out of 262 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 262/262 places, 2706/2706 transitions.
Ensure Unique test removed 2 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 260 transition count 2704
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 258 transition count 2704
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 4 place count 258 transition count 2654
Deduced a syphon composed of 50 places in 2 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 104 place count 208 transition count 2654
Applied a total of 104 rules in 60 ms. Remains 208 /262 variables (removed 54) and now considering 2654/2706 (removed 52) transitions.
// Phase 1: matrix 2654 rows 208 cols
[2023-03-18 07:39:23] [INFO ] Invariants computation overflowed in 11 ms
[2023-03-18 07:39:23] [INFO ] Implicit Places using invariants in 242 ms returned []
// Phase 1: matrix 2654 rows 208 cols
[2023-03-18 07:39:23] [INFO ] Invariants computation overflowed in 4 ms
[2023-03-18 07:39:24] [INFO ] Implicit Places using invariants and state equation in 1247 ms returned []
Implicit Place search using SMT with State Equation took 1490 ms to find 0 implicit places.
// Phase 1: matrix 2654 rows 208 cols
[2023-03-18 07:39:24] [INFO ] Invariants computation overflowed in 10 ms
[2023-03-18 07:39:25] [INFO ] Dead Transitions using invariants and state equation in 678 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 208/262 places, 2654/2706 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2234 ms. Remains : 208/262 places, 2654/2706 transitions.
Running random walk in product with property : Railroad-PT-050-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(OR (EQ s64 0) (EQ s70 0) (EQ s162 0)), p1:(OR (EQ s52 0) (EQ s71 0) (EQ s162 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 16666 reset in 1956 ms.
Product exploration explored 100000 steps with 16666 reset in 1971 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), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 105 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 307 ms. (steps per millisecond=32 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) 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 3) 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 3) seen :0
Interrupted probabilistic random walk after 228885 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :{}
Probabilistic random walk after 228885 steps, saw 201921 distinct states, run finished after 3001 ms. (steps per millisecond=76 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 2654 rows 208 cols
[2023-03-18 07:39:33] [INFO ] Invariants computation overflowed in 4 ms
[2023-03-18 07:39:33] [INFO ] After 519ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-18 07:39:34] [INFO ] After 508ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-18 07:39:34] [INFO ] After 729ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 145 ms.
[2023-03-18 07:39:34] [INFO ] After 931ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 18 ms.
Support contains 5 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 2654/2654 transitions.
Applied a total of 0 rules in 445 ms. Remains 208 /208 variables (removed 0) and now considering 2654/2654 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 445 ms. Remains : 208/208 places, 2654/2654 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 670279 steps, run timeout after 3001 ms. (steps per millisecond=223 ) properties seen :{}
Probabilistic random walk after 670279 steps, saw 584938 distinct states, run finished after 3001 ms. (steps per millisecond=223 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2654 rows 208 cols
[2023-03-18 07:39:38] [INFO ] Invariants computation overflowed in 11 ms
[2023-03-18 07:39:38] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 07:39:38] [INFO ] After 469ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 07:39:38] [INFO ] After 581ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 79 ms.
[2023-03-18 07:39:39] [INFO ] After 718ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 5 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 2654/2654 transitions.
Applied a total of 0 rules in 436 ms. Remains 208 /208 variables (removed 0) and now considering 2654/2654 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 437 ms. Remains : 208/208 places, 2654/2654 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 2654/2654 transitions.
Applied a total of 0 rules in 430 ms. Remains 208 /208 variables (removed 0) and now considering 2654/2654 (removed 0) transitions.
// Phase 1: matrix 2654 rows 208 cols
[2023-03-18 07:39:39] [INFO ] Invariants computation overflowed in 4 ms
[2023-03-18 07:39:40] [INFO ] Implicit Places using invariants in 239 ms returned []
// Phase 1: matrix 2654 rows 208 cols
[2023-03-18 07:39:40] [INFO ] Invariants computation overflowed in 7 ms
[2023-03-18 07:39:41] [INFO ] Implicit Places using invariants and state equation in 1249 ms returned []
Implicit Place search using SMT with State Equation took 1490 ms to find 0 implicit places.
[2023-03-18 07:39:41] [INFO ] Redundant transitions in 81 ms returned []
// Phase 1: matrix 2654 rows 208 cols
[2023-03-18 07:39:41] [INFO ] Invariants computation overflowed in 11 ms
[2023-03-18 07:39:42] [INFO ] Dead Transitions using invariants and state equation in 681 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2692 ms. Remains : 208/208 places, 2654/2654 transitions.
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 50 Pre rules applied. Total rules applied 0 place count 208 transition count 2604
Deduced a syphon composed of 50 places in 3 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 0 with 100 rules applied. Total rules applied 100 place count 158 transition count 2604
Applied a total of 100 rules in 58 ms. Remains 158 /208 variables (removed 50) and now considering 2604/2654 (removed 50) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2604 rows 158 cols
[2023-03-18 07:39:42] [INFO ] Invariants computation overflowed in 10 ms
[2023-03-18 07:39:42] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 07:39:42] [INFO ] After 413ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 07:39:42] [INFO ] After 522ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 73 ms.
[2023-03-18 07:39:42] [INFO ] After 636ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), true, (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 180 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 252 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 222 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Support contains 5 out of 208 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 2654/2654 transitions.
Applied a total of 0 rules in 14 ms. Remains 208 /208 variables (removed 0) and now considering 2654/2654 (removed 0) transitions.
// Phase 1: matrix 2654 rows 208 cols
[2023-03-18 07:39:43] [INFO ] Invariants computation overflowed in 7 ms
[2023-03-18 07:39:43] [INFO ] Implicit Places using invariants in 266 ms returned []
// Phase 1: matrix 2654 rows 208 cols
[2023-03-18 07:39:43] [INFO ] Invariants computation overflowed in 7 ms
[2023-03-18 07:39:45] [INFO ] Implicit Places using invariants and state equation in 1242 ms returned []
Implicit Place search using SMT with State Equation took 1512 ms to find 0 implicit places.
// Phase 1: matrix 2654 rows 208 cols
[2023-03-18 07:39:45] [INFO ] Invariants computation overflowed in 4 ms
[2023-03-18 07:39:45] [INFO ] Dead Transitions using invariants and state equation in 668 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2195 ms. Remains : 208/208 places, 2654/2654 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=63 ) 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
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
Interrupted probabilistic random walk after 342944 steps, run timeout after 3001 ms. (steps per millisecond=114 ) properties seen :{}
Probabilistic random walk after 342944 steps, saw 300928 distinct states, run finished after 3001 ms. (steps per millisecond=114 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2654 rows 208 cols
[2023-03-18 07:39:49] [INFO ] Invariants computation overflowed in 3 ms
[2023-03-18 07:39:49] [INFO ] After 552ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 07:39:50] [INFO ] After 515ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 07:39:50] [INFO ] After 730ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 137 ms.
[2023-03-18 07:39:50] [INFO ] After 921ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 1 properties in 19 ms.
Support contains 3 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 2654/2654 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 208 transition count 2653
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 207 transition count 2653
Applied a total of 2 rules in 443 ms. Remains 207 /208 variables (removed 1) and now considering 2653/2654 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 443 ms. Remains : 207/208 places, 2653/2654 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 684050 steps, run timeout after 3001 ms. (steps per millisecond=227 ) properties seen :{}
Probabilistic random walk after 684050 steps, saw 596791 distinct states, run finished after 3001 ms. (steps per millisecond=227 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2653 rows 207 cols
[2023-03-18 07:39:54] [INFO ] Invariants computation overflowed in 11 ms
[2023-03-18 07:39:54] [INFO ] After 484ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 07:39:55] [INFO ] After 439ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 07:39:55] [INFO ] After 540ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 69 ms.
[2023-03-18 07:39:55] [INFO ] After 665ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 3 out of 207 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 2653/2653 transitions.
Applied a total of 0 rules in 442 ms. Remains 207 /207 variables (removed 0) and now considering 2653/2653 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 442 ms. Remains : 207/207 places, 2653/2653 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 2653/2653 transitions.
Applied a total of 0 rules in 433 ms. Remains 207 /207 variables (removed 0) and now considering 2653/2653 (removed 0) transitions.
// Phase 1: matrix 2653 rows 207 cols
[2023-03-18 07:39:56] [INFO ] Invariants computation overflowed in 11 ms
[2023-03-18 07:39:56] [INFO ] Implicit Places using invariants in 246 ms returned []
// Phase 1: matrix 2653 rows 207 cols
[2023-03-18 07:39:56] [INFO ] Invariants computation overflowed in 5 ms
[2023-03-18 07:39:57] [INFO ] Implicit Places using invariants and state equation in 1047 ms returned []
Implicit Place search using SMT with State Equation took 1300 ms to find 0 implicit places.
[2023-03-18 07:39:57] [INFO ] Redundant transitions in 77 ms returned []
// Phase 1: matrix 2653 rows 207 cols
[2023-03-18 07:39:57] [INFO ] Invariants computation overflowed in 8 ms
[2023-03-18 07:39:58] [INFO ] Dead Transitions using invariants and state equation in 679 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2499 ms. Remains : 207/207 places, 2653/2653 transitions.
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 50 Pre rules applied. Total rules applied 0 place count 207 transition count 2603
Deduced a syphon composed of 50 places in 2 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 0 with 100 rules applied. Total rules applied 100 place count 157 transition count 2603
Applied a total of 100 rules in 53 ms. Remains 157 /207 variables (removed 50) and now considering 2603/2653 (removed 50) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2603 rows 157 cols
[2023-03-18 07:39:58] [INFO ] Invariants computation overflowed in 12 ms
[2023-03-18 07:39:59] [INFO ] After 445ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 07:39:59] [INFO ] After 406ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 07:39:59] [INFO ] After 506ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 64 ms.
[2023-03-18 07:39:59] [INFO ] After 613ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 117 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 215 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 201 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 16666 reset in 1948 ms.
Product exploration explored 100000 steps with 16666 reset in 1970 ms.
Applying partial POR strategy [true, false, false, false, false, false]
Stuttering acceptance computed with spot in 204 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Support contains 5 out of 208 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 208/208 places, 2654/2654 transitions.
Applied a total of 0 rules in 474 ms. Remains 208 /208 variables (removed 0) and now considering 2654/2654 (removed 0) transitions.
[2023-03-18 07:40:05] [INFO ] Redundant transitions in 78 ms returned []
// Phase 1: matrix 2654 rows 208 cols
[2023-03-18 07:40:05] [INFO ] Invariants computation overflowed in 4 ms
[2023-03-18 07:40:05] [INFO ] Dead Transitions using invariants and state equation in 669 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1237 ms. Remains : 208/208 places, 2654/2654 transitions.
Support contains 5 out of 208 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 2654/2654 transitions.
Applied a total of 0 rules in 9 ms. Remains 208 /208 variables (removed 0) and now considering 2654/2654 (removed 0) transitions.
// Phase 1: matrix 2654 rows 208 cols
[2023-03-18 07:40:05] [INFO ] Invariants computation overflowed in 5 ms
[2023-03-18 07:40:06] [INFO ] Implicit Places using invariants in 240 ms returned []
// Phase 1: matrix 2654 rows 208 cols
[2023-03-18 07:40:06] [INFO ] Invariants computation overflowed in 4 ms
[2023-03-18 07:40:07] [INFO ] Implicit Places using invariants and state equation in 1234 ms returned []
Implicit Place search using SMT with State Equation took 1477 ms to find 0 implicit places.
// Phase 1: matrix 2654 rows 208 cols
[2023-03-18 07:40:07] [INFO ] Invariants computation overflowed in 4 ms
[2023-03-18 07:40:07] [INFO ] Dead Transitions using invariants and state equation in 671 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2159 ms. Remains : 208/208 places, 2654/2654 transitions.
Treatment of property Railroad-PT-050-LTLFireability-00 finished in 45139 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)&&F(G(p1))))'
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)||F(G((p1&&(p1 U (!p2||G(p1))))))))'
[2023-03-18 07:40:08] [INFO ] Flatten gal took : 109 ms
[2023-03-18 07:40:08] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-18 07:40:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 262 places, 2706 transitions and 15816 arcs took 18 ms.
Total runtime 176138 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1808/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1808/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1808/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : Railroad-PT-050-LTLFireability-00
Could not compute solution for formula : Railroad-PT-050-LTLFireability-04
Could not compute solution for formula : Railroad-PT-050-LTLFireability-10

BK_STOP 1679125211125

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name Railroad-PT-050-LTLFireability-00
ltl formula formula --ltl=/tmp/1808/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 262 places, 2706 transitions and 15816 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.380 real 0.100 user 0.070 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1808/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1808/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1808/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1808/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
ltl formula name Railroad-PT-050-LTLFireability-04
ltl formula formula --ltl=/tmp/1808/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 262 places, 2706 transitions and 15816 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.380 real 0.090 user 0.090 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1808/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1808/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1808/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1808/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
ltl formula name Railroad-PT-050-LTLFireability-10
ltl formula formula --ltl=/tmp/1808/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 262 places, 2706 transitions and 15816 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.280 real 0.080 user 0.100 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1808/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1808/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1808/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1808/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size

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-050"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is Railroad-PT-050, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r329-tall-167889202000388"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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