Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Apr 23 07:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 23 07:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 14:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Apr 12 14:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Apr 12 14:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 12 14:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:46 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 82K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717261002048

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-010
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 16:56:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 16:56:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 16:56:43] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2024-06-01 16:56:43] [INFO ] Transformed 118 places.
[2024-06-01 16:56:43] [INFO ] Transformed 156 transitions.
[2024-06-01 16:56:43] [INFO ] Found NUPN structural information;
[2024-06-01 16:56:43] [INFO ] Parsed PT model containing 118 places and 156 transitions and 898 arcs in 172 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 10 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA Railroad-PT-010-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-010-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-010-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 146/146 transitions.
Ensure Unique test removed 11 places
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 76 transition count 146
Applied a total of 11 rules in 26 ms. Remains 76 /87 variables (removed 11) and now considering 146/146 (removed 0) transitions.
// Phase 1: matrix 146 rows 76 cols
[2024-06-01 16:56:43] [INFO ] Computed 30 invariants in 18 ms
[2024-06-01 16:56:43] [INFO ] Implicit Places using invariants in 222 ms returned [32, 33, 35, 36, 38, 42, 43, 57, 60, 64, 67, 72]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 252 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 64/87 places, 146/146 transitions.
Applied a total of 0 rules in 2 ms. Remains 64 /64 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 295 ms. Remains : 64/87 places, 146/146 transitions.
Support contains 32 out of 64 places after structural reductions.
[2024-06-01 16:56:44] [INFO ] Flatten gal took : 38 ms
[2024-06-01 16:56:44] [INFO ] Flatten gal took : 17 ms
[2024-06-01 16:56:44] [INFO ] Input system was already deterministic with 146 transitions.
Reduction of identical properties reduced properties to check from 33 to 29
RANDOM walk for 40000 steps (8 resets) in 1052 ms. (37 steps per ms) remains 1/29 properties
BEST_FIRST walk for 18636 steps (3 resets) in 29 ms. (621 steps per ms) remains 0/1 properties
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.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(p1))||X(X(F(p1)))))'
Support contains 3 out of 64 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 146/146 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 63 transition count 146
Applied a total of 1 rules in 4 ms. Remains 63 /64 variables (removed 1) and now considering 146/146 (removed 0) transitions.
// Phase 1: matrix 146 rows 63 cols
[2024-06-01 16:56:45] [INFO ] Computed 17 invariants in 5 ms
[2024-06-01 16:56:45] [INFO ] Implicit Places using invariants in 89 ms returned [32, 37, 46]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 91 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 60/64 places, 146/146 transitions.
Applied a total of 0 rules in 3 ms. Remains 60 /60 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 98 ms. Remains : 60/64 places, 146/146 transitions.
Stuttering acceptance computed with spot in 190 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : Railroad-PT-010-LTLFireability-01
Product exploration explored 100000 steps with 835 reset in 381 ms.
Stack based approach found an accepted trace after 256 steps with 3 reset with depth 13 and stack size 13 in 2 ms.
FORMULA Railroad-PT-010-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-010-LTLFireability-01 finished in 744 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 5 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 146/146 transitions.
Ensure Unique test removed 1 places
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 63 transition count 140
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 57 transition count 140
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 20 place count 53 transition count 136
Applied a total of 20 rules in 26 ms. Remains 53 /64 variables (removed 11) and now considering 136/146 (removed 10) transitions.
// Phase 1: matrix 136 rows 53 cols
[2024-06-01 16:56:45] [INFO ] Computed 17 invariants in 3 ms
[2024-06-01 16:56:45] [INFO ] Implicit Places using invariants in 88 ms returned [26, 31, 39]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 89 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 50/64 places, 136/146 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 50 transition count 134
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 48 transition count 134
Applied a total of 4 rules in 10 ms. Remains 48 /50 variables (removed 2) and now considering 134/136 (removed 2) transitions.
// Phase 1: matrix 134 rows 48 cols
[2024-06-01 16:56:45] [INFO ] Computed 14 invariants in 5 ms
[2024-06-01 16:56:45] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-01 16:56:45] [INFO ] Invariant cache hit.
[2024-06-01 16:56:45] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 48/64 places, 134/146 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 287 ms. Remains : 48/64 places, 134/146 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Railroad-PT-010-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 269 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 and stack size 9 in 0 ms.
FORMULA Railroad-PT-010-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-010-LTLFireability-03 finished in 692 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U (G(!p0)||(!p0&&(G(!p1)||F(G((p2||F(p3)))))))))'
Support contains 10 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 146/146 transitions.
Ensure Unique test removed 1 places
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 63 transition count 140
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 57 transition count 140
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 18 place count 54 transition count 137
Applied a total of 18 rules in 34 ms. Remains 54 /64 variables (removed 10) and now considering 137/146 (removed 9) transitions.
// Phase 1: matrix 137 rows 54 cols
[2024-06-01 16:56:46] [INFO ] Computed 17 invariants in 7 ms
[2024-06-01 16:56:46] [INFO ] Implicit Places using invariants in 68 ms returned [26, 31]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 70 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 52/64 places, 137/146 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 52 transition count 135
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 50 transition count 135
Applied a total of 4 rules in 8 ms. Remains 50 /52 variables (removed 2) and now considering 135/137 (removed 2) transitions.
// Phase 1: matrix 135 rows 50 cols
[2024-06-01 16:56:46] [INFO ] Computed 15 invariants in 1 ms
[2024-06-01 16:56:46] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-01 16:56:46] [INFO ] Invariant cache hit.
[2024-06-01 16:56:46] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 50/64 places, 135/146 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 251 ms. Remains : 50/64 places, 135/146 transitions.
Stuttering acceptance computed with spot in 254 ms :[p0, true, (AND p0 p1 (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) p1)]
Running random walk in product with property : Railroad-PT-010-LTLFireability-04
Product exploration explored 100000 steps with 14 reset in 262 ms.
Stack based approach found an accepted trace after 13224 steps with 1 reset with depth 7786 and stack size 6876 in 40 ms.
FORMULA Railroad-PT-010-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-010-LTLFireability-04 finished in 840 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))&&(X(F(p1))||F(p2))))'
Support contains 7 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 146/146 transitions.
Applied a total of 0 rules in 4 ms. Remains 64 /64 variables (removed 0) and now considering 146/146 (removed 0) transitions.
// Phase 1: matrix 146 rows 64 cols
[2024-06-01 16:56:47] [INFO ] Computed 18 invariants in 3 ms
[2024-06-01 16:56:47] [INFO ] Implicit Places using invariants in 60 ms returned [32, 37, 46]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 61 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 61/64 places, 146/146 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 66 ms. Remains : 61/64 places, 146/146 transitions.
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : Railroad-PT-010-LTLFireability-05
Product exploration explored 100000 steps with 3485 reset in 211 ms.
Stack based approach found an accepted trace after 678 steps with 15 reset with depth 73 and stack size 73 in 2 ms.
FORMULA Railroad-PT-010-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-010-LTLFireability-05 finished in 464 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(X(X(G(p0))))&&(X(p2)||p1)))))'
Support contains 5 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 146/146 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 63 transition count 146
Applied a total of 1 rules in 3 ms. Remains 63 /64 variables (removed 1) and now considering 146/146 (removed 0) transitions.
// Phase 1: matrix 146 rows 63 cols
[2024-06-01 16:56:47] [INFO ] Computed 17 invariants in 3 ms
[2024-06-01 16:56:47] [INFO ] Implicit Places using invariants in 72 ms returned [37, 46]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 74 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 61/64 places, 146/146 transitions.
Applied a total of 0 rules in 3 ms. Remains 61 /61 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 81 ms. Remains : 61/64 places, 146/146 transitions.
Stuttering acceptance computed with spot in 339 ms :[true, (OR (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : Railroad-PT-010-LTLFireability-07
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA Railroad-PT-010-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Railroad-PT-010-LTLFireability-07 finished in 446 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 146/146 transitions.
Ensure Unique test removed 1 places
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 63 transition count 139
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 56 transition count 139
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 22 place count 52 transition count 135
Applied a total of 22 rules in 21 ms. Remains 52 /64 variables (removed 12) and now considering 135/146 (removed 11) transitions.
// Phase 1: matrix 135 rows 52 cols
[2024-06-01 16:56:48] [INFO ] Computed 17 invariants in 3 ms
[2024-06-01 16:56:48] [INFO ] Implicit Places using invariants in 63 ms returned [25, 30, 38]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 64 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 49/64 places, 135/146 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 49 transition count 133
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 47 transition count 133
Applied a total of 4 rules in 7 ms. Remains 47 /49 variables (removed 2) and now considering 133/135 (removed 2) transitions.
// Phase 1: matrix 133 rows 47 cols
[2024-06-01 16:56:48] [INFO ] Computed 14 invariants in 1 ms
[2024-06-01 16:56:48] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-01 16:56:48] [INFO ] Invariant cache hit.
[2024-06-01 16:56:48] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 47/64 places, 133/146 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 231 ms. Remains : 47/64 places, 133/146 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Railroad-PT-010-LTLFireability-08
Product exploration explored 100000 steps with 393 reset in 278 ms.
Stack based approach found an accepted trace after 128 steps with 1 reset with depth 119 and stack size 119 in 1 ms.
FORMULA Railroad-PT-010-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-010-LTLFireability-08 finished in 600 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X((F(G(!p2))&&p1))))'
Support contains 8 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 146/146 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 63 transition count 146
Applied a total of 1 rules in 4 ms. Remains 63 /64 variables (removed 1) and now considering 146/146 (removed 0) transitions.
// Phase 1: matrix 146 rows 63 cols
[2024-06-01 16:56:48] [INFO ] Computed 17 invariants in 2 ms
[2024-06-01 16:56:48] [INFO ] Implicit Places using invariants in 64 ms returned [32, 46]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 66 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 61/64 places, 146/146 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 73 ms. Remains : 61/64 places, 146/146 transitions.
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (NOT p1) p2), (NOT p0), (AND (NOT p0) p2), p2]
Running random walk in product with property : Railroad-PT-010-LTLFireability-09
Product exploration explored 100000 steps with 17 reset in 212 ms.
Stack based approach found an accepted trace after 169 steps with 0 reset with depth 170 and stack size 170 in 0 ms.
FORMULA Railroad-PT-010-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-010-LTLFireability-09 finished in 553 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||((p1 U p2)&&X(p3))))'
Support contains 8 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 146/146 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 63 transition count 146
Applied a total of 1 rules in 1 ms. Remains 63 /64 variables (removed 1) and now considering 146/146 (removed 0) transitions.
[2024-06-01 16:56:49] [INFO ] Invariant cache hit.
[2024-06-01 16:56:49] [INFO ] Implicit Places using invariants in 60 ms returned [32, 37, 46]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 61 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 60/64 places, 146/146 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 65 ms. Remains : 60/64 places, 146/146 transitions.
Stuttering acceptance computed with spot in 245 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), true, (NOT p2)]
Running random walk in product with property : Railroad-PT-010-LTLFireability-10
Entered a terminal (fully accepting) state of product in 12 steps with 0 reset in 1 ms.
FORMULA Railroad-PT-010-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Railroad-PT-010-LTLFireability-10 finished in 337 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U (F(!p1)&&X(p2))))'
Support contains 7 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 146/146 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 63 transition count 146
Applied a total of 1 rules in 4 ms. Remains 63 /64 variables (removed 1) and now considering 146/146 (removed 0) transitions.
[2024-06-01 16:56:49] [INFO ] Invariant cache hit.
[2024-06-01 16:56:49] [INFO ] Implicit Places using invariants in 59 ms returned [32, 37, 46]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 60 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 60/64 places, 146/146 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 65 ms. Remains : 60/64 places, 146/146 transitions.
Stuttering acceptance computed with spot in 294 ms :[(OR (NOT p2) p1), p1, (NOT p2), (NOT p2), true, (NOT p0)]
Running random walk in product with property : Railroad-PT-010-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Railroad-PT-010-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Railroad-PT-010-LTLFireability-11 finished in 382 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p1)||G(p2)||p0)))'
Support contains 4 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 146/146 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 63 transition count 146
Applied a total of 1 rules in 2 ms. Remains 63 /64 variables (removed 1) and now considering 146/146 (removed 0) transitions.
[2024-06-01 16:56:50] [INFO ] Invariant cache hit.
[2024-06-01 16:56:50] [INFO ] Implicit Places using invariants in 70 ms returned [37, 46]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 71 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 61/64 places, 146/146 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 74 ms. Remains : 61/64 places, 146/146 transitions.
Stuttering acceptance computed with spot in 155 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : Railroad-PT-010-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 218 ms.
Product exploration explored 100000 steps with 0 reset in 265 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND (NOT p0) p2))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 114 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2))]
Reduction of identical properties reduced properties to check from 10 to 8
RANDOM walk for 40000 steps (8 resets) in 841 ms. (47 steps per ms) remains 3/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 257 ms. (155 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 58 ms. (678 steps per ms) remains 3/3 properties
// Phase 1: matrix 146 rows 61 cols
[2024-06-01 16:56:51] [INFO ] Computed 15 invariants in 1 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 10/14 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 20/34 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/34 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/34 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 27/61 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/61 variables, 27/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/61 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 146/207 variables, 61/137 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/207 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/207 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 137 constraints, problems are : Problem set: 0 solved, 3 unsolved in 135 ms.
Refiners :[Domain max(s): 61/61 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Problem apf3 is UNSAT
Problem apf5 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 10/14 variables, 4/8 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 10/18 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/18 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 20/34 variables, 2/20 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/34 variables, 20/40 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-06-01 16:56:51] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 5 ms to minimize.
[2024-06-01 16:56:51] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
Problem apf4 is UNSAT
After SMT solving in domain Int declared 34/207 variables, and 42 constraints, problems are : Problem set: 3 solved, 0 unsolved in 121 ms.
Refiners :[Domain max(s): 34/61 constraints, Positive P Invariants (semi-flows): 4/13 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/61 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 2/2 constraints]
After SMT, in 294ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND (NOT p0) p2))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0)), (X (X p1)), (G (OR (NOT p2) p1)), (G (OR p0 p2 (NOT p1))), (G (OR p0 p2))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p2) (NOT p1)))), (F p2), (F (NOT (AND p0 p1))), (F (NOT (OR p2 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p2)))), (F (NOT p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 24 factoid took 325 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 146/146 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 61 transition count 145
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 60 transition count 145
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 2 place count 60 transition count 135
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 22 place count 50 transition count 135
Applied a total of 22 rules in 15 ms. Remains 50 /61 variables (removed 11) and now considering 135/146 (removed 11) transitions.
// Phase 1: matrix 135 rows 50 cols
[2024-06-01 16:56:52] [INFO ] Computed 15 invariants in 1 ms
[2024-06-01 16:56:52] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-01 16:56:52] [INFO ] Invariant cache hit.
[2024-06-01 16:56:52] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
[2024-06-01 16:56:52] [INFO ] Redundant transitions in 3 ms returned []
Running 125 sub problems to find dead transitions.
[2024-06-01 16:56:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 125 unsolved
[2024-06-01 16:56:52] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 2 ms to minimize.
[2024-06-01 16:56:52] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 1 ms to minimize.
[2024-06-01 16:56:52] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-06-01 16:56:52] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (OVERLAPS) 10/50 variables, 10/59 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 10/69 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 8 (OVERLAPS) 135/185 variables, 50/119 constraints. Problems are: Problem set: 0 solved, 125 unsolved
[2024-06-01 16:56:54] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/185 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 11 (OVERLAPS) 0/185 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 120 constraints, problems are : Problem set: 0 solved, 125 unsolved in 2906 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 125 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 5/50 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (OVERLAPS) 10/50 variables, 10/60 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 10/70 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 8 (OVERLAPS) 135/185 variables, 50/120 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/185 variables, 125/245 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 11 (OVERLAPS) 0/185 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/185 variables, and 245 constraints, problems are : Problem set: 0 solved, 125 unsolved in 3867 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 5/5 constraints]
After SMT, in 6905ms problems are : Problem set: 0 solved, 125 unsolved
Search for dead transitions found 0 dead transitions in 6908ms
Starting structural reductions in SI_LTL mode, iteration 1 : 50/61 places, 135/146 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7075 ms. Remains : 50/61 places, 135/146 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 107 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (8 resets) in 151 ms. (263 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
[2024-06-01 16:56:59] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 36/40 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 36/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 9/49 variables, 9/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/49 variables, 9/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/49 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/50 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/50 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/50 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 135/185 variables, 50/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/185 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/185 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 115 constraints, problems are : Problem set: 0 solved, 1 unsolved in 78 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 36/40 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 36/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 16:56:59] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 2 ms to minimize.
Problem apf0 is UNSAT
After SMT solving in domain Int declared 40/185 variables, and 46 constraints, problems are : Problem set: 1 solved, 0 unsolved in 71 ms.
Refiners :[Domain max(s): 40/50 constraints, Positive P Invariants (semi-flows): 5/14 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/50 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 155ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 12 factoid took 277 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 249 ms.
Product exploration explored 100000 steps with 0 reset in 333 ms.
Support contains 4 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 135/135 transitions.
Applied a total of 0 rules in 5 ms. Remains 50 /50 variables (removed 0) and now considering 135/135 (removed 0) transitions.
[2024-06-01 16:57:01] [INFO ] Invariant cache hit.
[2024-06-01 16:57:01] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-01 16:57:01] [INFO ] Invariant cache hit.
[2024-06-01 16:57:01] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
[2024-06-01 16:57:01] [INFO ] Redundant transitions in 3 ms returned []
Running 125 sub problems to find dead transitions.
[2024-06-01 16:57:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 125 unsolved
[2024-06-01 16:57:01] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
[2024-06-01 16:57:01] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 1 ms to minimize.
[2024-06-01 16:57:01] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-06-01 16:57:01] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (OVERLAPS) 10/50 variables, 10/59 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 10/69 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 8 (OVERLAPS) 135/185 variables, 50/119 constraints. Problems are: Problem set: 0 solved, 125 unsolved
[2024-06-01 16:57:02] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/185 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 11 (OVERLAPS) 0/185 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 120 constraints, problems are : Problem set: 0 solved, 125 unsolved in 2867 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 125 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 5/50 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (OVERLAPS) 10/50 variables, 10/60 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 10/70 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 8 (OVERLAPS) 135/185 variables, 50/120 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/185 variables, 125/245 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 11 (OVERLAPS) 0/185 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/185 variables, and 245 constraints, problems are : Problem set: 0 solved, 125 unsolved in 3836 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 5/5 constraints]
After SMT, in 6796ms problems are : Problem set: 0 solved, 125 unsolved
Search for dead transitions found 0 dead transitions in 6798ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 6968 ms. Remains : 50/50 places, 135/135 transitions.
Treatment of property Railroad-PT-010-LTLFireability-12 finished in 18039 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((p0 U p1) U X(p2))&&F(G(p2))))'
Support contains 7 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 146/146 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 63 transition count 146
Applied a total of 1 rules in 1 ms. Remains 63 /64 variables (removed 1) and now considering 146/146 (removed 0) transitions.
// Phase 1: matrix 146 rows 63 cols
[2024-06-01 16:57:08] [INFO ] Computed 17 invariants in 2 ms
[2024-06-01 16:57:08] [INFO ] Implicit Places using invariants in 54 ms returned [32, 37, 46]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 56 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 60/64 places, 146/146 transitions.
Applied a total of 0 rules in 0 ms. Remains 60 /60 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 57 ms. Remains : 60/64 places, 146/146 transitions.
Stuttering acceptance computed with spot in 274 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p1)]
Running random walk in product with property : Railroad-PT-010-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 217 ms.
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Railroad-PT-010-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Railroad-PT-010-LTLFireability-13 finished in 569 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(p1))))'
Support contains 5 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 146/146 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 63 transition count 146
Applied a total of 1 rules in 1 ms. Remains 63 /64 variables (removed 1) and now considering 146/146 (removed 0) transitions.
[2024-06-01 16:57:08] [INFO ] Invariant cache hit.
[2024-06-01 16:57:08] [INFO ] Implicit Places using invariants in 52 ms returned [32, 37, 46]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 54 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 60/64 places, 146/146 transitions.
Applied a total of 0 rules in 0 ms. Remains 60 /60 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 56 ms. Remains : 60/64 places, 146/146 transitions.
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Railroad-PT-010-LTLFireability-14
Product exploration explored 100000 steps with 4533 reset in 189 ms.
Stack based approach found an accepted trace after 2450 steps with 122 reset with depth 13 and stack size 13 in 6 ms.
FORMULA Railroad-PT-010-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-010-LTLFireability-14 finished in 357 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 146/146 transitions.
Ensure Unique test removed 1 places
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 63 transition count 139
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 56 transition count 139
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 22 place count 52 transition count 135
Applied a total of 22 rules in 16 ms. Remains 52 /64 variables (removed 12) and now considering 135/146 (removed 11) transitions.
// Phase 1: matrix 135 rows 52 cols
[2024-06-01 16:57:08] [INFO ] Computed 17 invariants in 2 ms
[2024-06-01 16:57:09] [INFO ] Implicit Places using invariants in 66 ms returned [25, 30, 38]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 67 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 49/64 places, 135/146 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 49 transition count 133
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 47 transition count 133
Applied a total of 4 rules in 4 ms. Remains 47 /49 variables (removed 2) and now considering 133/135 (removed 2) transitions.
// Phase 1: matrix 133 rows 47 cols
[2024-06-01 16:57:09] [INFO ] Computed 14 invariants in 1 ms
[2024-06-01 16:57:09] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-06-01 16:57:09] [INFO ] Invariant cache hit.
[2024-06-01 16:57:09] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 47/64 places, 133/146 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 210 ms. Remains : 47/64 places, 133/146 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : Railroad-PT-010-LTLFireability-15
Product exploration explored 100000 steps with 91 reset in 223 ms.
Stack based approach found an accepted trace after 46 steps with 0 reset with depth 47 and stack size 47 in 1 ms.
FORMULA Railroad-PT-010-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-010-LTLFireability-15 finished in 490 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p1)||G(p2)||p0)))'
Found a Lengthening insensitive property : Railroad-PT-010-LTLFireability-12
Stuttering acceptance computed with spot in 199 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2)]
Support contains 4 out of 64 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 64/64 places, 146/146 transitions.
Ensure Unique test removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 63 transition count 145
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 62 transition count 145
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 2 place count 62 transition count 137
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 18 place count 54 transition count 137
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 52 transition count 135
Applied a total of 22 rules in 15 ms. Remains 52 /64 variables (removed 12) and now considering 135/146 (removed 11) transitions.
// Phase 1: matrix 135 rows 52 cols
[2024-06-01 16:57:09] [INFO ] Computed 17 invariants in 1 ms
[2024-06-01 16:57:09] [INFO ] Implicit Places using invariants in 67 ms returned [29, 37]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 68 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 50/64 places, 135/146 transitions.
Applied a total of 0 rules in 3 ms. Remains 50 /50 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 87 ms. Remains : 50/64 places, 135/146 transitions.
Running random walk in product with property : Railroad-PT-010-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 241 ms.
Product exploration explored 100000 steps with 0 reset in 280 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND (NOT p0) p2))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 125 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2))]
Reduction of identical properties reduced properties to check from 10 to 8
RANDOM walk for 40000 steps (8 resets) in 174 ms. (228 steps per ms) remains 3/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 41 ms. (952 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 3/3 properties
// Phase 1: matrix 135 rows 50 cols
[2024-06-01 16:57:10] [INFO ] Computed 15 invariants in 1 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 8/12 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 27/39 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 27/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 11/50 variables, 9/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/50 variables, 11/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/50 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 135/185 variables, 50/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/185 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/185 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 115 constraints, problems are : Problem set: 0 solved, 3 unsolved in 94 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Problem apf3 is UNSAT
Problem apf5 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 8/12 variables, 4/8 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 8/16 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/16 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 27/39 variables, 2/18 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 27/45 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-06-01 16:57:11] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-06-01 16:57:11] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 0 ms to minimize.
Problem apf4 is UNSAT
After SMT solving in domain Int declared 39/185 variables, and 47 constraints, problems are : Problem set: 3 solved, 0 unsolved in 123 ms.
Refiners :[Domain max(s): 39/50 constraints, Positive P Invariants (semi-flows): 4/13 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/50 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 2/2 constraints]
After SMT, in 229ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND (NOT p0) p2))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0)), (X (X p1)), (G (OR (NOT p2) p1)), (G (OR p0 p2 (NOT p1))), (G (OR p0 p2))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p2) (NOT p1)))), (F p2), (F (NOT (AND p0 p1))), (F (NOT (OR p2 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p2)))), (F (NOT p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 24 factoid took 524 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 135/135 transitions.
Applied a total of 0 rules in 7 ms. Remains 50 /50 variables (removed 0) and now considering 135/135 (removed 0) transitions.
[2024-06-01 16:57:11] [INFO ] Invariant cache hit.
[2024-06-01 16:57:11] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-01 16:57:11] [INFO ] Invariant cache hit.
[2024-06-01 16:57:12] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
[2024-06-01 16:57:12] [INFO ] Redundant transitions in 3 ms returned []
Running 125 sub problems to find dead transitions.
[2024-06-01 16:57:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (OVERLAPS) 10/50 variables, 10/53 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 10/63 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 125 unsolved
[2024-06-01 16:57:12] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 0 ms to minimize.
[2024-06-01 16:57:12] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-06-01 16:57:12] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
[2024-06-01 16:57:12] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 4/69 constraints. Problems are: Problem set: 0 solved, 125 unsolved
[2024-06-01 16:57:13] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/50 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 9 (OVERLAPS) 135/185 variables, 50/120 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 11 (OVERLAPS) 0/185 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 120 constraints, problems are : Problem set: 0 solved, 125 unsolved in 2668 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 125 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (OVERLAPS) 10/50 variables, 10/55 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 10/65 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 3/70 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/50 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 9 (OVERLAPS) 135/185 variables, 50/120 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 125/245 constraints. Problems are: Problem set: 0 solved, 125 unsolved
[2024-06-01 16:57:15] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/185 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/185 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 13 (OVERLAPS) 0/185 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/185 variables, and 246 constraints, problems are : Problem set: 0 solved, 125 unsolved in 4211 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 6/6 constraints]
After SMT, in 6973ms problems are : Problem set: 0 solved, 125 unsolved
Search for dead transitions found 0 dead transitions in 6975ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7133 ms. Remains : 50/50 places, 135/135 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 98 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (8 resets) in 120 ms. (330 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
[2024-06-01 16:57:19] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 8/12 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 27/39 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 27/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 11/50 variables, 9/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/50 variables, 11/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/50 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 135/185 variables, 50/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/185 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/185 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 115 constraints, problems are : Problem set: 0 solved, 1 unsolved in 61 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 8/12 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 27/39 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 27/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 16:57:19] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2024-06-01 16:57:19] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 0 ms to minimize.
Problem apf0 is UNSAT
After SMT solving in domain Int declared 39/185 variables, and 47 constraints, problems are : Problem set: 1 solved, 0 unsolved in 114 ms.
Refiners :[Domain max(s): 39/50 constraints, Positive P Invariants (semi-flows): 4/13 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/50 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 178ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 12 factoid took 263 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 242 ms.
Product exploration explored 100000 steps with 0 reset in 288 ms.
Support contains 4 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 135/135 transitions.
Applied a total of 0 rules in 3 ms. Remains 50 /50 variables (removed 0) and now considering 135/135 (removed 0) transitions.
[2024-06-01 16:57:20] [INFO ] Invariant cache hit.
[2024-06-01 16:57:20] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-01 16:57:20] [INFO ] Invariant cache hit.
[2024-06-01 16:57:20] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
[2024-06-01 16:57:20] [INFO ] Redundant transitions in 3 ms returned []
Running 125 sub problems to find dead transitions.
[2024-06-01 16:57:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (OVERLAPS) 10/50 variables, 10/53 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 10/63 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 125 unsolved
[2024-06-01 16:57:21] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
[2024-06-01 16:57:21] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-06-01 16:57:21] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
[2024-06-01 16:57:21] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 4/69 constraints. Problems are: Problem set: 0 solved, 125 unsolved
[2024-06-01 16:57:21] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/50 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 9 (OVERLAPS) 135/185 variables, 50/120 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 11 (OVERLAPS) 0/185 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 120 constraints, problems are : Problem set: 0 solved, 125 unsolved in 2653 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 125 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (OVERLAPS) 10/50 variables, 10/55 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 10/65 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 3/70 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/50 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 9 (OVERLAPS) 135/185 variables, 50/120 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 125/245 constraints. Problems are: Problem set: 0 solved, 125 unsolved
[2024-06-01 16:57:24] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/185 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/185 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 13 (OVERLAPS) 0/185 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/185 variables, and 246 constraints, problems are : Problem set: 0 solved, 125 unsolved in 4207 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 6/6 constraints]
After SMT, in 6944ms problems are : Problem set: 0 solved, 125 unsolved
Search for dead transitions found 0 dead transitions in 6945ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7102 ms. Remains : 50/50 places, 135/135 transitions.
Treatment of property Railroad-PT-010-LTLFireability-12 finished in 18167 ms.
[2024-06-01 16:57:27] [INFO ] Flatten gal took : 18 ms
[2024-06-01 16:57:27] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2024-06-01 16:57:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 64 places, 146 transitions and 782 arcs took 5 ms.
Total runtime 44463 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA Railroad-PT-010-LTLFireability-12 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717261058954

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name Railroad-PT-010-LTLFireability-12
ltl formula formula --ltl=/tmp/1310/ltl_0_
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 64 places, 146 transitions and 782 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.000 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1310/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1310/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1310/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1310/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 66 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 65, there are 187 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~2429 levels ~10000 states ~148576 transitions
pnml2lts-mc( 2/ 4): ~4819 levels ~20000 states ~296112 transitions
pnml2lts-mc( 2/ 4): ~9492 levels ~40000 states ~589736 transitions
pnml2lts-mc( 2/ 4): ~18781 levels ~80000 states ~1180896 transitions
pnml2lts-mc( 2/ 4): ~37405 levels ~160000 states ~2397632 transitions
pnml2lts-mc( 2/ 4): ~74603 levels ~320000 states ~4861200 transitions
pnml2lts-mc( 2/ 4): ~147743 levels ~640000 states ~9839704 transitions
pnml2lts-mc( 2/ 4): ~286234 levels ~1280000 states ~20029632 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1
pnml2lts-mc( 0/ 4): unique states count: 2038186
pnml2lts-mc( 0/ 4): unique transitions count: 32649226
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 30666597
pnml2lts-mc( 0/ 4): - claim success count: 2038469
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1633902
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2062257 states 33031648 transitions, fanout: 16.017
pnml2lts-mc( 0/ 4): Total exploration time 10.530 sec (10.530 sec minimum, 10.530 sec on average)
pnml2lts-mc( 0/ 4): States per second: 195846, Transitions per second: 3136909
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 17.0MB, 8.7 B/state, compr.: 3.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 6.0%/2.0%
pnml2lts-mc( 0/ 4): Stored 146 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 17.0MB (~256.0MB paged-in)

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-010"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is Railroad-PT-010, 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 r520-tall-171662338600484"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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