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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.6M
-rw-r--r-- 1 mcc users 5.8K Feb 25 22:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 51K Feb 25 22:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 22:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K Feb 25 22:33 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.0K Feb 25 16:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 22:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 25 22:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 22:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Feb 25 22:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 5.2M 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-100-LTLFireability-00
FORMULA_NAME Railroad-PT-100-LTLFireability-01
FORMULA_NAME Railroad-PT-100-LTLFireability-02
FORMULA_NAME Railroad-PT-100-LTLFireability-03
FORMULA_NAME Railroad-PT-100-LTLFireability-04
FORMULA_NAME Railroad-PT-100-LTLFireability-05
FORMULA_NAME Railroad-PT-100-LTLFireability-06
FORMULA_NAME Railroad-PT-100-LTLFireability-07
FORMULA_NAME Railroad-PT-100-LTLFireability-08
FORMULA_NAME Railroad-PT-100-LTLFireability-09
FORMULA_NAME Railroad-PT-100-LTLFireability-10
FORMULA_NAME Railroad-PT-100-LTLFireability-11
FORMULA_NAME Railroad-PT-100-LTLFireability-12
FORMULA_NAME Railroad-PT-100-LTLFireability-13
FORMULA_NAME Railroad-PT-100-LTLFireability-14
FORMULA_NAME Railroad-PT-100-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679128118430

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-100
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-18 08:28:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 08:28:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 08:28:40] [INFO ] Load time of PNML (sax parser for PT used): 355 ms
[2023-03-18 08:28:40] [INFO ] Transformed 1018 places.
[2023-03-18 08:28:40] [INFO ] Transformed 10506 transitions.
[2023-03-18 08:28:40] [INFO ] Found NUPN structural information;
[2023-03-18 08:28:40] [INFO ] Parsed PT model containing 1018 places and 10506 transitions and 62728 arcs in 510 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 301 places in 128 ms
Reduce places removed 301 places and 100 transitions.
FORMULA Railroad-PT-100-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-100-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-100-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 717 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 717/717 places, 10406/10406 transitions.
Ensure Unique test removed 102 places
Iterating post reduction 0 with 102 rules applied. Total rules applied 102 place count 615 transition count 10406
Applied a total of 102 rules in 239 ms. Remains 615 /717 variables (removed 102) and now considering 10406/10406 (removed 0) transitions.
// Phase 1: matrix 10406 rows 615 cols
[2023-03-18 08:28:41] [INFO ] Invariants computation overflowed in 56 ms
[2023-03-18 08:28:42] [INFO ] Implicit Places using invariants in 986 ms returned []
Implicit Place search using SMT only with invariants took 1010 ms to find 0 implicit places.
// Phase 1: matrix 10406 rows 615 cols
[2023-03-18 08:28:42] [INFO ] Invariants computation overflowed in 29 ms
[2023-03-18 08:28:45] [INFO ] Dead Transitions using invariants and state equation in 3265 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 615/717 places, 10406/10406 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4523 ms. Remains : 615/717 places, 10406/10406 transitions.
Support contains 50 out of 615 places after structural reductions.
[2023-03-18 08:28:46] [INFO ] Flatten gal took : 614 ms
[2023-03-18 08:28:46] [INFO ] Flatten gal took : 455 ms
[2023-03-18 08:28:47] [INFO ] Input system was already deterministic with 10406 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 904 ms. (steps per millisecond=11 ) properties (out of 28) seen :8
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
// Phase 1: matrix 10406 rows 615 cols
[2023-03-18 08:28:49] [INFO ] Invariants computation overflowed in 22 ms
[2023-03-18 08:29:02] [INFO ] After 13227ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:18
[2023-03-18 08:29:14] [INFO ] After 11679ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :18
[2023-03-18 08:29:23] [INFO ] After 20316ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :18
Attempting to minimize the solution found.
Minimization took 4219 ms.
[2023-03-18 08:29:27] [INFO ] After 25015ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :17
Fused 20 Parikh solutions to 18 different solutions.
Parikh walk visited 16 properties in 3750 ms.
Support contains 4 out of 615 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 10406/10406 transitions.
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 27 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 0 with 196 rules applied. Total rules applied 196 place count 517 transition count 10308
Applied a total of 196 rules in 6941 ms. Remains 517 /615 variables (removed 98) and now considering 10308/10406 (removed 98) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6949 ms. Remains : 517/615 places, 10308/10406 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 406 ms. (steps per millisecond=24 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 10308 rows 517 cols
[2023-03-18 08:29:38] [INFO ] Invariants computation overflowed in 38 ms
[2023-03-18 08:29:41] [INFO ] After 2561ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 08:29:44] [INFO ] After 2684ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 08:29:44] [INFO ] After 3056ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 191 ms.
[2023-03-18 08:29:44] [INFO ] After 3372ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 251 steps, including 2 resets, run visited all 1 properties in 11 ms. (steps per millisecond=22 )
Parikh walk visited 1 properties in 13 ms.
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
FORMULA Railroad-PT-100-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 615 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 615/615 places, 10406/10406 transitions.
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 32 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 0 with 198 rules applied. Total rules applied 198 place count 516 transition count 10307
Applied a total of 198 rules in 6510 ms. Remains 516 /615 variables (removed 99) and now considering 10307/10406 (removed 99) transitions.
// Phase 1: matrix 10307 rows 516 cols
[2023-03-18 08:29:51] [INFO ] Invariants computation overflowed in 21 ms
[2023-03-18 08:29:52] [INFO ] Implicit Places using invariants in 907 ms returned []
Implicit Place search using SMT only with invariants took 910 ms to find 0 implicit places.
// Phase 1: matrix 10307 rows 516 cols
[2023-03-18 08:29:52] [INFO ] Invariants computation overflowed in 18 ms
[2023-03-18 08:29:55] [INFO ] Dead Transitions using invariants and state equation in 3042 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 516/615 places, 10307/10406 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10469 ms. Remains : 516/615 places, 10307/10406 transitions.
Stuttering acceptance computed with spot in 201 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Railroad-PT-100-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (NEQ s182 1) (NEQ s206 1) (NEQ s492 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 2865 ms.
Product exploration explored 100000 steps with 0 reset in 2968 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 119 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 79 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 311 ms. (steps per millisecond=32 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 252786 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :{}
Probabilistic random walk after 252786 steps, saw 244211 distinct states, run finished after 3002 ms. (steps per millisecond=84 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 10307 rows 516 cols
[2023-03-18 08:30:05] [INFO ] Invariants computation overflowed in 23 ms
[2023-03-18 08:30:08] [INFO ] After 2932ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 08:30:11] [INFO ] After 2718ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 08:30:11] [INFO ] After 3104ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 211 ms.
[2023-03-18 08:30:11] [INFO ] After 3417ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 403 steps, including 2 resets, run visited all 1 properties in 17 ms. (steps per millisecond=23 )
Parikh walk visited 1 properties in 17 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 161 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 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 516 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 516/516 places, 10307/10307 transitions.
Applied a total of 0 rules in 6335 ms. Remains 516 /516 variables (removed 0) and now considering 10307/10307 (removed 0) transitions.
// Phase 1: matrix 10307 rows 516 cols
[2023-03-18 08:30:18] [INFO ] Invariants computation overflowed in 18 ms
[2023-03-18 08:30:19] [INFO ] Implicit Places using invariants in 846 ms returned []
Implicit Place search using SMT only with invariants took 848 ms to find 0 implicit places.
// Phase 1: matrix 10307 rows 516 cols
[2023-03-18 08:30:19] [INFO ] Invariants computation overflowed in 12 ms
[2023-03-18 08:30:22] [INFO ] Dead Transitions using invariants and state equation in 2907 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10093 ms. Remains : 516/516 places, 10307/10307 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 248 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 :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 299 ms. (steps per millisecond=33 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 238332 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :{}
Probabilistic random walk after 238332 steps, saw 230233 distinct states, run finished after 3002 ms. (steps per millisecond=79 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 10307 rows 516 cols
[2023-03-18 08:30:26] [INFO ] Invariants computation overflowed in 16 ms
[2023-03-18 08:30:28] [INFO ] After 2694ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 08:30:31] [INFO ] After 2637ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 08:30:31] [INFO ] After 3020ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 192 ms.
[2023-03-18 08:30:32] [INFO ] After 3320ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 405 steps, including 2 resets, run visited all 1 properties in 15 ms. (steps per millisecond=27 )
Parikh walk visited 1 properties in 15 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 107 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 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 2553 ms.
Product exploration explored 100000 steps with 0 reset in 2694 ms.
Support contains 3 out of 516 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 516/516 places, 10307/10307 transitions.
Applied a total of 0 rules in 5904 ms. Remains 516 /516 variables (removed 0) and now considering 10307/10307 (removed 0) transitions.
// Phase 1: matrix 10307 rows 516 cols
[2023-03-18 08:30:43] [INFO ] Invariants computation overflowed in 31 ms
[2023-03-18 08:30:44] [INFO ] Implicit Places using invariants in 886 ms returned []
Implicit Place search using SMT only with invariants took 889 ms to find 0 implicit places.
// Phase 1: matrix 10307 rows 516 cols
[2023-03-18 08:30:44] [INFO ] Invariants computation overflowed in 13 ms
[2023-03-18 08:30:47] [INFO ] Dead Transitions using invariants and state equation in 2888 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9687 ms. Remains : 516/516 places, 10307/10307 transitions.
Treatment of property Railroad-PT-100-LTLFireability-00 finished in 63165 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(G(((G(p1)&&p0) U p2)))))'
Support contains 5 out of 615 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 615/615 places, 10406/10406 transitions.
Applied a total of 0 rules in 55 ms. Remains 615 /615 variables (removed 0) and now considering 10406/10406 (removed 0) transitions.
// Phase 1: matrix 10406 rows 615 cols
[2023-03-18 08:30:48] [INFO ] Invariants computation overflowed in 21 ms
[2023-03-18 08:30:49] [INFO ] Implicit Places using invariants in 873 ms returned []
Implicit Place search using SMT only with invariants took 874 ms to find 0 implicit places.
// Phase 1: matrix 10406 rows 615 cols
[2023-03-18 08:30:49] [INFO ] Invariants computation overflowed in 12 ms
[2023-03-18 08:30:52] [INFO ] Dead Transitions using invariants and state equation in 3068 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3998 ms. Remains : 615/615 places, 10406/10406 transitions.
Stuttering acceptance computed with spot in 323 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p1), (NOT p2)]
Running random walk in product with property : Railroad-PT-100-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR p2 (AND p0 p1)), acceptance={} source=2 dest: 2}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(AND (EQ s149 1) (EQ s252 1) (EQ s569 1)), p0:(AND (EQ s149 1) (EQ s252 1) (EQ s569 1)), p1:(AND (EQ s188 1) (EQ s251 1) (EQ s569 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]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Railroad-PT-100-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Railroad-PT-100-LTLFireability-01 finished in 4385 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)&&(X(G(p1))||(F(p3)&&p2)))))'
Support contains 7 out of 615 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 615/615 places, 10406/10406 transitions.
Applied a total of 0 rules in 59 ms. Remains 615 /615 variables (removed 0) and now considering 10406/10406 (removed 0) transitions.
// Phase 1: matrix 10406 rows 615 cols
[2023-03-18 08:30:52] [INFO ] Invariants computation overflowed in 19 ms
[2023-03-18 08:30:53] [INFO ] Implicit Places using invariants in 858 ms returned []
Implicit Place search using SMT only with invariants took 859 ms to find 0 implicit places.
// Phase 1: matrix 10406 rows 615 cols
[2023-03-18 08:30:53] [INFO ] Invariants computation overflowed in 12 ms
[2023-03-18 08:30:56] [INFO ] Dead Transitions using invariants and state equation in 2755 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3676 ms. Remains : 615/615 places, 10406/10406 transitions.
Stuttering acceptance computed with spot in 289 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))), (NOT p0), (NOT p1), (AND (NOT p3) (NOT p1)), true, (NOT p3)]
Running random walk in product with property : Railroad-PT-100-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p3)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p3) p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p3), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s116 1) (EQ s268 1) (EQ s569 1)), p2:(AND (EQ s116 1) (EQ s268 1) (EQ s569 1)), p3:(AND (EQ s145 1) (EQ s258 1) (EQ s569 1)), p1:(AND (EQ s155...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Railroad-PT-100-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Railroad-PT-100-LTLFireability-02 finished in 4038 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||G(p1)))&&F(p2)))'
Support contains 7 out of 615 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 615/615 places, 10406/10406 transitions.
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 97
Deduced a syphon composed of 97 places in 27 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 0 with 194 rules applied. Total rules applied 194 place count 518 transition count 10309
Applied a total of 194 rules in 6565 ms. Remains 518 /615 variables (removed 97) and now considering 10309/10406 (removed 97) transitions.
// Phase 1: matrix 10309 rows 518 cols
[2023-03-18 08:31:03] [INFO ] Invariants computation overflowed in 20 ms
[2023-03-18 08:31:04] [INFO ] Implicit Places using invariants in 817 ms returned []
Implicit Place search using SMT only with invariants took 819 ms to find 0 implicit places.
// Phase 1: matrix 10309 rows 518 cols
[2023-03-18 08:31:04] [INFO ] Invariants computation overflowed in 14 ms
[2023-03-18 08:31:06] [INFO ] Dead Transitions using invariants and state equation in 2682 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 518/615 places, 10309/10406 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10074 ms. Remains : 518/615 places, 10309/10406 transitions.
Stuttering acceptance computed with spot in 190 ms :[true, (OR (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0)), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : Railroad-PT-100-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p2), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=4 dest: 2}, { cond=(AND p0 p2), acceptance={0} source=4 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=4, aps=[p1:(OR (EQ s144 0) (EQ s246 0) (EQ s493 0)), p2:(AND (EQ s169 1) (EQ s204 1) (EQ s493 1)), p0:(AND (EQ s116 1) (EQ s287 1) (EQ s493 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 3566 steps with 0 reset in 103 ms.
FORMULA Railroad-PT-100-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Railroad-PT-100-LTLFireability-03 finished in 10430 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(F(p0))&&F((p1&&X((p1 U (G(p1)||(!p2&&X(!p3))))))))))'
Support contains 9 out of 615 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 615/615 places, 10406/10406 transitions.
Applied a total of 0 rules in 55 ms. Remains 615 /615 variables (removed 0) and now considering 10406/10406 (removed 0) transitions.
// Phase 1: matrix 10406 rows 615 cols
[2023-03-18 08:31:07] [INFO ] Invariants computation overflowed in 20 ms
[2023-03-18 08:31:08] [INFO ] Implicit Places using invariants in 864 ms returned []
Implicit Place search using SMT only with invariants took 868 ms to find 0 implicit places.
// Phase 1: matrix 10406 rows 615 cols
[2023-03-18 08:31:08] [INFO ] Invariants computation overflowed in 16 ms
[2023-03-18 08:31:11] [INFO ] Dead Transitions using invariants and state equation in 2858 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3785 ms. Remains : 615/615 places, 10406/10406 transitions.
Stuttering acceptance computed with spot in 373 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1), (OR (AND (NOT p1) p3) (AND (NOT p1) p2)), (AND (NOT p1) p3), (AND (NOT p1) p3)]
Running random walk in product with property : Railroad-PT-100-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}, { cond=p1, acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}, { cond=p1, acceptance={0} source=4 dest: 5}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=5 dest: 4}, { cond=(AND p1 p2), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 6}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p1) p3), acceptance={0} source=6 dest: 4}, { cond=(AND p1 p3), acceptance={0} source=6 dest: 5}], [{ cond=(AND (NOT p1) p2 p3), acceptance={0} source=7 dest: 4}, { cond=(AND p1 p2 p3), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p1) (NOT p2) p3), acceptance={0} source=7 dest: 6}, { cond=(AND p1 (NOT p2) p3), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(AND (EQ s199 1) (EQ s303 1) (EQ s569 1)), p1:(OR (NEQ s193 1) (NEQ s277 1) (NEQ s569 1)), p2:(AND (EQ s190 1) (EQ s244 1) (EQ s569 1)), p3:(AND (EQ s1...], 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 2 reset in 2434 ms.
Product exploration explored 100000 steps with 0 reset in 2645 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2) (NOT p3)), (X p1), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p2)))), true, (X (X p1)), (X (X (NOT (AND p1 p2)))), (X (X (NOT p0))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 479 ms. Reduced automaton from 8 states, 20 edges and 4 AP (stutter sensitive) to 8 states, 19 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 326 ms :[(OR (NOT p0) (AND (NOT p1) p3) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2) (AND (NOT p1) p3)), (NOT p0), (NOT p0), (NOT p1), (OR (AND (NOT p1) p3) (AND (NOT p1) p2)), (AND (NOT p1) p3), (AND (NOT p1) p3)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 560 ms. (steps per millisecond=17 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 10406 rows 615 cols
[2023-03-18 08:31:18] [INFO ] Invariants computation overflowed in 19 ms
[2023-03-18 08:31:27] [INFO ] After 9107ms SMT Verify possible using all constraints in real domain returned unsat :5 sat :0 real:5
[2023-03-18 08:31:34] [INFO ] After 6944ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :5
[2023-03-18 08:31:37] [INFO ] After 9318ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :5
Attempting to minimize the solution found.
Minimization took 1689 ms.
[2023-03-18 08:31:38] [INFO ] After 11189ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :5
Fused 10 Parikh solutions to 5 different solutions.
Parikh walk visited 3 properties in 317 ms.
Support contains 7 out of 615 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 10406/10406 transitions.
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 97
Deduced a syphon composed of 97 places in 26 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 0 with 194 rules applied. Total rules applied 194 place count 518 transition count 10309
Applied a total of 194 rules in 6361 ms. Remains 518 /615 variables (removed 97) and now considering 10309/10406 (removed 97) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6361 ms. Remains : 518/615 places, 10309/10406 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 372 ms. (steps per millisecond=26 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 163368 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :{}
Probabilistic random walk after 163368 steps, saw 158115 distinct states, run finished after 3002 ms. (steps per millisecond=54 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 10309 rows 518 cols
[2023-03-18 08:31:49] [INFO ] Invariants computation overflowed in 19 ms
[2023-03-18 08:31:49] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 08:31:51] [INFO ] After 2329ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 08:31:52] [INFO ] After 3142ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 454 ms.
[2023-03-18 08:31:52] [INFO ] After 3709ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 75 ms.
Support contains 7 out of 518 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 518/518 places, 10309/10309 transitions.
Applied a total of 0 rules in 5792 ms. Remains 518 /518 variables (removed 0) and now considering 10309/10309 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5792 ms. Remains : 518/518 places, 10309/10309 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 518/518 places, 10309/10309 transitions.
Applied a total of 0 rules in 5783 ms. Remains 518 /518 variables (removed 0) and now considering 10309/10309 (removed 0) transitions.
// Phase 1: matrix 10309 rows 518 cols
[2023-03-18 08:32:04] [INFO ] Invariants computation overflowed in 17 ms
[2023-03-18 08:32:05] [INFO ] Implicit Places using invariants in 844 ms returned []
Implicit Place search using SMT only with invariants took 844 ms to find 0 implicit places.
// Phase 1: matrix 10309 rows 518 cols
[2023-03-18 08:32:05] [INFO ] Invariants computation overflowed in 12 ms
[2023-03-18 08:32:08] [INFO ] Dead Transitions using invariants and state equation in 2984 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9620 ms. Remains : 518/518 places, 10309/10309 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 518 transition count 10306
Deduced a syphon composed of 3 places in 25 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 515 transition count 10306
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 97
Deduced a syphon composed of 97 places in 26 ms
Reduce places removed 194 places and 0 transitions.
Iterating global reduction 0 with 291 rules applied. Total rules applied 297 place count 321 transition count 10209
Applied a total of 297 rules in 261 ms. Remains 321 /518 variables (removed 197) and now considering 10209/10309 (removed 100) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 10209 rows 321 cols
[2023-03-18 08:32:08] [INFO ] Invariants computation overflowed in 17 ms
[2023-03-18 08:32:08] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 08:32:11] [INFO ] After 2255ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 08:32:12] [INFO ] After 3051ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 444 ms.
[2023-03-18 08:32:12] [INFO ] After 3579ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Found 5 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2) (NOT p3)), (X p1), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p2)))), true, (X (X p1)), (X (X (NOT (AND p1 p2)))), (X (X (NOT p0))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (G (NOT (AND p3 (NOT p1)))), (G (NOT (AND (NOT p1) p2))), (G (NOT (AND p3 (NOT p1) p2))), (G (NOT (AND p3 (NOT p1) (NOT p2)))), (G (NOT (AND p3 p1 p2)))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2))), (F (AND p1 p2)), (F (NOT (AND p1 (NOT p2)))), (F p0), (F (NOT p1))]
Knowledge based reduction with 15 factoid took 1224 ms. Reduced automaton from 8 states, 19 edges and 4 AP (stutter sensitive) to 6 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 262 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 255 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (NOT p1), (NOT p1)]
// Phase 1: matrix 10406 rows 615 cols
[2023-03-18 08:32:14] [INFO ] Invariants computation overflowed in 14 ms
[2023-03-18 08:32:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 08:32:21] [INFO ] [Real]Absence check using state equation in 2694 ms returned sat
[2023-03-18 08:32:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 08:32:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 08:32:28] [INFO ] [Nat]Absence check using state equation in 2730 ms returned sat
[2023-03-18 08:32:30] [INFO ] Deduced a trap composed of 3 places in 1233 ms of which 11 ms to minimize.
[2023-03-18 08:32:31] [INFO ] Deduced a trap composed of 6 places in 757 ms of which 0 ms to minimize.
[2023-03-18 08:32:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 2746 ms
Proved EG (AND (NOT p0) (NOT p3))
// Phase 1: matrix 10406 rows 615 cols
[2023-03-18 08:32:31] [INFO ] Invariants computation overflowed in 17 ms
[2023-03-18 08:32:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 08:32:38] [INFO ] [Real]Absence check using state equation in 2802 ms returned sat
[2023-03-18 08:32:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 08:32:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 08:32:46] [INFO ] [Nat]Absence check using state equation in 2731 ms returned sat
[2023-03-18 08:32:47] [INFO ] Deduced a trap composed of 6 places in 1174 ms of which 0 ms to minimize.
[2023-03-18 08:32:49] [INFO ] Deduced a trap composed of 3 places in 1442 ms of which 1 ms to minimize.
[2023-03-18 08:32:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 3224 ms
Proved EG (AND (NOT p0) (NOT p2))
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2) (NOT p3)), (X p1), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p2)))), true, (X (X p1)), (X (X (NOT (AND p1 p2)))), (X (X (NOT p0))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (G (NOT (AND p3 (NOT p1)))), (G (NOT (AND (NOT p1) p2))), (G (NOT (AND p3 (NOT p1) p2))), (G (NOT (AND p3 (NOT p1) (NOT p2)))), (G (NOT (AND p3 p1 p2)))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2))), (F (AND p1 p2)), (F (NOT (AND p1 (NOT p2)))), (F p0), (F (NOT p1)), (G (AND (NOT p0) (NOT p3))), (G (AND (NOT p0) (NOT p2)))]
Property proved to be false thanks to negative knowledge :(G (AND (NOT p0) (NOT p3)))
Knowledge based reduction with 15 factoid took 398 ms. Reduced automaton from 6 states, 10 edges and 4 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Railroad-PT-100-LTLFireability-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Railroad-PT-100-LTLFireability-05 finished in 102551 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))'
Support contains 3 out of 615 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 615/615 places, 10406/10406 transitions.
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 25 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 0 with 198 rules applied. Total rules applied 198 place count 516 transition count 10307
Applied a total of 198 rules in 5879 ms. Remains 516 /615 variables (removed 99) and now considering 10307/10406 (removed 99) transitions.
// Phase 1: matrix 10307 rows 516 cols
[2023-03-18 08:32:55] [INFO ] Invariants computation overflowed in 20 ms
[2023-03-18 08:32:56] [INFO ] Implicit Places using invariants in 856 ms returned []
Implicit Place search using SMT only with invariants took 883 ms to find 0 implicit places.
// Phase 1: matrix 10307 rows 516 cols
[2023-03-18 08:32:56] [INFO ] Invariants computation overflowed in 11 ms
[2023-03-18 08:32:59] [INFO ] Dead Transitions using invariants and state equation in 3169 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 516/615 places, 10307/10406 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9944 ms. Remains : 516/615 places, 10307/10406 transitions.
Stuttering acceptance computed with spot in 53 ms :[true, p0]
Running random walk in product with property : Railroad-PT-100-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (EQ s130 1) (EQ s233 1) (EQ s491 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 681 steps with 0 reset in 20 ms.
FORMULA Railroad-PT-100-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Railroad-PT-100-LTLFireability-06 finished in 10082 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)))'
Support contains 3 out of 615 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 615/615 places, 10406/10406 transitions.
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 26 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 0 with 198 rules applied. Total rules applied 198 place count 516 transition count 10307
Applied a total of 198 rules in 5928 ms. Remains 516 /615 variables (removed 99) and now considering 10307/10406 (removed 99) transitions.
// Phase 1: matrix 10307 rows 516 cols
[2023-03-18 08:33:05] [INFO ] Invariants computation overflowed in 19 ms
[2023-03-18 08:33:06] [INFO ] Implicit Places using invariants in 861 ms returned []
Implicit Place search using SMT only with invariants took 862 ms to find 0 implicit places.
// Phase 1: matrix 10307 rows 516 cols
[2023-03-18 08:33:06] [INFO ] Invariants computation overflowed in 11 ms
[2023-03-18 08:33:09] [INFO ] Dead Transitions using invariants and state equation in 3177 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 516/615 places, 10307/10406 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9986 ms. Remains : 516/615 places, 10307/10406 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : Railroad-PT-100-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s175 1) (EQ s207 1) (EQ s492 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 2620 ms.
Stack based approach found an accepted trace after 17647 steps with 0 reset with depth 17648 and stack size 16377 in 497 ms.
FORMULA Railroad-PT-100-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-100-LTLFireability-10 finished in 13213 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)))'
Support contains 3 out of 615 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 615/615 places, 10406/10406 transitions.
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 25 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 0 with 198 rules applied. Total rules applied 198 place count 516 transition count 10307
Applied a total of 198 rules in 5967 ms. Remains 516 /615 variables (removed 99) and now considering 10307/10406 (removed 99) transitions.
// Phase 1: matrix 10307 rows 516 cols
[2023-03-18 08:33:19] [INFO ] Invariants computation overflowed in 18 ms
[2023-03-18 08:33:19] [INFO ] Implicit Places using invariants in 858 ms returned []
Implicit Place search using SMT only with invariants took 859 ms to find 0 implicit places.
// Phase 1: matrix 10307 rows 516 cols
[2023-03-18 08:33:19] [INFO ] Invariants computation overflowed in 12 ms
[2023-03-18 08:33:22] [INFO ] Dead Transitions using invariants and state equation in 3103 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 516/615 places, 10307/10406 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9930 ms. Remains : 516/615 places, 10307/10406 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : Railroad-PT-100-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s123 0) (EQ s264 0) (EQ s492 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 2630 ms.
Product exploration explored 100000 steps with 0 reset in 2827 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 273 ms. (steps per millisecond=36 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Finished probabilistic random walk after 27209 steps, run visited all 1 properties in 292 ms. (steps per millisecond=93 )
Probabilistic random walk after 27209 steps, saw 26501 distinct states, run finished after 293 ms. (steps per millisecond=92 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Support contains 3 out of 516 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 516/516 places, 10307/10307 transitions.
Applied a total of 0 rules in 5822 ms. Remains 516 /516 variables (removed 0) and now considering 10307/10307 (removed 0) transitions.
// Phase 1: matrix 10307 rows 516 cols
[2023-03-18 08:33:35] [INFO ] Invariants computation overflowed in 20 ms
[2023-03-18 08:33:36] [INFO ] Implicit Places using invariants in 863 ms returned []
Implicit Place search using SMT only with invariants took 879 ms to find 0 implicit places.
// Phase 1: matrix 10307 rows 516 cols
[2023-03-18 08:33:36] [INFO ] Invariants computation overflowed in 36 ms
[2023-03-18 08:33:39] [INFO ] Dead Transitions using invariants and state equation in 3065 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9781 ms. Remains : 516/516 places, 10307/10307 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 134 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 276 ms. (steps per millisecond=36 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Finished probabilistic random walk after 27209 steps, run visited all 1 properties in 292 ms. (steps per millisecond=93 )
Probabilistic random walk after 27209 steps, saw 26501 distinct states, run finished after 294 ms. (steps per millisecond=92 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 124 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 2636 ms.
Product exploration explored 100000 steps with 0 reset in 2770 ms.
Support contains 3 out of 516 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 516/516 places, 10307/10307 transitions.
Applied a total of 0 rules in 5831 ms. Remains 516 /516 variables (removed 0) and now considering 10307/10307 (removed 0) transitions.
// Phase 1: matrix 10307 rows 516 cols
[2023-03-18 08:33:51] [INFO ] Invariants computation overflowed in 22 ms
[2023-03-18 08:33:52] [INFO ] Implicit Places using invariants in 855 ms returned []
Implicit Place search using SMT only with invariants took 856 ms to find 0 implicit places.
// Phase 1: matrix 10307 rows 516 cols
[2023-03-18 08:33:52] [INFO ] Invariants computation overflowed in 11 ms
[2023-03-18 08:33:55] [INFO ] Dead Transitions using invariants and state equation in 3054 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9746 ms. Remains : 516/516 places, 10307/10307 transitions.
Treatment of property Railroad-PT-100-LTLFireability-11 finished in 43043 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)||X(G(p1)))))'
Support contains 5 out of 615 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 615/615 places, 10406/10406 transitions.
Applied a total of 0 rules in 50 ms. Remains 615 /615 variables (removed 0) and now considering 10406/10406 (removed 0) transitions.
// Phase 1: matrix 10406 rows 615 cols
[2023-03-18 08:33:56] [INFO ] Invariants computation overflowed in 16 ms
[2023-03-18 08:33:56] [INFO ] Implicit Places using invariants in 839 ms returned []
Implicit Place search using SMT only with invariants took 853 ms to find 0 implicit places.
// Phase 1: matrix 10406 rows 615 cols
[2023-03-18 08:33:57] [INFO ] Invariants computation overflowed in 12 ms
[2023-03-18 08:34:00] [INFO ] Dead Transitions using invariants and state equation in 3133 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4051 ms. Remains : 615/615 places, 10406/10406 transitions.
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : Railroad-PT-100-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s169 1) (EQ s286 1) (EQ s569 1)), p1:(AND (EQ s134 1) (EQ s288 1) (EQ s569 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 2259 ms.
Product exploration explored 100000 steps with 0 reset in 2395 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 297 ms. (steps per millisecond=33 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 261094 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :{1=1}
Probabilistic random walk after 261094 steps, saw 252642 distinct states, run finished after 3003 ms. (steps per millisecond=86 ) properties seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 10406 rows 615 cols
[2023-03-18 08:34:08] [INFO ] Invariants computation overflowed in 21 ms
[2023-03-18 08:34:15] [INFO ] After 6813ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 08:34:22] [INFO ] After 6366ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 08:34:22] [INFO ] After 6749ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 206 ms.
[2023-03-18 08:34:22] [INFO ] After 7080ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 61 ms.
Support contains 3 out of 615 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 10406/10406 transitions.
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 25 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 0 with 198 rules applied. Total rules applied 198 place count 516 transition count 10307
Applied a total of 198 rules in 5748 ms. Remains 516 /615 variables (removed 99) and now considering 10307/10406 (removed 99) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5748 ms. Remains : 516/615 places, 10307/10406 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 275 ms. (steps per millisecond=36 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 251015 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :{}
Probabilistic random walk after 251015 steps, saw 242306 distinct states, run finished after 3002 ms. (steps per millisecond=83 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 10307 rows 516 cols
[2023-03-18 08:34:31] [INFO ] Invariants computation overflowed in 19 ms
[2023-03-18 08:34:34] [INFO ] After 2333ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 08:34:36] [INFO ] After 2174ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 08:34:36] [INFO ] After 2607ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 200 ms.
[2023-03-18 08:34:37] [INFO ] After 2907ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 253 steps, including 2 resets, run visited all 1 properties in 12 ms. (steps per millisecond=21 )
Parikh walk visited 1 properties in 12 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 3 factoid took 155 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
// Phase 1: matrix 10406 rows 615 cols
[2023-03-18 08:34:37] [INFO ] Invariants computation overflowed in 19 ms
[2023-03-18 08:34:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 08:34:44] [INFO ] [Real]Absence check using state equation in 2628 ms returned sat
[2023-03-18 08:34:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 08:34:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 08:34:53] [INFO ] [Nat]Absence check using state equation in 4120 ms returned sat
[2023-03-18 08:34:54] [INFO ] Deduced a trap composed of 3 places in 1126 ms of which 0 ms to minimize.
[2023-03-18 08:34:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1605 ms
[2023-03-18 08:34:56] [INFO ] Computed and/alt/rep : 304/409/304 causal constraints (skipped 10002 transitions) in 1043 ms.
[2023-03-18 08:35:01] [INFO ] Deduced a trap composed of 3 places in 1346 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 08:35:01] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (AND (NOT p0) (NOT p1))
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 5 out of 615 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 615/615 places, 10406/10406 transitions.
Applied a total of 0 rules in 53 ms. Remains 615 /615 variables (removed 0) and now considering 10406/10406 (removed 0) transitions.
// Phase 1: matrix 10406 rows 615 cols
[2023-03-18 08:35:01] [INFO ] Invariants computation overflowed in 17 ms
[2023-03-18 08:35:02] [INFO ] Implicit Places using invariants in 858 ms returned []
Implicit Place search using SMT only with invariants took 867 ms to find 0 implicit places.
// Phase 1: matrix 10406 rows 615 cols
[2023-03-18 08:35:02] [INFO ] Invariants computation overflowed in 19 ms
[2023-03-18 08:35:05] [INFO ] Dead Transitions using invariants and state equation in 3193 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4128 ms. Remains : 615/615 places, 10406/10406 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 128 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 327 ms. (steps per millisecond=30 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 248636 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :{1=1}
Probabilistic random walk after 248636 steps, saw 240638 distinct states, run finished after 3002 ms. (steps per millisecond=82 ) properties seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 10406 rows 615 cols
[2023-03-18 08:35:09] [INFO ] Invariants computation overflowed in 21 ms
[2023-03-18 08:35:16] [INFO ] After 6847ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 08:35:22] [INFO ] After 6260ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 08:35:22] [INFO ] After 6647ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 246 ms.
[2023-03-18 08:35:23] [INFO ] After 7086ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 46 ms.
Support contains 3 out of 615 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 10406/10406 transitions.
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 25 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 0 with 198 rules applied. Total rules applied 198 place count 516 transition count 10307
Applied a total of 198 rules in 5782 ms. Remains 516 /615 variables (removed 99) and now considering 10307/10406 (removed 99) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5783 ms. Remains : 516/615 places, 10307/10406 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 308 ms. (steps per millisecond=32 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 236936 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :{}
Probabilistic random walk after 236936 steps, saw 228776 distinct states, run finished after 3001 ms. (steps per millisecond=78 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 10307 rows 516 cols
[2023-03-18 08:35:32] [INFO ] Invariants computation overflowed in 19 ms
[2023-03-18 08:35:34] [INFO ] After 2372ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 08:35:37] [INFO ] After 2235ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 08:35:37] [INFO ] After 2654ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 201 ms.
[2023-03-18 08:35:37] [INFO ] After 2965ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 249 steps, including 2 resets, run visited all 1 properties in 10 ms. (steps per millisecond=24 )
Parikh walk visited 1 properties in 11 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 3 factoid took 174 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
// Phase 1: matrix 10406 rows 615 cols
[2023-03-18 08:35:38] [INFO ] Invariants computation overflowed in 14 ms
[2023-03-18 08:35:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 08:35:45] [INFO ] [Real]Absence check using state equation in 2688 ms returned sat
[2023-03-18 08:35:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 08:35:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 08:35:54] [INFO ] [Nat]Absence check using state equation in 4276 ms returned sat
[2023-03-18 08:35:55] [INFO ] Deduced a trap composed of 3 places in 1131 ms of which 1 ms to minimize.
[2023-03-18 08:35:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1598 ms
[2023-03-18 08:35:56] [INFO ] Computed and/alt/rep : 304/409/304 causal constraints (skipped 10002 transitions) in 1055 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 08:36:00] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (AND (NOT p0) (NOT p1))
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 2213 ms.
Product exploration explored 100000 steps with 0 reset in 2372 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 5 out of 615 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 615/615 places, 10406/10406 transitions.
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 98 places in 25 ms
Iterating global reduction 0 with 98 rules applied. Total rules applied 98 place count 615 transition count 10406
Deduced a syphon composed of 98 places in 26 ms
Applied a total of 98 rules in 6169 ms. Remains 615 /615 variables (removed 0) and now considering 10406/10406 (removed 0) transitions.
// Phase 1: matrix 10406 rows 615 cols
[2023-03-18 08:36:11] [INFO ] Invariants computation overflowed in 17 ms
[2023-03-18 08:36:14] [INFO ] Dead Transitions using invariants and state equation in 2886 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 615/615 places, 10406/10406 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9059 ms. Remains : 615/615 places, 10406/10406 transitions.
Support contains 5 out of 615 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 615/615 places, 10406/10406 transitions.
Applied a total of 0 rules in 51 ms. Remains 615 /615 variables (removed 0) and now considering 10406/10406 (removed 0) transitions.
// Phase 1: matrix 10406 rows 615 cols
[2023-03-18 08:36:14] [INFO ] Invariants computation overflowed in 17 ms
[2023-03-18 08:36:15] [INFO ] Implicit Places using invariants in 935 ms returned []
Implicit Place search using SMT only with invariants took 935 ms to find 0 implicit places.
// Phase 1: matrix 10406 rows 615 cols
[2023-03-18 08:36:15] [INFO ] Invariants computation overflowed in 13 ms
[2023-03-18 08:36:18] [INFO ] Dead Transitions using invariants and state equation in 3019 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4006 ms. Remains : 615/615 places, 10406/10406 transitions.
Treatment of property Railroad-PT-100-LTLFireability-12 finished in 142851 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' '!((p0 U (G(p2)||p1)))'
Support contains 9 out of 615 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 615/615 places, 10406/10406 transitions.
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Deduced a syphon composed of 96 places in 26 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 0 with 192 rules applied. Total rules applied 192 place count 519 transition count 10310
Applied a total of 192 rules in 6344 ms. Remains 519 /615 variables (removed 96) and now considering 10310/10406 (removed 96) transitions.
// Phase 1: matrix 10310 rows 519 cols
[2023-03-18 08:36:25] [INFO ] Invariants computation overflowed in 19 ms
[2023-03-18 08:36:26] [INFO ] Implicit Places using invariants in 859 ms returned []
Implicit Place search using SMT only with invariants took 860 ms to find 0 implicit places.
// Phase 1: matrix 10310 rows 519 cols
[2023-03-18 08:36:26] [INFO ] Invariants computation overflowed in 11 ms
[2023-03-18 08:36:29] [INFO ] Dead Transitions using invariants and state equation in 2878 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 519/615 places, 10310/10406 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10094 ms. Remains : 519/615 places, 10310/10406 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : Railroad-PT-100-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p2 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (EQ s141 1) (EQ s280 1) (EQ s494 1)) (AND (EQ s171 1) (EQ s243 1) (EQ s494 1)) (AND (EQ s178 1) (EQ s286 1) (EQ s494 1))), p2:(OR (NOT (AND (E...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 1791 steps with 0 reset in 49 ms.
FORMULA Railroad-PT-100-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Railroad-PT-100-LTLFireability-13 finished in 10293 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 615 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 615/615 places, 10406/10406 transitions.
Applied a total of 0 rules in 51 ms. Remains 615 /615 variables (removed 0) and now considering 10406/10406 (removed 0) transitions.
// Phase 1: matrix 10406 rows 615 cols
[2023-03-18 08:36:29] [INFO ] Invariants computation overflowed in 17 ms
[2023-03-18 08:36:30] [INFO ] Implicit Places using invariants in 841 ms returned []
Implicit Place search using SMT only with invariants took 853 ms to find 0 implicit places.
// Phase 1: matrix 10406 rows 615 cols
[2023-03-18 08:36:30] [INFO ] Invariants computation overflowed in 12 ms
[2023-03-18 08:36:33] [INFO ] Dead Transitions using invariants and state equation in 3049 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3955 ms. Remains : 615/615 places, 10406/10406 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Railroad-PT-100-LTLFireability-14 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 s203 1) (EQ s286 1) (EQ s569 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 0 reset in 2559 ms.
Product exploration explored 100000 steps with 0 reset in 2412 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 (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 83 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 261 ms. (steps per millisecond=38 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 259066 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :{}
Probabilistic random walk after 259066 steps, saw 250679 distinct states, run finished after 3002 ms. (steps per millisecond=86 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 10406 rows 615 cols
[2023-03-18 08:36:41] [INFO ] Invariants computation overflowed in 18 ms
[2023-03-18 08:36:48] [INFO ] After 6676ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 08:36:55] [INFO ] After 6440ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 08:36:55] [INFO ] After 6849ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 207 ms.
[2023-03-18 08:36:55] [INFO ] After 7175ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 46 ms.
Support contains 3 out of 615 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 10406/10406 transitions.
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 25 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 0 with 198 rules applied. Total rules applied 198 place count 516 transition count 10307
Applied a total of 198 rules in 5751 ms. Remains 516 /615 variables (removed 99) and now considering 10307/10406 (removed 99) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5752 ms. Remains : 516/615 places, 10307/10406 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 273 ms. (steps per millisecond=36 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 253767 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :{}
Probabilistic random walk after 253767 steps, saw 245059 distinct states, run finished after 3001 ms. (steps per millisecond=84 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 10307 rows 516 cols
[2023-03-18 08:37:05] [INFO ] Invariants computation overflowed in 30 ms
[2023-03-18 08:37:07] [INFO ] After 2841ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 08:37:10] [INFO ] After 2433ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 08:37:10] [INFO ] After 2823ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 199 ms.
[2023-03-18 08:37:10] [INFO ] After 3133ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 141 steps, including 2 resets, run visited all 1 properties in 8 ms. (steps per millisecond=17 )
Parikh walk visited 1 properties in 8 ms.
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 148 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 10406 rows 615 cols
[2023-03-18 08:37:11] [INFO ] Invariants computation overflowed in 20 ms
[2023-03-18 08:37:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 08:37:18] [INFO ] [Real]Absence check using state equation in 2616 ms returned sat
[2023-03-18 08:37:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 08:37:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 08:37:27] [INFO ] [Nat]Absence check using state equation in 4650 ms returned sat
[2023-03-18 08:37:29] [INFO ] Deduced a trap composed of 7 places in 1078 ms of which 1 ms to minimize.
[2023-03-18 08:37:31] [INFO ] Deduced a trap composed of 3 places in 1107 ms of which 1 ms to minimize.
[2023-03-18 08:37:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 3660 ms
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 2 factoid took 71 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Railroad-PT-100-LTLFireability-14 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Railroad-PT-100-LTLFireability-14 finished in 62310 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F((G(F(p1))||G(p0))))))'
Support contains 5 out of 615 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 615/615 places, 10406/10406 transitions.
Applied a total of 0 rules in 55 ms. Remains 615 /615 variables (removed 0) and now considering 10406/10406 (removed 0) transitions.
// Phase 1: matrix 10406 rows 615 cols
[2023-03-18 08:37:31] [INFO ] Invariants computation overflowed in 19 ms
[2023-03-18 08:37:32] [INFO ] Implicit Places using invariants in 857 ms returned []
Implicit Place search using SMT only with invariants took 858 ms to find 0 implicit places.
// Phase 1: matrix 10406 rows 615 cols
[2023-03-18 08:37:32] [INFO ] Invariants computation overflowed in 21 ms
[2023-03-18 08:37:35] [INFO ] Dead Transitions using invariants and state equation in 3001 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3919 ms. Remains : 615/615 places, 10406/10406 transitions.
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Railroad-PT-100-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p0:(AND (EQ s137 1) (EQ s300 1) (EQ s569 1)), p1:(AND (EQ s176 1) (EQ s286 1) (EQ s569 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 2272 ms.
Product exploration explored 100000 steps with 0 reset in 2531 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 252 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 346 ms. (steps per millisecond=28 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 176551 steps, run timeout after 3002 ms. (steps per millisecond=58 ) properties seen :{}
Probabilistic random walk after 176551 steps, saw 171080 distinct states, run finished after 3002 ms. (steps per millisecond=58 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 10406 rows 615 cols
[2023-03-18 08:37:44] [INFO ] Invariants computation overflowed in 19 ms
[2023-03-18 08:37:44] [INFO ] After 135ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 08:37:51] [INFO ] After 7163ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 08:37:53] [INFO ] After 8617ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1147 ms.
[2023-03-18 08:37:54] [INFO ] After 9920ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 275 steps, including 0 resets, run visited all 2 properties in 12 ms. (steps per millisecond=22 )
Parikh walk visited 2 properties in 12 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 6 factoid took 276 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 10406 rows 615 cols
[2023-03-18 08:37:55] [INFO ] Invariants computation overflowed in 19 ms
[2023-03-18 08:37:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 08:38:02] [INFO ] [Real]Absence check using state equation in 2764 ms returned sat
[2023-03-18 08:38:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 08:38:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 08:38:09] [INFO ] [Nat]Absence check using state equation in 2727 ms returned sat
[2023-03-18 08:38:10] [INFO ] Deduced a trap composed of 6 places in 981 ms of which 0 ms to minimize.
[2023-03-18 08:38:11] [INFO ] Deduced a trap composed of 3 places in 799 ms of which 1 ms to minimize.
[2023-03-18 08:38:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 2366 ms
Proved EG (AND (NOT p0) (NOT p1))
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1))), (G (AND (NOT p0) (NOT p1)))]
Property proved to be false thanks to negative knowledge :(G (AND (NOT p0) (NOT p1)))
Knowledge based reduction with 6 factoid took 150 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Railroad-PT-100-LTLFireability-15 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Railroad-PT-100-LTLFireability-15 finished in 40623 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)))'
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)||X(G(p1)))))'
Found a Lengthening insensitive property : Railroad-PT-100-LTLFireability-12
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 5 out of 615 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 615/615 places, 10406/10406 transitions.
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 28 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 0 with 196 rules applied. Total rules applied 196 place count 517 transition count 10308
Applied a total of 196 rules in 169 ms. Remains 517 /615 variables (removed 98) and now considering 10308/10406 (removed 98) transitions.
// Phase 1: matrix 10308 rows 517 cols
[2023-03-18 08:38:12] [INFO ] Invariants computation overflowed in 17 ms
[2023-03-18 08:38:13] [INFO ] Implicit Places using invariants in 847 ms returned []
Implicit Place search using SMT only with invariants took 849 ms to find 0 implicit places.
// Phase 1: matrix 10308 rows 517 cols
[2023-03-18 08:38:13] [INFO ] Invariants computation overflowed in 13 ms
[2023-03-18 08:38:16] [INFO ] Dead Transitions using invariants and state equation in 3039 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 517/615 places, 10308/10406 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 4059 ms. Remains : 517/615 places, 10308/10406 transitions.
Running random walk in product with property : Railroad-PT-100-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s155 1) (EQ s271 1) (EQ s493 1)), p1:(AND (EQ s120 1) (EQ s273 1) (EQ s493 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 2595 ms.
Stack based approach found an accepted trace after 53517 steps with 0 reset with depth 53518 and stack size 25631 in 1470 ms.
Treatment of property Railroad-PT-100-LTLFireability-12 finished in 8361 ms.
FORMULA Railroad-PT-100-LTLFireability-12 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2023-03-18 08:38:21] [INFO ] Flatten gal took : 405 ms
[2023-03-18 08:38:21] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-18 08:38:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 615 places, 10406 transitions and 61923 arcs took 60 ms.
Total runtime 581065 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1718/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1718/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1718/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : Railroad-PT-100-LTLFireability-00
Could not compute solution for formula : Railroad-PT-100-LTLFireability-11
Could not compute solution for formula : Railroad-PT-100-LTLFireability-12

BK_STOP 1679128709758

--------------------
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-100-LTLFireability-00
ltl formula formula --ltl=/tmp/1718/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 615 places, 10406 transitions and 61923 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1718/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1718/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.560 real 0.330 user 0.410 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1718/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1718/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-100-LTLFireability-11
ltl formula formula --ltl=/tmp/1718/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 615 places, 10406 transitions and 61923 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 1.100 real 0.420 user 0.320 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1718/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1718/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1718/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1718/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name Railroad-PT-100-LTLFireability-12
ltl formula formula --ltl=/tmp/1718/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
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
pnml2lts-mc( 0/ 4): Petri net has 615 places, 10406 transitions and 61923 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 2.020 real 0.420 user 0.470 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1718/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1718/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1718/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1718/ltl_2_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

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

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-100"
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-100, 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-167889202000396"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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