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.r524-tall-171679079400004.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 Ring-PT-none, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r524-tall-171679079400004
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K 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.1K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 03:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Apr 12 03:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 12 03:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 12 03:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 23 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 47K 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 Ring-PT-none-LTLFireability-00
FORMULA_NAME Ring-PT-none-LTLFireability-01
FORMULA_NAME Ring-PT-none-LTLFireability-02
FORMULA_NAME Ring-PT-none-LTLFireability-03
FORMULA_NAME Ring-PT-none-LTLFireability-04
FORMULA_NAME Ring-PT-none-LTLFireability-05
FORMULA_NAME Ring-PT-none-LTLFireability-06
FORMULA_NAME Ring-PT-none-LTLFireability-07
FORMULA_NAME Ring-PT-none-LTLFireability-08
FORMULA_NAME Ring-PT-none-LTLFireability-09
FORMULA_NAME Ring-PT-none-LTLFireability-10
FORMULA_NAME Ring-PT-none-LTLFireability-11
FORMULA_NAME Ring-PT-none-LTLFireability-12
FORMULA_NAME Ring-PT-none-LTLFireability-13
FORMULA_NAME Ring-PT-none-LTLFireability-14
FORMULA_NAME Ring-PT-none-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717217928126

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Ring-PT-none
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 04:58:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 04:58:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 04:58:49] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2024-06-01 04:58:49] [INFO ] Transformed 139 places.
[2024-06-01 04:58:49] [INFO ] Transformed 87 transitions.
[2024-06-01 04:58:49] [INFO ] Found NUPN structural information;
[2024-06-01 04:58:49] [INFO ] Parsed PT model containing 139 places and 87 transitions and 410 arcs in 171 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Reduce places removed 6 places and 0 transitions.
FORMULA Ring-PT-none-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Ring-PT-none-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Ring-PT-none-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Ring-PT-none-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 87/87 transitions.
Applied a total of 0 rules in 14 ms. Remains 133 /133 variables (removed 0) and now considering 87/87 (removed 0) transitions.
// Phase 1: matrix 87 rows 133 cols
[2024-06-01 04:58:49] [INFO ] Computed 58 invariants in 16 ms
[2024-06-01 04:58:50] [INFO ] Implicit Places using invariants in 407 ms returned [3, 19, 22, 28, 30, 33, 34, 35, 36, 37, 38, 39, 40, 87, 92]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 450 ms to find 15 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 118/133 places, 87/87 transitions.
Applied a total of 0 rules in 14 ms. Remains 118 /118 variables (removed 0) and now considering 87/87 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 494 ms. Remains : 118/133 places, 87/87 transitions.
Support contains 45 out of 118 places after structural reductions.
[2024-06-01 04:58:50] [INFO ] Flatten gal took : 55 ms
[2024-06-01 04:58:50] [INFO ] Flatten gal took : 17 ms
[2024-06-01 04:58:50] [INFO ] Input system was already deterministic with 87 transitions.
RANDOM walk for 5445 steps (0 resets) in 349 ms. (15 steps per ms) remains 0/20 properties
FORMULA Ring-PT-none-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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' '!(X((X(F(p0))||G(!p1))))'
Support contains 3 out of 118 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 87/87 transitions.
Applied a total of 0 rules in 4 ms. Remains 118 /118 variables (removed 0) and now considering 87/87 (removed 0) transitions.
// Phase 1: matrix 87 rows 118 cols
[2024-06-01 04:58:51] [INFO ] Computed 43 invariants in 2 ms
[2024-06-01 04:58:51] [INFO ] Implicit Places using invariants in 166 ms returned [19, 27, 76]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 176 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 115/118 places, 87/87 transitions.
Applied a total of 0 rules in 5 ms. Remains 115 /115 variables (removed 0) and now considering 87/87 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 186 ms. Remains : 115/118 places, 87/87 transitions.
Stuttering acceptance computed with spot in 398 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : Ring-PT-none-LTLFireability-00
Product exploration explored 100000 steps with 1079 reset in 426 ms.
Stack based approach found an accepted trace after 146 steps with 1 reset with depth 105 and stack size 105 in 7 ms.
FORMULA Ring-PT-none-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Ring-PT-none-LTLFireability-00 finished in 1092 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 1 out of 118 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 118/118 places, 87/87 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 118 transition count 84
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 115 transition count 84
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 6 place count 115 transition count 80
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 14 place count 111 transition count 80
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 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 23 place count 106 transition count 76
Applied a total of 23 rules in 36 ms. Remains 106 /118 variables (removed 12) and now considering 76/87 (removed 11) transitions.
// Phase 1: matrix 76 rows 106 cols
[2024-06-01 04:58:52] [INFO ] Computed 42 invariants in 1 ms
[2024-06-01 04:58:52] [INFO ] Implicit Places using invariants in 147 ms returned [23, 66]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 152 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/118 places, 76/87 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 102 transition count 74
Applied a total of 4 rules in 21 ms. Remains 102 /104 variables (removed 2) and now considering 74/76 (removed 2) transitions.
// Phase 1: matrix 74 rows 102 cols
[2024-06-01 04:58:52] [INFO ] Computed 40 invariants in 1 ms
[2024-06-01 04:58:52] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-06-01 04:58:52] [INFO ] Invariant cache hit.
[2024-06-01 04:58:52] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 102/118 places, 74/87 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 431 ms. Remains : 102/118 places, 74/87 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Ring-PT-none-LTLFireability-04
Product exploration explored 100000 steps with 971 reset in 257 ms.
Stack based approach found an accepted trace after 3658 steps with 38 reset with depth 101 and stack size 101 in 8 ms.
FORMULA Ring-PT-none-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Ring-PT-none-LTLFireability-04 finished in 794 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(F(p0))))'
Support contains 2 out of 118 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 87/87 transitions.
Applied a total of 0 rules in 2 ms. Remains 118 /118 variables (removed 0) and now considering 87/87 (removed 0) transitions.
// Phase 1: matrix 87 rows 118 cols
[2024-06-01 04:58:53] [INFO ] Computed 43 invariants in 2 ms
[2024-06-01 04:58:53] [INFO ] Implicit Places using invariants in 84 ms returned [19, 27, 76]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 92 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 115/118 places, 87/87 transitions.
Applied a total of 0 rules in 1 ms. Remains 115 /115 variables (removed 0) and now considering 87/87 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 95 ms. Remains : 115/118 places, 87/87 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Ring-PT-none-LTLFireability-06
Product exploration explored 100000 steps with 2909 reset in 237 ms.
Stack based approach found an accepted trace after 45 steps with 3 reset with depth 13 and stack size 13 in 0 ms.
FORMULA Ring-PT-none-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Ring-PT-none-LTLFireability-06 finished in 471 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(F(p0)))'
Support contains 2 out of 118 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 87/87 transitions.
Applied a total of 0 rules in 1 ms. Remains 118 /118 variables (removed 0) and now considering 87/87 (removed 0) transitions.
[2024-06-01 04:58:53] [INFO ] Invariant cache hit.
[2024-06-01 04:58:53] [INFO ] Implicit Places using invariants in 160 ms returned [19, 27, 76]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 164 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 115/118 places, 87/87 transitions.
Applied a total of 0 rules in 2 ms. Remains 115 /115 variables (removed 0) and now considering 87/87 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 167 ms. Remains : 115/118 places, 87/87 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Ring-PT-none-LTLFireability-07
Product exploration explored 100000 steps with 923 reset in 191 ms.
Stack based approach found an accepted trace after 190 steps with 3 reset with depth 71 and stack size 71 in 1 ms.
FORMULA Ring-PT-none-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Ring-PT-none-LTLFireability-07 finished in 489 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 (X((p1 U (p2||F(p3))))&&F(p0))))'
Support contains 10 out of 118 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 87/87 transitions.
Applied a total of 0 rules in 4 ms. Remains 118 /118 variables (removed 0) and now considering 87/87 (removed 0) transitions.
[2024-06-01 04:58:54] [INFO ] Invariant cache hit.
[2024-06-01 04:58:54] [INFO ] Implicit Places using invariants in 130 ms returned [27, 76]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 132 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 116/118 places, 87/87 transitions.
Applied a total of 0 rules in 1 ms. Remains 116 /116 variables (removed 0) and now considering 87/87 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 137 ms. Remains : 116/118 places, 87/87 transitions.
Stuttering acceptance computed with spot in 230 ms :[(OR (NOT p0) (AND (NOT p2) (NOT p3))), (NOT p3), (AND (NOT p2) (NOT p3)), (NOT p0), (OR (NOT p0) (AND (NOT p2) (NOT p3)))]
Running random walk in product with property : Ring-PT-none-LTLFireability-08
Product exploration explored 100000 steps with 1279 reset in 227 ms.
Stack based approach found an accepted trace after 1455 steps with 20 reset with depth 15 and stack size 15 in 58 ms.
FORMULA Ring-PT-none-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Ring-PT-none-LTLFireability-08 finished in 678 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(F((p0||G(p1)))) U G(p2))))'
Support contains 7 out of 118 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 87/87 transitions.
Applied a total of 0 rules in 5 ms. Remains 118 /118 variables (removed 0) and now considering 87/87 (removed 0) transitions.
[2024-06-01 04:58:54] [INFO ] Invariant cache hit.
[2024-06-01 04:58:54] [INFO ] Implicit Places using invariants in 113 ms returned [19, 27, 76]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 122 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 115/118 places, 87/87 transitions.
Applied a total of 0 rules in 1 ms. Remains 115 /115 variables (removed 0) and now considering 87/87 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 129 ms. Remains : 115/118 places, 87/87 transitions.
Stuttering acceptance computed with spot in 146 ms :[(NOT p2), (NOT p2), (AND p2 (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Ring-PT-none-LTLFireability-09
Product exploration explored 100000 steps with 1264 reset in 228 ms.
Stack based approach found an accepted trace after 1242 steps with 14 reset with depth 43 and stack size 43 in 3 ms.
FORMULA Ring-PT-none-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Ring-PT-none-LTLFireability-09 finished in 528 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((F(G(p0)) U p1))))'
Support contains 5 out of 118 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 87/87 transitions.
Applied a total of 0 rules in 2 ms. Remains 118 /118 variables (removed 0) and now considering 87/87 (removed 0) transitions.
[2024-06-01 04:58:55] [INFO ] Invariant cache hit.
[2024-06-01 04:58:55] [INFO ] Implicit Places using invariants in 116 ms returned [19, 27, 76]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 127 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 115/118 places, 87/87 transitions.
Applied a total of 0 rules in 2 ms. Remains 115 /115 variables (removed 0) and now considering 87/87 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 131 ms. Remains : 115/118 places, 87/87 transitions.
Stuttering acceptance computed with spot in 138 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : Ring-PT-none-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 200 ms.
Stack based approach found an accepted trace after 339 steps with 0 reset with depth 340 and stack size 340 in 1 ms.
FORMULA Ring-PT-none-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Ring-PT-none-LTLFireability-10 finished in 489 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((p0||G(F(p1)))))'
Support contains 7 out of 118 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 87/87 transitions.
Applied a total of 0 rules in 1 ms. Remains 118 /118 variables (removed 0) and now considering 87/87 (removed 0) transitions.
[2024-06-01 04:58:55] [INFO ] Invariant cache hit.
[2024-06-01 04:58:55] [INFO ] Implicit Places using invariants in 97 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 112 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 117/118 places, 87/87 transitions.
Applied a total of 0 rules in 1 ms. Remains 117 /117 variables (removed 0) and now considering 87/87 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 114 ms. Remains : 117/118 places, 87/87 transitions.
Stuttering acceptance computed with spot in 366 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : Ring-PT-none-LTLFireability-11
Product exploration explored 100000 steps with 75 reset in 187 ms.
Product exploration explored 100000 steps with 133 reset in 240 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p1))]
False Knowledge obtained : [(X p0), (X (NOT p0))]
Knowledge based reduction with 4 factoid took 123 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 227 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
RANDOM walk for 11592 steps (2 resets) in 43 ms. (263 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p1))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 193 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 7 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 87/87 transitions.
Applied a total of 0 rules in 2 ms. Remains 117 /117 variables (removed 0) and now considering 87/87 (removed 0) transitions.
// Phase 1: matrix 87 rows 117 cols
[2024-06-01 04:58:57] [INFO ] Computed 42 invariants in 1 ms
[2024-06-01 04:58:57] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-01 04:58:57] [INFO ] Invariant cache hit.
[2024-06-01 04:58:57] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
Running 75 sub problems to find dead transitions.
[2024-06-01 04:58:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 107/107 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 29/136 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (OVERLAPS) 10/117 variables, 12/149 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 10/159 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (OVERLAPS) 87/204 variables, 117/276 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 9 (OVERLAPS) 0/204 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 276 constraints, problems are : Problem set: 0 solved, 75 unsolved in 2340 ms.
Refiners :[Domain max(s): 117/117 constraints, Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 75 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 107/107 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 29/136 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (OVERLAPS) 10/117 variables, 12/149 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 10/159 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (OVERLAPS) 87/204 variables, 117/276 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 75/351 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/204 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 10 (OVERLAPS) 0/204 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 351 constraints, problems are : Problem set: 0 solved, 75 unsolved in 1966 ms.
Refiners :[Domain max(s): 117/117 constraints, Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 0/0 constraints]
After SMT, in 4363ms problems are : Problem set: 0 solved, 75 unsolved
Search for dead transitions found 0 dead transitions in 4373ms
Finished structural reductions in LTL mode , in 1 iterations and 4554 ms. Remains : 117/117 places, 87/87 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0)]
Knowledge based reduction with 2 factoid took 194 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
RANDOM walk for 5102 steps (0 resets) in 28 ms. (175 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 202 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 107 reset in 193 ms.
Product exploration explored 100000 steps with 123 reset in 211 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 7 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 87/87 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 117 transition count 87
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 4 place count 117 transition count 87
Deduced a syphon composed of 9 places in 1 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 9 place count 117 transition count 87
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 115 transition count 85
Deduced a syphon composed of 7 places in 2 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 115 transition count 85
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 16 place count 115 transition count 85
Deduced a syphon composed of 10 places in 0 ms
Applied a total of 16 rules in 27 ms. Remains 115 /117 variables (removed 2) and now considering 85/87 (removed 2) transitions.
[2024-06-01 04:59:03] [INFO ] Redundant transitions in 1 ms returned []
Running 73 sub problems to find dead transitions.
// Phase 1: matrix 85 rows 115 cols
[2024-06-01 04:59:03] [INFO ] Computed 42 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 73 unsolved
[2024-06-01 04:59:04] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 4 ms to minimize.
[2024-06-01 04:59:04] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 3 ms to minimize.
Problem TDEAD21 is UNSAT
[2024-06-01 04:59:04] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
Problem TDEAD31 is UNSAT
Problem TDEAD81 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 3/33 constraints. Problems are: Problem set: 3 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/33 constraints. Problems are: Problem set: 3 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 10/115 variables, 12/45 constraints. Problems are: Problem set: 3 solved, 70 unsolved
[2024-06-01 04:59:04] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
Problem TDEAD10 is UNSAT
[2024-06-01 04:59:04] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 1 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-06-01 04:59:04] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 17 ms to minimize.
Problem TDEAD30 is UNSAT
[2024-06-01 04:59:04] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
[2024-06-01 04:59:04] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
Problem TDEAD36 is UNSAT
[2024-06-01 04:59:04] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 1 ms to minimize.
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 6/51 constraints. Problems are: Problem set: 10 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 0/51 constraints. Problems are: Problem set: 10 solved, 63 unsolved
At refinement iteration 7 (OVERLAPS) 85/200 variables, 115/166 constraints. Problems are: Problem set: 10 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 0/166 constraints. Problems are: Problem set: 10 solved, 63 unsolved
At refinement iteration 9 (OVERLAPS) 0/200 variables, 0/166 constraints. Problems are: Problem set: 10 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 166 constraints, problems are : Problem set: 10 solved, 63 unsolved in 1954 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 10 solved, 63 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 26/26 constraints. Problems are: Problem set: 10 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 1/27 constraints. Problems are: Problem set: 10 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 3/30 constraints. Problems are: Problem set: 10 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/30 constraints. Problems are: Problem set: 10 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 20/115 variables, 15/45 constraints. Problems are: Problem set: 10 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 6/51 constraints. Problems are: Problem set: 10 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 0/51 constraints. Problems are: Problem set: 10 solved, 63 unsolved
At refinement iteration 7 (OVERLAPS) 85/200 variables, 115/166 constraints. Problems are: Problem set: 10 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 63/229 constraints. Problems are: Problem set: 10 solved, 63 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 0/229 constraints. Problems are: Problem set: 10 solved, 63 unsolved
At refinement iteration 10 (OVERLAPS) 0/200 variables, 0/229 constraints. Problems are: Problem set: 10 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 229 constraints, problems are : Problem set: 10 solved, 63 unsolved in 1309 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 63/73 constraints, Known Traps: 9/9 constraints]
After SMT, in 3286ms problems are : Problem set: 10 solved, 63 unsolved
Search for dead transitions found 10 dead transitions in 3289ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) removed 10 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 115/117 places, 75/87 transitions.
Graph (complete) has 299 edges and 115 vertex of which 105 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.2 ms
Discarding 10 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 105 /115 variables (removed 10) and now considering 75/75 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 105/117 places, 75/87 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3332 ms. Remains : 105/117 places, 75/87 transitions.
Support contains 7 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 87/87 transitions.
Applied a total of 0 rules in 2 ms. Remains 117 /117 variables (removed 0) and now considering 87/87 (removed 0) transitions.
// Phase 1: matrix 87 rows 117 cols
[2024-06-01 04:59:07] [INFO ] Computed 42 invariants in 4 ms
[2024-06-01 04:59:07] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-01 04:59:07] [INFO ] Invariant cache hit.
[2024-06-01 04:59:07] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
Running 75 sub problems to find dead transitions.
[2024-06-01 04:59:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 107/107 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 29/136 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (OVERLAPS) 10/117 variables, 12/149 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 10/159 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (OVERLAPS) 87/204 variables, 117/276 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 9 (OVERLAPS) 0/204 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 276 constraints, problems are : Problem set: 0 solved, 75 unsolved in 1554 ms.
Refiners :[Domain max(s): 117/117 constraints, Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 75 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 107/107 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 29/136 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (OVERLAPS) 10/117 variables, 12/149 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 10/159 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (OVERLAPS) 87/204 variables, 117/276 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 75/351 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/204 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 10 (OVERLAPS) 0/204 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 351 constraints, problems are : Problem set: 0 solved, 75 unsolved in 1639 ms.
Refiners :[Domain max(s): 117/117 constraints, Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 0/0 constraints]
After SMT, in 3205ms problems are : Problem set: 0 solved, 75 unsolved
Search for dead transitions found 0 dead transitions in 3207ms
Finished structural reductions in LTL mode , in 1 iterations and 3393 ms. Remains : 117/117 places, 87/87 transitions.
Treatment of property Ring-PT-none-LTLFireability-11 finished in 14965 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(F((G(!p0)||(X(X(!p0))&&F(!p1)))))))'
Support contains 4 out of 118 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 87/87 transitions.
Applied a total of 0 rules in 1 ms. Remains 118 /118 variables (removed 0) and now considering 87/87 (removed 0) transitions.
// Phase 1: matrix 87 rows 118 cols
[2024-06-01 04:59:10] [INFO ] Computed 43 invariants in 2 ms
[2024-06-01 04:59:10] [INFO ] Implicit Places using invariants in 77 ms returned [19, 27, 76]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 77 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 115/118 places, 87/87 transitions.
Applied a total of 0 rules in 1 ms. Remains 115 /115 variables (removed 0) and now considering 87/87 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 79 ms. Remains : 115/118 places, 87/87 transitions.
Stuttering acceptance computed with spot in 290 ms :[p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0]
Running random walk in product with property : Ring-PT-none-LTLFireability-12
Product exploration explored 100000 steps with 19940 reset in 169 ms.
Product exploration explored 100000 steps with 19924 reset in 201 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 147 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 279 ms :[p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0]
RANDOM walk for 670 steps (0 resets) in 11 ms. (55 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 1 factoid took 458 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 351 ms :[p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0]
Stuttering acceptance computed with spot in 305 ms :[p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0]
Support contains 4 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 87/87 transitions.
Applied a total of 0 rules in 3 ms. Remains 115 /115 variables (removed 0) and now considering 87/87 (removed 0) transitions.
// Phase 1: matrix 87 rows 115 cols
[2024-06-01 04:59:13] [INFO ] Computed 40 invariants in 2 ms
[2024-06-01 04:59:13] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-01 04:59:13] [INFO ] Invariant cache hit.
[2024-06-01 04:59:13] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
Running 75 sub problems to find dead transitions.
[2024-06-01 04:59:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 106/106 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 28/134 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (OVERLAPS) 9/115 variables, 12/146 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 9/155 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (OVERLAPS) 87/202 variables, 115/270 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (OVERLAPS) 0/202 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 270 constraints, problems are : Problem set: 0 solved, 75 unsolved in 1408 ms.
Refiners :[Domain max(s): 115/115 constraints, Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 75 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 106/106 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 28/134 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (OVERLAPS) 9/115 variables, 12/146 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 9/155 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (OVERLAPS) 87/202 variables, 115/270 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 75/345 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 9 (OVERLAPS) 0/202 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 345 constraints, problems are : Problem set: 0 solved, 75 unsolved in 1597 ms.
Refiners :[Domain max(s): 115/115 constraints, Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 0/0 constraints]
After SMT, in 3020ms problems are : Problem set: 0 solved, 75 unsolved
Search for dead transitions found 0 dead transitions in 3023ms
Finished structural reductions in LTL mode , in 1 iterations and 3211 ms. Remains : 115/115 places, 87/87 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 157 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 260 ms :[p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0]
RANDOM walk for 229 steps (0 resets) in 6 ms. (32 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 1 factoid took 207 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 496 ms :[p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0]
Stuttering acceptance computed with spot in 304 ms :[p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0]
Stuttering acceptance computed with spot in 286 ms :[p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0]
Product exploration explored 100000 steps with 19927 reset in 153 ms.
Product exploration explored 100000 steps with 19923 reset in 251 ms.
Applying partial POR strategy [false, false, true, false, true, false, false]
Stuttering acceptance computed with spot in 379 ms :[p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0]
Support contains 4 out of 115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 87/87 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 115 transition count 87
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 3 place count 115 transition count 87
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 9 place count 115 transition count 87
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 113 transition count 85
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 113 transition count 85
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 19 place count 113 transition count 85
Deduced a syphon composed of 13 places in 0 ms
Applied a total of 19 rules in 14 ms. Remains 113 /115 variables (removed 2) and now considering 85/87 (removed 2) transitions.
[2024-06-01 04:59:18] [INFO ] Redundant transitions in 2 ms returned []
Running 73 sub problems to find dead transitions.
// Phase 1: matrix 85 rows 113 cols
[2024-06-01 04:59:18] [INFO ] Computed 40 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 73 unsolved
[2024-06-01 04:59:19] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-06-01 04:59:19] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
Problem TDEAD19 is UNSAT
[2024-06-01 04:59:19] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
Problem TDEAD29 is UNSAT
Problem TDEAD78 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 3/31 constraints. Problems are: Problem set: 3 solved, 70 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/31 constraints. Problems are: Problem set: 3 solved, 70 unsolved
At refinement iteration 3 (OVERLAPS) 9/113 variables, 12/43 constraints. Problems are: Problem set: 3 solved, 70 unsolved
[2024-06-01 04:59:19] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
Problem TDEAD8 is UNSAT
[2024-06-01 04:59:19] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 0 ms to minimize.
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
[2024-06-01 04:59:19] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
Problem TDEAD60 is UNSAT
Problem TDEAD28 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 3/46 constraints. Problems are: Problem set: 9 solved, 64 unsolved
[2024-06-01 04:59:19] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD31 is UNSAT
[2024-06-01 04:59:19] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem TDEAD34 is UNSAT
[2024-06-01 04:59:19] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 0 ms to minimize.
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 3/49 constraints. Problems are: Problem set: 13 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/49 constraints. Problems are: Problem set: 13 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 85/198 variables, 113/162 constraints. Problems are: Problem set: 13 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 0/162 constraints. Problems are: Problem set: 13 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/198 variables, 0/162 constraints. Problems are: Problem set: 13 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 162 constraints, problems are : Problem set: 13 solved, 60 unsolved in 1891 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 13 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 25/25 constraints. Problems are: Problem set: 13 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 3/28 constraints. Problems are: Problem set: 13 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/28 constraints. Problems are: Problem set: 13 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 22/113 variables, 15/43 constraints. Problems are: Problem set: 13 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 6/49 constraints. Problems are: Problem set: 13 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/49 constraints. Problems are: Problem set: 13 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 85/198 variables, 113/162 constraints. Problems are: Problem set: 13 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 60/222 constraints. Problems are: Problem set: 13 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 0/222 constraints. Problems are: Problem set: 13 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/198 variables, 0/222 constraints. Problems are: Problem set: 13 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 222 constraints, problems are : Problem set: 13 solved, 60 unsolved in 1249 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 60/73 constraints, Known Traps: 9/9 constraints]
After SMT, in 3170ms problems are : Problem set: 13 solved, 60 unsolved
Search for dead transitions found 13 dead transitions in 3170ms
Found 13 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 13 transitions
Dead transitions reduction (with SMT) removed 13 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 113/115 places, 72/87 transitions.
Graph (complete) has 285 edges and 113 vertex of which 100 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.0 ms
Discarding 13 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 100 /113 variables (removed 13) and now considering 72/72 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 100/115 places, 72/87 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3196 ms. Remains : 100/115 places, 72/87 transitions.
Support contains 4 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 87/87 transitions.
Applied a total of 0 rules in 1 ms. Remains 115 /115 variables (removed 0) and now considering 87/87 (removed 0) transitions.
// Phase 1: matrix 87 rows 115 cols
[2024-06-01 04:59:22] [INFO ] Computed 40 invariants in 4 ms
[2024-06-01 04:59:22] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-06-01 04:59:22] [INFO ] Invariant cache hit.
[2024-06-01 04:59:22] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
Running 75 sub problems to find dead transitions.
[2024-06-01 04:59:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 106/106 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 28/134 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (OVERLAPS) 9/115 variables, 12/146 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 9/155 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (OVERLAPS) 87/202 variables, 115/270 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (OVERLAPS) 0/202 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 270 constraints, problems are : Problem set: 0 solved, 75 unsolved in 1343 ms.
Refiners :[Domain max(s): 115/115 constraints, Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 75 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 106/106 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 28/134 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (OVERLAPS) 9/115 variables, 12/146 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 9/155 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (OVERLAPS) 87/202 variables, 115/270 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 75/345 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 9 (OVERLAPS) 0/202 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 345 constraints, problems are : Problem set: 0 solved, 75 unsolved in 1613 ms.
Refiners :[Domain max(s): 115/115 constraints, Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 0/0 constraints]
After SMT, in 2970ms problems are : Problem set: 0 solved, 75 unsolved
Search for dead transitions found 0 dead transitions in 2972ms
Finished structural reductions in LTL mode , in 1 iterations and 3229 ms. Remains : 115/115 places, 87/87 transitions.
Treatment of property Ring-PT-none-LTLFireability-12 finished in 14642 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(G(p0)))'
Support contains 2 out of 118 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 118/118 places, 87/87 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 118 transition count 83
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 114 transition count 82
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 113 transition count 82
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 10 place count 113 transition count 78
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 18 place count 109 transition count 78
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 5 places and 0 transitions.
Iterating global reduction 3 with 9 rules applied. Total rules applied 27 place count 104 transition count 74
Applied a total of 27 rules in 12 ms. Remains 104 /118 variables (removed 14) and now considering 74/87 (removed 13) transitions.
// Phase 1: matrix 74 rows 104 cols
[2024-06-01 04:59:25] [INFO ] Computed 42 invariants in 0 ms
[2024-06-01 04:59:25] [INFO ] Implicit Places using invariants in 69 ms returned [23, 64]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 69 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 102/118 places, 74/87 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 100 transition count 72
Applied a total of 4 rules in 4 ms. Remains 100 /102 variables (removed 2) and now considering 72/74 (removed 2) transitions.
// Phase 1: matrix 72 rows 100 cols
[2024-06-01 04:59:25] [INFO ] Computed 40 invariants in 0 ms
[2024-06-01 04:59:25] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-06-01 04:59:25] [INFO ] Invariant cache hit.
[2024-06-01 04:59:25] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 100/118 places, 72/87 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 250 ms. Remains : 100/118 places, 72/87 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : Ring-PT-none-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 221 ms.
Stack based approach found an accepted trace after 22 steps with 0 reset with depth 23 and stack size 23 in 0 ms.
FORMULA Ring-PT-none-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Ring-PT-none-LTLFireability-13 finished in 518 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&&G(p1))))'
Support contains 3 out of 118 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 118/118 places, 87/87 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 118 transition count 82
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 113 transition count 82
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 10 place count 113 transition count 79
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 110 transition count 79
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 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 25 place count 105 transition count 75
Applied a total of 25 rules in 7 ms. Remains 105 /118 variables (removed 13) and now considering 75/87 (removed 12) transitions.
// Phase 1: matrix 75 rows 105 cols
[2024-06-01 04:59:25] [INFO ] Computed 42 invariants in 1 ms
[2024-06-01 04:59:25] [INFO ] Implicit Places using invariants in 82 ms returned [24, 65]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 83 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 103/118 places, 75/87 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 101 transition count 73
Applied a total of 4 rules in 3 ms. Remains 101 /103 variables (removed 2) and now considering 73/75 (removed 2) transitions.
// Phase 1: matrix 73 rows 101 cols
[2024-06-01 04:59:25] [INFO ] Computed 40 invariants in 0 ms
[2024-06-01 04:59:26] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-01 04:59:26] [INFO ] Invariant cache hit.
[2024-06-01 04:59:26] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 101/118 places, 73/87 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 273 ms. Remains : 101/118 places, 73/87 transitions.
Stuttering acceptance computed with spot in 63 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : Ring-PT-none-LTLFireability-14
Product exploration explored 100000 steps with 0 reset in 213 ms.
Stack based approach found an accepted trace after 145 steps with 0 reset with depth 146 and stack size 146 in 0 ms.
FORMULA Ring-PT-none-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Ring-PT-none-LTLFireability-14 finished in 563 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((p0||G(F(p1)))))'
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(F((G(!p0)||(X(X(!p0))&&F(!p1)))))))'
[2024-06-01 04:59:26] [INFO ] Flatten gal took : 12 ms
[2024-06-01 04:59:26] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 8 ms.
[2024-06-01 04:59:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 118 places, 87 transitions and 340 arcs took 4 ms.
Total runtime 37366 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA Ring-PT-none-LTLFireability-11 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Ring-PT-none-LTLFireability-12 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717217968949

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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 Ring-PT-none-LTLFireability-11
ltl formula formula --ltl=/tmp/1365/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 118 places, 87 transitions and 340 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.010 real 0.010 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1365/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1365/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1365/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1365/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 120 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 119, there are 285 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( 0/ 4): ~2497 levels ~10000 states ~60632 transitions
pnml2lts-mc( 0/ 4): ~4899 levels ~20000 states ~122364 transitions
pnml2lts-mc( 0/ 4): ~9705 levels ~40000 states ~251044 transitions
pnml2lts-mc( 0/ 4): ~19414 levels ~80000 states ~503076 transitions
pnml2lts-mc( 0/ 4): ~39021 levels ~160000 states ~1028152 transitions
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~47727!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 10
pnml2lts-mc( 0/ 4): unique states count: 208675
pnml2lts-mc( 0/ 4): unique transitions count: 1301655
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 12
pnml2lts-mc( 0/ 4): - claim found count: 325299
pnml2lts-mc( 0/ 4): - claim success count: 208681
pnml2lts-mc( 0/ 4): - cum. max stack depth: 203749
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 208681 states 1301704 transitions, fanout: 6.238
pnml2lts-mc( 0/ 4): Total exploration time 1.510 sec (1.510 sec minimum, 1.510 sec on average)
pnml2lts-mc( 0/ 4): States per second: 138199, Transitions per second: 862056
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 10.0MB, 13.3 B/state, compr.: 2.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 2.0%/6.0%
pnml2lts-mc( 0/ 4): Stored 87 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 10.0MB (~256.0MB paged-in)
ltl formula name Ring-PT-none-LTLFireability-12
ltl formula formula --ltl=/tmp/1365/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 118 places, 87 transitions and 340 arcs
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
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.020 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1365/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1365/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1365/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1365/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4): There are 119 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 119, there are 106 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( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~28!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1085
pnml2lts-mc( 0/ 4): unique states count: 1218
pnml2lts-mc( 0/ 4): unique transitions count: 3784
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 1923
pnml2lts-mc( 0/ 4): - claim found count: 8
pnml2lts-mc( 0/ 4): - claim success count: 1251
pnml2lts-mc( 0/ 4): - cum. max stack depth: 142
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1251 states 4163 transitions, fanout: 3.328
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.020 sec minimum, 0.020 sec on average)
pnml2lts-mc( 0/ 4): States per second: 62550, Transitions per second: 208150
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 21.6 B/state, compr.: 4.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 87 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.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="Ring-PT-none"
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 Ring-PT-none, 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 r524-tall-171679079400004"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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