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-167889202000380.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-020, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r329-tall-167889202000380
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 756K
-rw-r--r-- 1 mcc users 8.7K Feb 25 22:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 25 22:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 22:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 22:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 22:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 25 22:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 25 22:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 110K Feb 25 22:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 255K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Railroad-PT-020-LTLFireability-00
FORMULA_NAME Railroad-PT-020-LTLFireability-01
FORMULA_NAME Railroad-PT-020-LTLFireability-02
FORMULA_NAME Railroad-PT-020-LTLFireability-03
FORMULA_NAME Railroad-PT-020-LTLFireability-04
FORMULA_NAME Railroad-PT-020-LTLFireability-05
FORMULA_NAME Railroad-PT-020-LTLFireability-06
FORMULA_NAME Railroad-PT-020-LTLFireability-07
FORMULA_NAME Railroad-PT-020-LTLFireability-08
FORMULA_NAME Railroad-PT-020-LTLFireability-09
FORMULA_NAME Railroad-PT-020-LTLFireability-10
FORMULA_NAME Railroad-PT-020-LTLFireability-11
FORMULA_NAME Railroad-PT-020-LTLFireability-12
FORMULA_NAME Railroad-PT-020-LTLFireability-13
FORMULA_NAME Railroad-PT-020-LTLFireability-14
FORMULA_NAME Railroad-PT-020-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679122474003

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-020
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-18 06:54:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 06:54:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 06:54:35] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2023-03-18 06:54:35] [INFO ] Transformed 218 places.
[2023-03-18 06:54:35] [INFO ] Transformed 506 transitions.
[2023-03-18 06:54:35] [INFO ] Found NUPN structural information;
[2023-03-18 06:54:35] [INFO ] Parsed PT model containing 218 places and 506 transitions and 2968 arcs in 139 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 61 places in 3 ms
Reduce places removed 61 places and 20 transitions.
FORMULA Railroad-PT-020-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 486/486 transitions.
Ensure Unique test removed 19 places
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 138 transition count 486
Applied a total of 19 rules in 22 ms. Remains 138 /157 variables (removed 19) and now considering 486/486 (removed 0) transitions.
// Phase 1: matrix 486 rows 138 cols
[2023-03-18 06:54:36] [INFO ] Invariants computation overflowed in 16 ms
[2023-03-18 06:54:36] [INFO ] Implicit Places using invariants in 224 ms returned []
// Phase 1: matrix 486 rows 138 cols
[2023-03-18 06:54:36] [INFO ] Invariants computation overflowed in 7 ms
[2023-03-18 06:54:36] [INFO ] Implicit Places using invariants and state equation in 325 ms returned [0, 1, 6, 9, 11, 15, 17, 39, 60, 62, 63, 66, 74, 75, 79, 82, 108, 113, 117, 123, 127, 131, 136]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 575 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 115/157 places, 486/486 transitions.
Applied a total of 0 rules in 4 ms. Remains 115 /115 variables (removed 0) and now considering 486/486 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 602 ms. Remains : 115/157 places, 486/486 transitions.
Support contains 42 out of 115 places after structural reductions.
[2023-03-18 06:54:36] [INFO ] Flatten gal took : 74 ms
[2023-03-18 06:54:36] [INFO ] Flatten gal took : 41 ms
[2023-03-18 06:54:36] [INFO ] Input system was already deterministic with 486 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 474 ms. (steps per millisecond=21 ) properties (out of 32) seen :22
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) 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 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 486 rows 115 cols
[2023-03-18 06:54:37] [INFO ] Invariants computation overflowed in 3 ms
[2023-03-18 06:54:38] [INFO ] After 286ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:5
[2023-03-18 06:54:38] [INFO ] After 190ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2023-03-18 06:54:38] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 7 ms to minimize.
[2023-03-18 06:54:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2023-03-18 06:54:38] [INFO ] After 399ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 93 ms.
[2023-03-18 06:54:38] [INFO ] After 566ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 4 properties in 17 ms.
Support contains 3 out of 115 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 486/486 transitions.
Ensure Unique test removed 3 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 112 transition count 484
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 110 transition count 484
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 7 place count 110 transition count 464
Deduced a syphon composed of 20 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 41 rules applied. Total rules applied 48 place count 89 transition count 464
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 50 place count 88 transition count 463
Applied a total of 50 rules in 80 ms. Remains 88 /115 variables (removed 27) and now considering 463/486 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 88/115 places, 463/486 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1303175 steps, run timeout after 3001 ms. (steps per millisecond=434 ) properties seen :{}
Probabilistic random walk after 1303175 steps, saw 833431 distinct states, run finished after 3002 ms. (steps per millisecond=434 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 463 rows 88 cols
[2023-03-18 06:54:41] [INFO ] Invariants computation overflowed in 12 ms
[2023-03-18 06:54:41] [INFO ] After 153ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 06:54:42] [INFO ] After 91ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 06:54:42] [INFO ] After 130ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-18 06:54:42] [INFO ] After 207ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 463/463 transitions.
Applied a total of 0 rules in 30 ms. Remains 88 /88 variables (removed 0) and now considering 463/463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 88/88 places, 463/463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 463/463 transitions.
Applied a total of 0 rules in 26 ms. Remains 88 /88 variables (removed 0) and now considering 463/463 (removed 0) transitions.
// Phase 1: matrix 463 rows 88 cols
[2023-03-18 06:54:42] [INFO ] Invariants computation overflowed in 4 ms
[2023-03-18 06:54:42] [INFO ] Implicit Places using invariants in 89 ms returned []
// Phase 1: matrix 463 rows 88 cols
[2023-03-18 06:54:42] [INFO ] Invariants computation overflowed in 3 ms
[2023-03-18 06:54:42] [INFO ] Implicit Places using invariants and state equation in 342 ms returned [85]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 434 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 87/88 places, 463/463 transitions.
Applied a total of 0 rules in 22 ms. Remains 87 /87 variables (removed 0) and now considering 463/463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 482 ms. Remains : 87/88 places, 463/463 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Finished Best-First random walk after 7027 steps, including 2 resets, run visited all 1 properties in 8 ms. (steps per millisecond=878 )
FORMULA Railroad-PT-020-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 6 out of 115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 486/486 transitions.
Ensure Unique test removed 3 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 112 transition count 484
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 110 transition count 484
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 4 place count 110 transition count 464
Deduced a syphon composed of 20 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 41 rules applied. Total rules applied 45 place count 89 transition count 464
Applied a total of 45 rules in 95 ms. Remains 89 /115 variables (removed 26) and now considering 464/486 (removed 22) transitions.
// Phase 1: matrix 464 rows 89 cols
[2023-03-18 06:54:43] [INFO ] Computed 25 place invariants in 15 ms
[2023-03-18 06:54:43] [INFO ] Implicit Places using invariants in 142 ms returned []
[2023-03-18 06:54:43] [INFO ] Invariant cache hit.
[2023-03-18 06:54:43] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 424 ms to find 0 implicit places.
[2023-03-18 06:54:43] [INFO ] Redundant transitions in 29 ms returned []
[2023-03-18 06:54:43] [INFO ] Invariant cache hit.
[2023-03-18 06:54:43] [INFO ] Dead Transitions using invariants and state equation in 211 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 89/115 places, 464/486 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 768 ms. Remains : 89/115 places, 464/486 transitions.
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Railroad-PT-020-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s28 1) (EQ s32 1) (EQ s36 1)), p1:(AND (EQ s1 1) (EQ s52 1) (EQ s86 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 114 reset in 518 ms.
Stack based approach found an accepted trace after 871 steps with 1 reset with depth 132 and stack size 132 in 5 ms.
FORMULA Railroad-PT-020-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-020-LTLFireability-00 finished in 1570 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||X((!p1||G(p2))))) U X(p0)))'
Support contains 7 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 486/486 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 112 transition count 486
Applied a total of 3 rules in 5 ms. Remains 112 /115 variables (removed 3) and now considering 486/486 (removed 0) transitions.
// Phase 1: matrix 486 rows 112 cols
[2023-03-18 06:54:44] [INFO ] Invariants computation overflowed in 3 ms
[2023-03-18 06:54:44] [INFO ] Implicit Places using invariants in 79 ms returned []
// Phase 1: matrix 486 rows 112 cols
[2023-03-18 06:54:44] [INFO ] Invariants computation overflowed in 3 ms
[2023-03-18 06:54:45] [INFO ] Implicit Places using invariants and state equation in 311 ms returned [64, 109]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 395 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 110/115 places, 486/486 transitions.
Applied a total of 0 rules in 3 ms. Remains 110 /110 variables (removed 0) and now considering 486/486 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 405 ms. Remains : 110/115 places, 486/486 transitions.
Stuttering acceptance computed with spot in 285 ms :[(NOT p0), (AND (NOT p2) (NOT p0) p1), (NOT p0), true, (NOT p2), (AND (NOT p2) p1), (AND (NOT p0) p1 (NOT p2))]
Running random walk in product with property : Railroad-PT-020-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 5}, { cond=(NOT p0), acceptance={0} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND p1 p2), acceptance={} source=5 dest: 4}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=true, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s21 1) (EQ s48 1) (EQ s56 1)), p1:(AND (EQ s24 1) (EQ s32 1) (EQ s56 1)), p2:(AND (EQ s5 1) (EQ s19 1) (EQ s56 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 30806 reset in 336 ms.
Product exploration explored 100000 steps with 30785 reset in 306 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), true, (X (X (NOT p0))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 438 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[(NOT p0), (NOT p0), true, (NOT p2), (AND (NOT p2) p1), (AND (NOT p0) (NOT p2) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) 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 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 486 rows 110 cols
[2023-03-18 06:54:46] [INFO ] Computed 24 place invariants in 13 ms
[2023-03-18 06:54:47] [INFO ] [Real]Absence check using 22 positive place invariants in 4 ms returned sat
[2023-03-18 06:54:47] [INFO ] [Real]Absence check using 22 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 06:54:47] [INFO ] After 161ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-18 06:54:47] [INFO ] [Nat]Absence check using 22 positive place invariants in 3 ms returned sat
[2023-03-18 06:54:47] [INFO ] [Nat]Absence check using 22 positive and 2 generalized place invariants in 6 ms returned sat
[2023-03-18 06:54:47] [INFO ] After 127ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-18 06:54:47] [INFO ] After 192ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-18 06:54:47] [INFO ] After 292ms 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 13 ms.
Support contains 5 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 486/486 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 110 transition count 484
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 108 transition count 484
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 4 place count 108 transition count 463
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 46 place count 87 transition count 463
Applied a total of 46 rules in 50 ms. Remains 87 /110 variables (removed 23) and now considering 463/486 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 87/110 places, 463/486 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1393873 steps, run timeout after 3001 ms. (steps per millisecond=464 ) properties seen :{}
Probabilistic random walk after 1393873 steps, saw 893173 distinct states, run finished after 3001 ms. (steps per millisecond=464 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 463 rows 87 cols
[2023-03-18 06:54:50] [INFO ] Invariants computation overflowed in 7 ms
[2023-03-18 06:54:50] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 06:54:50] [INFO ] After 88ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 06:54:50] [INFO ] After 121ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-18 06:54:50] [INFO ] After 178ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 5 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 463/463 transitions.
Applied a total of 0 rules in 19 ms. Remains 87 /87 variables (removed 0) and now considering 463/463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 87/87 places, 463/463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 463/463 transitions.
Applied a total of 0 rules in 19 ms. Remains 87 /87 variables (removed 0) and now considering 463/463 (removed 0) transitions.
// Phase 1: matrix 463 rows 87 cols
[2023-03-18 06:54:50] [INFO ] Invariants computation overflowed in 6 ms
[2023-03-18 06:54:50] [INFO ] Implicit Places using invariants in 80 ms returned []
// Phase 1: matrix 463 rows 87 cols
[2023-03-18 06:54:50] [INFO ] Invariants computation overflowed in 2 ms
[2023-03-18 06:54:51] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
[2023-03-18 06:54:51] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 463 rows 87 cols
[2023-03-18 06:54:51] [INFO ] Invariants computation overflowed in 29 ms
[2023-03-18 06:54:51] [INFO ] Dead Transitions using invariants and state equation in 182 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 597 ms. Remains : 87/87 places, 463/463 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 87 transition count 443
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 67 transition count 443
Applied a total of 40 rules in 11 ms. Remains 67 /87 variables (removed 20) and now considering 443/463 (removed 20) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 443 rows 67 cols
[2023-03-18 06:54:51] [INFO ] Invariants computation overflowed in 3 ms
[2023-03-18 06:54:51] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 06:54:51] [INFO ] After 84ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 06:54:51] [INFO ] After 114ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-18 06:54:51] [INFO ] After 165ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), true, (X (X (NOT p0))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p2))), (G (NOT (AND p1 p2)))]
False Knowledge obtained : [(F p0), (F p2)]
Knowledge based reduction with 10 factoid took 478 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0), true, p1, (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0), true, p1, (AND (NOT p0) p1)]
[2023-03-18 06:54:52] [INFO ] Invariant cache hit.
[2023-03-18 06:54:52] [INFO ] [Real]Absence check using 22 positive place invariants in 4 ms returned sat
[2023-03-18 06:54:52] [INFO ] [Real]Absence check using 22 positive and 2 generalized place invariants in 5 ms returned sat
[2023-03-18 06:54:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 06:54:52] [INFO ] [Real]Absence check using state equation in 212 ms returned sat
[2023-03-18 06:54:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 06:54:52] [INFO ] [Nat]Absence check using 22 positive place invariants in 4 ms returned sat
[2023-03-18 06:54:52] [INFO ] [Nat]Absence check using 22 positive and 2 generalized place invariants in 4 ms returned sat
[2023-03-18 06:54:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 06:54:53] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2023-03-18 06:54:53] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2023-03-18 06:54:53] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 0 ms to minimize.
[2023-03-18 06:54:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 148 ms
Proved EG (NOT p0)
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), true, (X (X (NOT p0))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p2))), (G (NOT (AND p1 p2)))]
False Knowledge obtained : [(F p0), (F p2), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 10 factoid took 252 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Railroad-PT-020-LTLFireability-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Railroad-PT-020-LTLFireability-01 finished in 8866 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 486/486 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 112 transition count 486
Applied a total of 3 rules in 3 ms. Remains 112 /115 variables (removed 3) and now considering 486/486 (removed 0) transitions.
// Phase 1: matrix 486 rows 112 cols
[2023-03-18 06:54:53] [INFO ] Invariants computation overflowed in 2 ms
[2023-03-18 06:54:53] [INFO ] Implicit Places using invariants in 88 ms returned []
// Phase 1: matrix 486 rows 112 cols
[2023-03-18 06:54:53] [INFO ] Invariants computation overflowed in 3 ms
[2023-03-18 06:54:54] [INFO ] Implicit Places using invariants and state equation in 443 ms returned [64, 109]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 533 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 110/115 places, 486/486 transitions.
Applied a total of 0 rules in 1 ms. Remains 110 /110 variables (removed 0) and now considering 486/486 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 538 ms. Remains : 110/115 places, 486/486 transitions.
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Railroad-PT-020-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s13 1) (EQ s50 1) (EQ s56 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Railroad-PT-020-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Railroad-PT-020-LTLFireability-02 finished in 636 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 3 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 486/486 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 112 transition count 486
Applied a total of 3 rules in 3 ms. Remains 112 /115 variables (removed 3) and now considering 486/486 (removed 0) transitions.
// Phase 1: matrix 486 rows 112 cols
[2023-03-18 06:54:54] [INFO ] Invariants computation overflowed in 2 ms
[2023-03-18 06:54:54] [INFO ] Implicit Places using invariants in 88 ms returned []
// Phase 1: matrix 486 rows 112 cols
[2023-03-18 06:54:54] [INFO ] Invariants computation overflowed in 3 ms
[2023-03-18 06:54:54] [INFO ] Implicit Places using invariants and state equation in 437 ms returned [64, 109]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 529 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 110/115 places, 486/486 transitions.
Applied a total of 0 rules in 1 ms. Remains 110 /110 variables (removed 0) and now considering 486/486 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 534 ms. Remains : 110/115 places, 486/486 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Railroad-PT-020-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (EQ s17 1) (EQ s40 1) (EQ s56 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 116 reset in 379 ms.
Stack based approach found an accepted trace after 6168 steps with 3 reset with depth 2871 and stack size 2871 in 25 ms.
FORMULA Railroad-PT-020-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-020-LTLFireability-04 finished in 1071 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 486/486 transitions.
Ensure Unique test removed 3 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 112 transition count 484
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 110 transition count 484
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 4 place count 110 transition count 464
Deduced a syphon composed of 20 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 41 rules applied. Total rules applied 45 place count 89 transition count 464
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 47 place count 88 transition count 463
Applied a total of 47 rules in 37 ms. Remains 88 /115 variables (removed 27) and now considering 463/486 (removed 23) transitions.
// Phase 1: matrix 463 rows 88 cols
[2023-03-18 06:54:55] [INFO ] Invariants computation overflowed in 3 ms
[2023-03-18 06:54:55] [INFO ] Implicit Places using invariants in 82 ms returned []
// Phase 1: matrix 463 rows 88 cols
[2023-03-18 06:54:55] [INFO ] Invariants computation overflowed in 6 ms
[2023-03-18 06:54:55] [INFO ] Implicit Places using invariants and state equation in 240 ms returned [85]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 324 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/115 places, 463/486 transitions.
Applied a total of 0 rules in 21 ms. Remains 87 /87 variables (removed 0) and now considering 463/463 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 383 ms. Remains : 87/115 places, 463/486 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : Railroad-PT-020-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s12 1) (EQ s32 1) (EQ s36 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 416 reset in 422 ms.
Stack based approach found an accepted trace after 284 steps with 1 reset with depth 137 and stack size 137 in 1 ms.
FORMULA Railroad-PT-020-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-020-LTLFireability-05 finished in 865 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 486/486 transitions.
Ensure Unique test removed 3 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 112 transition count 484
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 110 transition count 484
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 4 place count 110 transition count 464
Deduced a syphon composed of 20 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 41 rules applied. Total rules applied 45 place count 89 transition count 464
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 47 place count 88 transition count 463
Applied a total of 47 rules in 35 ms. Remains 88 /115 variables (removed 27) and now considering 463/486 (removed 23) transitions.
// Phase 1: matrix 463 rows 88 cols
[2023-03-18 06:54:56] [INFO ] Invariants computation overflowed in 5 ms
[2023-03-18 06:54:56] [INFO ] Implicit Places using invariants in 85 ms returned []
// Phase 1: matrix 463 rows 88 cols
[2023-03-18 06:54:56] [INFO ] Invariants computation overflowed in 6 ms
[2023-03-18 06:54:56] [INFO ] Implicit Places using invariants and state equation in 226 ms returned [85]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 313 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/115 places, 463/486 transitions.
Applied a total of 0 rules in 21 ms. Remains 87 /87 variables (removed 0) and now considering 463/463 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 369 ms. Remains : 87/115 places, 463/486 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : Railroad-PT-020-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s11 1) (EQ s32 1) (EQ s36 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 396 reset in 386 ms.
Stack based approach found an accepted trace after 982 steps with 3 reset with depth 405 and stack size 405 in 4 ms.
FORMULA Railroad-PT-020-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-020-LTLFireability-06 finished in 813 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&(X(F(p1))||((p1||G(p3))&&p2))))))'
Support contains 9 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 486/486 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 113 transition count 486
Applied a total of 2 rules in 2 ms. Remains 113 /115 variables (removed 2) and now considering 486/486 (removed 0) transitions.
// Phase 1: matrix 486 rows 113 cols
[2023-03-18 06:54:56] [INFO ] Invariants computation overflowed in 3 ms
[2023-03-18 06:54:56] [INFO ] Implicit Places using invariants in 86 ms returned []
// Phase 1: matrix 486 rows 113 cols
[2023-03-18 06:54:56] [INFO ] Invariants computation overflowed in 3 ms
[2023-03-18 06:54:57] [INFO ] Implicit Places using invariants and state equation in 433 ms returned [110]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 521 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 112/115 places, 486/486 transitions.
Applied a total of 0 rules in 1 ms. Remains 112 /112 variables (removed 0) and now considering 486/486 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 525 ms. Remains : 112/115 places, 486/486 transitions.
Stuttering acceptance computed with spot in 272 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : Railroad-PT-020-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(OR (NOT p2) (AND (NOT p1) (NOT p3))), acceptance={} source=2 dest: 4}, { cond=(AND p2 (NOT p1) p3), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p3), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s64 1) (EQ s67 1)), p2:(AND (EQ s11 1) (EQ s49 1) (EQ s56 1)), p1:(AND (EQ s65 1) (EQ s92 1)), p3:(AND (EQ s20 1) (EQ s37 1) (EQ s56 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2211 reset in 346 ms.
Stack based approach found an accepted trace after 23684 steps with 557 reset with depth 127 and stack size 127 in 81 ms.
FORMULA Railroad-PT-020-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-020-LTLFireability-07 finished in 1251 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
Support contains 3 out of 115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 486/486 transitions.
Ensure Unique test removed 3 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 112 transition count 484
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 110 transition count 484
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 4 place count 110 transition count 464
Deduced a syphon composed of 20 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 41 rules applied. Total rules applied 45 place count 89 transition count 464
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 47 place count 88 transition count 463
Applied a total of 47 rules in 34 ms. Remains 88 /115 variables (removed 27) and now considering 463/486 (removed 23) transitions.
// Phase 1: matrix 463 rows 88 cols
[2023-03-18 06:54:58] [INFO ] Invariants computation overflowed in 6 ms
[2023-03-18 06:54:58] [INFO ] Implicit Places using invariants in 86 ms returned []
// Phase 1: matrix 463 rows 88 cols
[2023-03-18 06:54:58] [INFO ] Invariants computation overflowed in 5 ms
[2023-03-18 06:54:58] [INFO ] Implicit Places using invariants and state equation in 241 ms returned [85]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 329 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/115 places, 463/486 transitions.
Applied a total of 0 rules in 19 ms. Remains 87 /87 variables (removed 0) and now considering 463/463 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 384 ms. Remains : 87/115 places, 463/486 transitions.
Stuttering acceptance computed with spot in 157 ms :[p0, p0]
Running random walk in product with property : Railroad-PT-020-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s21 1) (EQ s32 1) (EQ s36 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 383 ms.
Product exploration explored 100000 steps with 0 reset in 423 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[p0, p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1383911 steps, run timeout after 3035 ms. (steps per millisecond=455 ) properties seen :{}
Probabilistic random walk after 1383911 steps, saw 875639 distinct states, run finished after 3036 ms. (steps per millisecond=455 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 463 rows 87 cols
[2023-03-18 06:55:02] [INFO ] Invariants computation overflowed in 2 ms
[2023-03-18 06:55:02] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 06:55:03] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 06:55:03] [INFO ] After 145ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-18 06:55:03] [INFO ] After 212ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 463/463 transitions.
Applied a total of 0 rules in 24 ms. Remains 87 /87 variables (removed 0) and now considering 463/463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 87/87 places, 463/463 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1175377 steps, run timeout after 3001 ms. (steps per millisecond=391 ) properties seen :{}
Probabilistic random walk after 1175377 steps, saw 753530 distinct states, run finished after 3001 ms. (steps per millisecond=391 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 463 rows 87 cols
[2023-03-18 06:55:06] [INFO ] Invariants computation overflowed in 6 ms
[2023-03-18 06:55:06] [INFO ] After 132ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 06:55:06] [INFO ] After 86ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 06:55:06] [INFO ] After 127ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-18 06:55:06] [INFO ] After 177ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 463/463 transitions.
Applied a total of 0 rules in 55 ms. Remains 87 /87 variables (removed 0) and now considering 463/463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 87/87 places, 463/463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 463/463 transitions.
Applied a total of 0 rules in 17 ms. Remains 87 /87 variables (removed 0) and now considering 463/463 (removed 0) transitions.
// Phase 1: matrix 463 rows 87 cols
[2023-03-18 06:55:06] [INFO ] Invariants computation overflowed in 3 ms
[2023-03-18 06:55:06] [INFO ] Implicit Places using invariants in 80 ms returned []
// Phase 1: matrix 463 rows 87 cols
[2023-03-18 06:55:06] [INFO ] Invariants computation overflowed in 2 ms
[2023-03-18 06:55:06] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
[2023-03-18 06:55:06] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 463 rows 87 cols
[2023-03-18 06:55:06] [INFO ] Invariants computation overflowed in 5 ms
[2023-03-18 06:55:07] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 512 ms. Remains : 87/87 places, 463/463 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 87 transition count 443
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 67 transition count 443
Applied a total of 40 rules in 7 ms. Remains 67 /87 variables (removed 20) and now considering 443/463 (removed 20) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 443 rows 67 cols
[2023-03-18 06:55:07] [INFO ] Invariants computation overflowed in 5 ms
[2023-03-18 06:55:07] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 06:55:07] [INFO ] After 81ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 06:55:07] [INFO ] After 105ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-18 06:55:07] [INFO ] After 155ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[p0, p0]
Stuttering acceptance computed with spot in 62 ms :[p0, p0]
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 463/463 transitions.
Applied a total of 0 rules in 30 ms. Remains 87 /87 variables (removed 0) and now considering 463/463 (removed 0) transitions.
// Phase 1: matrix 463 rows 87 cols
[2023-03-18 06:55:07] [INFO ] Invariants computation overflowed in 5 ms
[2023-03-18 06:55:07] [INFO ] Implicit Places using invariants in 79 ms returned []
// Phase 1: matrix 463 rows 87 cols
[2023-03-18 06:55:07] [INFO ] Invariants computation overflowed in 6 ms
[2023-03-18 06:55:07] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
[2023-03-18 06:55:08] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 463 rows 87 cols
[2023-03-18 06:55:08] [INFO ] Invariants computation overflowed in 3 ms
[2023-03-18 06:55:08] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 518 ms. Remains : 87/87 places, 463/463 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[p0, p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1425883 steps, run timeout after 3015 ms. (steps per millisecond=472 ) properties seen :{}
Probabilistic random walk after 1425883 steps, saw 899531 distinct states, run finished after 3015 ms. (steps per millisecond=472 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 463 rows 87 cols
[2023-03-18 06:55:11] [INFO ] Invariants computation overflowed in 5 ms
[2023-03-18 06:55:11] [INFO ] After 127ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 06:55:11] [INFO ] After 88ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 06:55:11] [INFO ] After 132ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-18 06:55:11] [INFO ] After 186ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 463/463 transitions.
Applied a total of 0 rules in 22 ms. Remains 87 /87 variables (removed 0) and now considering 463/463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 87/87 places, 463/463 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1390435 steps, run timeout after 3001 ms. (steps per millisecond=463 ) properties seen :{}
Probabilistic random walk after 1390435 steps, saw 879274 distinct states, run finished after 3001 ms. (steps per millisecond=463 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 463 rows 87 cols
[2023-03-18 06:55:14] [INFO ] Invariants computation overflowed in 6 ms
[2023-03-18 06:55:14] [INFO ] After 121ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 06:55:15] [INFO ] After 75ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 06:55:15] [INFO ] After 113ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-18 06:55:15] [INFO ] After 162ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 463/463 transitions.
Applied a total of 0 rules in 18 ms. Remains 87 /87 variables (removed 0) and now considering 463/463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 87/87 places, 463/463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 463/463 transitions.
Applied a total of 0 rules in 16 ms. Remains 87 /87 variables (removed 0) and now considering 463/463 (removed 0) transitions.
// Phase 1: matrix 463 rows 87 cols
[2023-03-18 06:55:15] [INFO ] Invariants computation overflowed in 5 ms
[2023-03-18 06:55:15] [INFO ] Implicit Places using invariants in 86 ms returned []
// Phase 1: matrix 463 rows 87 cols
[2023-03-18 06:55:15] [INFO ] Invariants computation overflowed in 6 ms
[2023-03-18 06:55:15] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
[2023-03-18 06:55:15] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 463 rows 87 cols
[2023-03-18 06:55:15] [INFO ] Invariants computation overflowed in 5 ms
[2023-03-18 06:55:15] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 520 ms. Remains : 87/87 places, 463/463 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 87 transition count 443
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 67 transition count 443
Applied a total of 40 rules in 6 ms. Remains 67 /87 variables (removed 20) and now considering 443/463 (removed 20) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 443 rows 67 cols
[2023-03-18 06:55:15] [INFO ] Invariants computation overflowed in 2 ms
[2023-03-18 06:55:15] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 06:55:15] [INFO ] After 105ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 06:55:15] [INFO ] After 129ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-18 06:55:15] [INFO ] After 180ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[p0, p0]
Stuttering acceptance computed with spot in 71 ms :[p0, p0]
Stuttering acceptance computed with spot in 74 ms :[p0, p0]
Product exploration explored 100000 steps with 0 reset in 379 ms.
Product exploration explored 100000 steps with 0 reset in 417 ms.
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 463/463 transitions.
Applied a total of 0 rules in 19 ms. Remains 87 /87 variables (removed 0) and now considering 463/463 (removed 0) transitions.
// Phase 1: matrix 463 rows 87 cols
[2023-03-18 06:55:17] [INFO ] Invariants computation overflowed in 4 ms
[2023-03-18 06:55:17] [INFO ] Implicit Places using invariants in 82 ms returned []
// Phase 1: matrix 463 rows 87 cols
[2023-03-18 06:55:17] [INFO ] Invariants computation overflowed in 2 ms
[2023-03-18 06:55:17] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
[2023-03-18 06:55:17] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 463 rows 87 cols
[2023-03-18 06:55:17] [INFO ] Invariants computation overflowed in 3 ms
[2023-03-18 06:55:17] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 529 ms. Remains : 87/87 places, 463/463 transitions.
Treatment of property Railroad-PT-020-LTLFireability-09 finished in 19611 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(((p1 U X(p2))&&p0))||G(p3))))'
Support contains 7 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 486/486 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 112 transition count 486
Applied a total of 3 rules in 2 ms. Remains 112 /115 variables (removed 3) and now considering 486/486 (removed 0) transitions.
// Phase 1: matrix 486 rows 112 cols
[2023-03-18 06:55:17] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-18 06:55:17] [INFO ] Implicit Places using invariants in 248 ms returned []
// Phase 1: matrix 486 rows 112 cols
[2023-03-18 06:55:17] [INFO ] Invariants computation overflowed in 3 ms
[2023-03-18 06:55:18] [INFO ] Implicit Places using invariants and state equation in 294 ms returned [64, 109]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 546 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 110/115 places, 486/486 transitions.
Applied a total of 0 rules in 2 ms. Remains 110 /110 variables (removed 0) and now considering 486/486 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 550 ms. Remains : 110/115 places, 486/486 transitions.
Stuttering acceptance computed with spot in 185 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : Railroad-PT-020-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p3 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p3 p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p3) p0 p1), acceptance={0} source=1 dest: 2}, { cond=(AND p3 p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p3) p0 (NOT p1)), acceptance={0} source=1 dest: 3}], [{ cond=(AND p3 p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) p1 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p3 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p3) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(AND p3 (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p3) (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND p3 p0 p1 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p3) p0 p1 (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p3 p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p3) p0 (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p3:(AND (EQ s1 1) (EQ s4 1)), p0:(AND (EQ s1 1) (EQ s4 1)), p1:(AND (EQ s22 1) (EQ s45 1) (EQ s56 1)), p2:(AND (EQ s24 1) (EQ s49 1) (EQ s56 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 386 ms.
Stack based approach found an accepted trace after 12159 steps with 0 reset with depth 12160 and stack size 12160 in 50 ms.
FORMULA Railroad-PT-020-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-020-LTLFireability-10 finished in 1191 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 3 out of 115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 486/486 transitions.
Ensure Unique test removed 3 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 112 transition count 484
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 110 transition count 484
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 4 place count 110 transition count 464
Deduced a syphon composed of 20 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 41 rules applied. Total rules applied 45 place count 89 transition count 464
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 47 place count 88 transition count 463
Applied a total of 47 rules in 31 ms. Remains 88 /115 variables (removed 27) and now considering 463/486 (removed 23) transitions.
// Phase 1: matrix 463 rows 88 cols
[2023-03-18 06:55:18] [INFO ] Invariants computation overflowed in 4 ms
[2023-03-18 06:55:19] [INFO ] Implicit Places using invariants in 93 ms returned []
// Phase 1: matrix 463 rows 88 cols
[2023-03-18 06:55:19] [INFO ] Invariants computation overflowed in 2 ms
[2023-03-18 06:55:19] [INFO ] Implicit Places using invariants and state equation in 238 ms returned [85]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 333 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/115 places, 463/486 transitions.
Applied a total of 0 rules in 19 ms. Remains 87 /87 variables (removed 0) and now considering 463/463 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 383 ms. Remains : 87/115 places, 463/486 transitions.
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : Railroad-PT-020-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s16 1) (EQ s32 1) (EQ s36 1)), p1:(OR (EQ s16 0) (EQ s32 0) (EQ s36 0))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 422 ms.
Stack based approach found an accepted trace after 8536 steps with 0 reset with depth 8537 and stack size 8527 in 40 ms.
FORMULA Railroad-PT-020-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-020-LTLFireability-11 finished in 899 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0)) U (X((G((p2 U p0)) U p3))&&p1)))'
Support contains 7 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 486/486 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 113 transition count 486
Applied a total of 2 rules in 3 ms. Remains 113 /115 variables (removed 2) and now considering 486/486 (removed 0) transitions.
// Phase 1: matrix 486 rows 113 cols
[2023-03-18 06:55:19] [INFO ] Computed 27 place invariants in 3 ms
[2023-03-18 06:55:19] [INFO ] Implicit Places using invariants in 148 ms returned [64, 110]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 149 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 111/115 places, 486/486 transitions.
Applied a total of 0 rules in 1 ms. Remains 111 /111 variables (removed 0) and now considering 486/486 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 153 ms. Remains : 111/115 places, 486/486 transitions.
Stuttering acceptance computed with spot in 458 ms :[(OR (NOT p1) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3)), (NOT p3), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : Railroad-PT-020-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=p1, acceptance={0} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=2 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(OR (AND p1 (NOT p3)) (AND p0 (NOT p3)) (AND (NOT p3) p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) p2), acceptance={0} source=3 dest: 4}, { cond=(OR (AND (NOT p1) p0 (NOT p3)) (AND (NOT p1) (NOT p3) p2)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=4 dest: 4}, { cond=(AND p1 (NOT p0) p2), acceptance={0} source=4 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 1}, { cond=p1, acceptance={} source=5 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=5 dest: 4}, { cond=(OR (AND (NOT p1) p0) (AND (NOT p1) p2)), acceptance={} source=5 dest: 5}, { cond=(AND p1 (NOT p0) p2), acceptance={0} source=5 dest: 6}, { cond=(OR (AND p1 p0) (AND p1 p2)), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), acceptance={0} source=6 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p3)), acceptance={} source=6 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p3) (NOT p2)), acceptance={0} source=6 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) p2), acceptance={0} source=6 dest: 4}, { cond=(AND p1 (NOT p0) (NOT p3) p2), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), acceptance={0} source=7 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=7 dest: 1}, { cond=(AND p1 (NOT p3)), acceptance={} source=7 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p3) (NOT p2)), acceptance={0} source=7 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) p2), acceptance={0} source=7 dest: 4}, { cond=(OR (AND (NOT p1) p0 (NOT p3)) (AND (NOT p1) (NOT p3) p2)), acceptance={} source=7 dest: 5}, { cond=(AND p1 (NOT p0) (NOT p3) p2), acceptance={0} source=7 dest: 6}, { cond=(OR (AND p1 p0 (NOT p3)) (AND p1 (NOT p3) p2)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(AND (EQ s64 1) (EQ s89 1)), p0:(AND (EQ s23 1) (EQ s35 1) (EQ s56 1)), p3:(AND (EQ s28 1) (EQ s45 1) (EQ s56 1)), p2:(AND (EQ s64 1) (EQ s89 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 305 ms.
Stack based approach found an accepted trace after 10048 steps with 0 reset with depth 10049 and stack size 10049 in 33 ms.
FORMULA Railroad-PT-020-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-020-LTLFireability-12 finished in 984 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U (F(G(!p1)) U p2)))'
Support contains 6 out of 115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 486/486 transitions.
Ensure Unique test removed 3 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 112 transition count 484
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 110 transition count 484
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 4 place count 110 transition count 466
Deduced a syphon composed of 18 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 41 place count 91 transition count 466
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 43 place count 90 transition count 465
Applied a total of 43 rules in 32 ms. Remains 90 /115 variables (removed 25) and now considering 465/486 (removed 21) transitions.
// Phase 1: matrix 465 rows 90 cols
[2023-03-18 06:55:20] [INFO ] Invariants computation overflowed in 2 ms
[2023-03-18 06:55:20] [INFO ] Implicit Places using invariants in 75 ms returned []
// Phase 1: matrix 465 rows 90 cols
[2023-03-18 06:55:20] [INFO ] Invariants computation overflowed in 2 ms
[2023-03-18 06:55:21] [INFO ] Implicit Places using invariants and state equation in 225 ms returned [87]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 303 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 89/115 places, 465/486 transitions.
Applied a total of 0 rules in 20 ms. Remains 89 /89 variables (removed 0) and now considering 465/465 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 355 ms. Remains : 89/115 places, 465/486 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p2), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : Railroad-PT-020-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(AND (EQ s30 1) (EQ s33 1) (EQ s38 1)), p1:(AND (EQ s27 1) (EQ s32 1) (EQ s38 1)), p0:(AND (EQ s30 1) (EQ s34 1) (EQ s38 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 15 reset in 373 ms.
Product exploration explored 100000 steps with 9 reset in 378 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p2)), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 393 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p2), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Finished random walk after 3290 steps, including 0 resets, run visited all 4 properties in 52 ms. (steps per millisecond=63 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p2)), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p2)))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F p2), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 10 factoid took 476 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p2), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 107 ms :[(NOT p2), (AND (NOT p0) p1), (AND (NOT p0) p1)]
// Phase 1: matrix 465 rows 89 cols
[2023-03-18 06:55:23] [INFO ] Invariants computation overflowed in 6 ms
[2023-03-18 06:55:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 06:55:23] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2023-03-18 06:55:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 06:55:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 06:55:23] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2023-03-18 06:55:23] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 0 ms to minimize.
[2023-03-18 06:55:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 72 ms
Proved EG (NOT p2)
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p2)), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p2)))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F p2), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1 (NOT p2))), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 10 factoid took 218 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Railroad-PT-020-LTLFireability-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Railroad-PT-020-LTLFireability-13 finished in 3253 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 5 out of 115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 486/486 transitions.
Ensure Unique test removed 3 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 112 transition count 484
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 110 transition count 484
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 4 place count 110 transition count 465
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 39 rules applied. Total rules applied 43 place count 90 transition count 465
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 45 place count 89 transition count 464
Applied a total of 45 rules in 24 ms. Remains 89 /115 variables (removed 26) and now considering 464/486 (removed 22) transitions.
// Phase 1: matrix 464 rows 89 cols
[2023-03-18 06:55:24] [INFO ] Computed 25 place invariants in 2 ms
[2023-03-18 06:55:24] [INFO ] Implicit Places using invariants in 136 ms returned [86]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 151 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 88/115 places, 464/486 transitions.
Applied a total of 0 rules in 18 ms. Remains 88 /88 variables (removed 0) and now considering 464/464 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 193 ms. Remains : 88/115 places, 464/486 transitions.
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : Railroad-PT-020-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s24 0) (EQ s33 0) (EQ s37 0)), p1:(OR (EQ s14 0) (EQ s32 0) (EQ s37 0))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 421 ms.
Product exploration explored 100000 steps with 0 reset in 433 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 320 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 464 rows 88 cols
[2023-03-18 06:55:25] [INFO ] Computed 24 place invariants in 4 ms
[2023-03-18 06:55:25] [INFO ] [Real]Absence check using 22 positive place invariants in 2 ms returned sat
[2023-03-18 06:55:25] [INFO ] [Real]Absence check using 22 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 06:55:25] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-18 06:55:25] [INFO ] [Nat]Absence check using 22 positive place invariants in 5 ms returned sat
[2023-03-18 06:55:25] [INFO ] [Nat]Absence check using 22 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-18 06:55:25] [INFO ] After 85ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-18 06:55:25] [INFO ] After 112ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-18 06:55:25] [INFO ] After 169ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 464/464 transitions.
Applied a total of 0 rules in 19 ms. Remains 88 /88 variables (removed 0) and now considering 464/464 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 88/88 places, 464/464 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1392763 steps, run timeout after 3001 ms. (steps per millisecond=464 ) properties seen :{}
Probabilistic random walk after 1392763 steps, saw 900784 distinct states, run finished after 3001 ms. (steps per millisecond=464 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 06:55:28] [INFO ] Invariant cache hit.
[2023-03-18 06:55:29] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 06:55:29] [INFO ] [Nat]Absence check using 22 positive place invariants in 3 ms returned sat
[2023-03-18 06:55:29] [INFO ] [Nat]Absence check using 22 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 06:55:29] [INFO ] After 85ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 06:55:29] [INFO ] After 110ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-18 06:55:29] [INFO ] After 168ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 464/464 transitions.
Applied a total of 0 rules in 17 ms. Remains 88 /88 variables (removed 0) and now considering 464/464 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 88/88 places, 464/464 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 464/464 transitions.
Applied a total of 0 rules in 16 ms. Remains 88 /88 variables (removed 0) and now considering 464/464 (removed 0) transitions.
[2023-03-18 06:55:29] [INFO ] Invariant cache hit.
[2023-03-18 06:55:29] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-03-18 06:55:29] [INFO ] Invariant cache hit.
[2023-03-18 06:55:29] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
[2023-03-18 06:55:29] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-18 06:55:29] [INFO ] Invariant cache hit.
[2023-03-18 06:55:29] [INFO ] Dead Transitions using invariants and state equation in 227 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 549 ms. Remains : 88/88 places, 464/464 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 88 transition count 444
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 68 transition count 444
Applied a total of 40 rules in 12 ms. Remains 68 /88 variables (removed 20) and now considering 444/464 (removed 20) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 444 rows 68 cols
[2023-03-18 06:55:29] [INFO ] Invariants computation overflowed in 2 ms
[2023-03-18 06:55:29] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 06:55:29] [INFO ] After 78ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 06:55:29] [INFO ] After 104ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-18 06:55:29] [INFO ] After 152ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 10 factoid took 461 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 25 ms :[(AND (NOT p0) (NOT p1))]
Support contains 5 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 464/464 transitions.
Applied a total of 0 rules in 22 ms. Remains 88 /88 variables (removed 0) and now considering 464/464 (removed 0) transitions.
[2023-03-18 06:55:30] [INFO ] Invariant cache hit.
[2023-03-18 06:55:30] [INFO ] Implicit Places using invariants in 99 ms returned []
[2023-03-18 06:55:30] [INFO ] Invariant cache hit.
[2023-03-18 06:55:30] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
[2023-03-18 06:55:30] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-18 06:55:30] [INFO ] Invariant cache hit.
[2023-03-18 06:55:31] [INFO ] Dead Transitions using invariants and state equation in 202 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 522 ms. Remains : 88/88 places, 464/464 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 304 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 06:55:31] [INFO ] Invariant cache hit.
[2023-03-18 06:55:31] [INFO ] [Real]Absence check using 22 positive place invariants in 3 ms returned sat
[2023-03-18 06:55:31] [INFO ] [Real]Absence check using 22 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-18 06:55:31] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 10 factoid took 350 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 402 ms.
Product exploration explored 100000 steps with 0 reset in 443 ms.
Support contains 5 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 464/464 transitions.
Applied a total of 0 rules in 18 ms. Remains 88 /88 variables (removed 0) and now considering 464/464 (removed 0) transitions.
[2023-03-18 06:55:32] [INFO ] Invariant cache hit.
[2023-03-18 06:55:32] [INFO ] Implicit Places using invariants in 105 ms returned []
[2023-03-18 06:55:32] [INFO ] Invariant cache hit.
[2023-03-18 06:55:33] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
[2023-03-18 06:55:33] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-18 06:55:33] [INFO ] Invariant cache hit.
[2023-03-18 06:55:33] [INFO ] Dead Transitions using invariants and state equation in 230 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 558 ms. Remains : 88/88 places, 464/464 transitions.
Treatment of property Railroad-PT-020-LTLFireability-14 finished in 9400 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&G(p1))))'
Support contains 5 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 486/486 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 113 transition count 486
Applied a total of 2 rules in 2 ms. Remains 113 /115 variables (removed 2) and now considering 486/486 (removed 0) transitions.
// Phase 1: matrix 486 rows 113 cols
[2023-03-18 06:55:33] [INFO ] Computed 27 place invariants in 5 ms
[2023-03-18 06:55:33] [INFO ] Implicit Places using invariants in 150 ms returned [65, 110]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 151 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 111/115 places, 486/486 transitions.
Applied a total of 0 rules in 1 ms. Remains 111 /111 variables (removed 0) and now considering 486/486 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 154 ms. Remains : 111/115 places, 486/486 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Railroad-PT-020-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(OR (EQ s23 0) (EQ s51 0) (EQ s57 0)), p0:(OR (EQ s2 0) (EQ s4 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 314 ms.
Product exploration explored 100000 steps with 0 reset in 339 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X p1), true, (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 341 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1505919 steps, run timeout after 3001 ms. (steps per millisecond=501 ) properties seen :{}
Probabilistic random walk after 1505919 steps, saw 1091597 distinct states, run finished after 3005 ms. (steps per millisecond=501 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 486 rows 111 cols
[2023-03-18 06:55:37] [INFO ] Computed 25 place invariants in 10 ms
[2023-03-18 06:55:37] [INFO ] [Real]Absence check using 23 positive place invariants in 3 ms returned sat
[2023-03-18 06:55:37] [INFO ] [Real]Absence check using 23 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 06:55:38] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 06:55:38] [INFO ] [Nat]Absence check using 23 positive place invariants in 3 ms returned sat
[2023-03-18 06:55:38] [INFO ] [Nat]Absence check using 23 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-18 06:55:38] [INFO ] After 87ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 06:55:38] [INFO ] After 118ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-18 06:55:38] [INFO ] After 197ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 61 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=30 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p1 p0), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X p1), true, (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 8 factoid took 288 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p1), (NOT p1)]
Support contains 3 out of 111 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 486/486 transitions.
Applied a total of 0 rules in 1 ms. Remains 111 /111 variables (removed 0) and now considering 486/486 (removed 0) transitions.
[2023-03-18 06:55:38] [INFO ] Invariant cache hit.
[2023-03-18 06:55:38] [INFO ] Implicit Places using invariants in 136 ms returned []
[2023-03-18 06:55:38] [INFO ] Invariant cache hit.
[2023-03-18 06:55:39] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 482 ms to find 0 implicit places.
[2023-03-18 06:55:39] [INFO ] Invariant cache hit.
[2023-03-18 06:55:39] [INFO ] Dead Transitions using invariants and state equation in 179 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 668 ms. Remains : 111/111 places, 486/486 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), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 146 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1419472 steps, run timeout after 3001 ms. (steps per millisecond=472 ) properties seen :{}
Probabilistic random walk after 1419472 steps, saw 1028521 distinct states, run finished after 3001 ms. (steps per millisecond=472 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 06:55:42] [INFO ] Invariant cache hit.
[2023-03-18 06:55:42] [INFO ] [Real]Absence check using 23 positive place invariants in 3 ms returned sat
[2023-03-18 06:55:42] [INFO ] [Real]Absence check using 23 positive and 2 generalized place invariants in 6 ms returned sat
[2023-03-18 06:55:42] [INFO ] After 146ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 06:55:42] [INFO ] [Nat]Absence check using 23 positive place invariants in 3 ms returned sat
[2023-03-18 06:55:42] [INFO ] [Nat]Absence check using 23 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 06:55:42] [INFO ] After 94ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 06:55:42] [INFO ] After 122ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-18 06:55:42] [INFO ] After 190ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 58 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=29 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p1, (X p1), true, (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 155 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p1), (NOT p1)]
Entered a terminal (fully accepting) state of product in 73190 steps with 0 reset in 253 ms.
FORMULA Railroad-PT-020-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Railroad-PT-020-LTLFireability-15 finished in 10158 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)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
[2023-03-18 06:55:43] [INFO ] Flatten gal took : 32 ms
[2023-03-18 06:55:43] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-18 06:55:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 115 places, 486 transitions and 2742 arcs took 5 ms.
Total runtime 68423 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1742/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1742/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : Railroad-PT-020-LTLFireability-09
Could not compute solution for formula : Railroad-PT-020-LTLFireability-14

BK_STOP 1679122545329

--------------------
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-020-LTLFireability-09
ltl formula formula --ltl=/tmp/1742/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 115 places, 486 transitions and 2742 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.100 real 0.020 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1742/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1742/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1742/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1742/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name Railroad-PT-020-LTLFireability-14
ltl formula formula --ltl=/tmp/1742/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
pnml2lts-mc( 0/ 4): Petri net has 115 places, 486 transitions and 2742 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.110 real 0.010 user 0.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1742/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1742/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1742/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1742/ltl_1_
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Railroad-PT-020"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="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-020, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r329-tall-167889202000380"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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