Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r186-tajo-165281572400572.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is RefineWMG-PT-100100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-tajo-165281572400572
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 6.8K Apr 30 02:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 30 02:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Apr 30 02:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 30 02:37 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 9 08:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 08:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 218K May 10 09:34 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 RefineWMG-PT-100100-LTLFireability-00
FORMULA_NAME RefineWMG-PT-100100-LTLFireability-01
FORMULA_NAME RefineWMG-PT-100100-LTLFireability-02
FORMULA_NAME RefineWMG-PT-100100-LTLFireability-03
FORMULA_NAME RefineWMG-PT-100100-LTLFireability-04
FORMULA_NAME RefineWMG-PT-100100-LTLFireability-05
FORMULA_NAME RefineWMG-PT-100100-LTLFireability-06
FORMULA_NAME RefineWMG-PT-100100-LTLFireability-07
FORMULA_NAME RefineWMG-PT-100100-LTLFireability-08
FORMULA_NAME RefineWMG-PT-100100-LTLFireability-09
FORMULA_NAME RefineWMG-PT-100100-LTLFireability-10
FORMULA_NAME RefineWMG-PT-100100-LTLFireability-11
FORMULA_NAME RefineWMG-PT-100100-LTLFireability-12
FORMULA_NAME RefineWMG-PT-100100-LTLFireability-13
FORMULA_NAME RefineWMG-PT-100100-LTLFireability-14
FORMULA_NAME RefineWMG-PT-100100-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653086565144

Running Version 202205111006
[2022-05-20 22:42:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-20 22:42:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 22:42:46] [INFO ] Load time of PNML (sax parser for PT used): 99 ms
[2022-05-20 22:42:46] [INFO ] Transformed 504 places.
[2022-05-20 22:42:46] [INFO ] Transformed 403 transitions.
[2022-05-20 22:42:46] [INFO ] Parsed PT model containing 504 places and 403 transitions in 203 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.
FORMULA RefineWMG-PT-100100-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-100100-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 46 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:42:46] [INFO ] Computed 202 place invariants in 17 ms
[2022-05-20 22:42:47] [INFO ] Dead Transitions using invariants and state equation in 357 ms found 0 transitions.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:42:47] [INFO ] Computed 202 place invariants in 5 ms
[2022-05-20 22:42:47] [INFO ] Implicit Places using invariants in 191 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:42:47] [INFO ] Computed 202 place invariants in 5 ms
[2022-05-20 22:42:47] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 519 ms to find 0 implicit places.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:42:47] [INFO ] Computed 202 place invariants in 2 ms
[2022-05-20 22:42:47] [INFO ] Dead Transitions using invariants and state equation in 232 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 504/504 places, 403/403 transitions.
Support contains 46 out of 504 places after structural reductions.
[2022-05-20 22:42:48] [INFO ] Flatten gal took : 95 ms
[2022-05-20 22:42:48] [INFO ] Flatten gal took : 38 ms
[2022-05-20 22:42:48] [INFO ] Input system was already deterministic with 403 transitions.
Incomplete random walk after 10004 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 29) seen :7
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 22) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:42:48] [INFO ] Computed 202 place invariants in 2 ms
[2022-05-20 22:42:48] [INFO ] [Real]Absence check using 202 positive place invariants in 32 ms returned sat
[2022-05-20 22:42:49] [INFO ] After 689ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2022-05-20 22:42:49] [INFO ] [Nat]Absence check using 202 positive place invariants in 37 ms returned sat
[2022-05-20 22:42:50] [INFO ] After 630ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :20
[2022-05-20 22:42:51] [INFO ] After 1276ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :20
Attempting to minimize the solution found.
Minimization took 310 ms.
[2022-05-20 22:42:51] [INFO ] After 2201ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :20
Fused 20 Parikh solutions to 19 different solutions.
Finished Parikh walk after 20109 steps, including 0 resets, run visited all 1 properties in 124 ms. (steps per millisecond=162 )
Parikh walk visited 20 properties in 2120 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X((X(G(p0))||F(p0))))))'
Support contains 3 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 9 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:42:54] [INFO ] Computed 202 place invariants in 14 ms
[2022-05-20 22:42:54] [INFO ] Dead Transitions using invariants and state equation in 369 ms found 0 transitions.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:42:54] [INFO ] Computed 202 place invariants in 7 ms
[2022-05-20 22:42:54] [INFO ] Implicit Places using invariants in 279 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:42:54] [INFO ] Computed 202 place invariants in 3 ms
[2022-05-20 22:42:55] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 613 ms to find 0 implicit places.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:42:55] [INFO ] Computed 202 place invariants in 4 ms
[2022-05-20 22:42:55] [INFO ] Dead Transitions using invariants and state equation in 220 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 258 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-100100-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s251 1) (GEQ s252 1) (GEQ s254 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 10 reset in 1625 ms.
Stack based approach found an accepted trace after 107 steps with 0 reset with depth 108 and stack size 108 in 2 ms.
FORMULA RefineWMG-PT-100100-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-100100-LTLFireability-00 finished in 3166 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 10 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:42:57] [INFO ] Computed 202 place invariants in 2 ms
[2022-05-20 22:42:57] [INFO ] Dead Transitions using invariants and state equation in 249 ms found 0 transitions.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:42:57] [INFO ] Computed 202 place invariants in 2 ms
[2022-05-20 22:42:57] [INFO ] Implicit Places using invariants in 153 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:42:57] [INFO ] Computed 202 place invariants in 3 ms
[2022-05-20 22:42:57] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 547 ms to find 0 implicit places.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:42:57] [INFO ] Computed 202 place invariants in 2 ms
[2022-05-20 22:42:58] [INFO ] Dead Transitions using invariants and state equation in 225 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-100100-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s497 1) (AND (GEQ s63 1) (GEQ s62 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 673 ms.
Product exploration explored 100000 steps with 50000 reset in 709 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA RefineWMG-PT-100100-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RefineWMG-PT-100100-LTLFireability-01 finished in 2633 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p1)||p0))))'
Support contains 3 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 6 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:42:59] [INFO ] Computed 202 place invariants in 2 ms
[2022-05-20 22:43:00] [INFO ] Dead Transitions using invariants and state equation in 246 ms found 0 transitions.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:43:00] [INFO ] Computed 202 place invariants in 2 ms
[2022-05-20 22:43:00] [INFO ] Implicit Places using invariants in 174 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:43:00] [INFO ] Computed 202 place invariants in 2 ms
[2022-05-20 22:43:00] [INFO ] Implicit Places using invariants and state equation in 351 ms returned []
Implicit Place search using SMT with State Equation took 527 ms to find 0 implicit places.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:43:00] [INFO ] Computed 202 place invariants in 1 ms
[2022-05-20 22:43:00] [INFO ] Dead Transitions using invariants and state equation in 295 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 150 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-100100-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(LT s240 1), p0:(OR (GEQ s212 1) (GEQ s273 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1423 ms.
Product exploration explored 100000 steps with 0 reset in 1654 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1)), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 240 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 135 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10004 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:43:04] [INFO ] Computed 202 place invariants in 3 ms
[2022-05-20 22:43:04] [INFO ] [Real]Absence check using 202 positive place invariants in 33 ms returned sat
[2022-05-20 22:43:04] [INFO ] After 313ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 22:43:05] [INFO ] [Nat]Absence check using 202 positive place invariants in 30 ms returned sat
[2022-05-20 22:43:05] [INFO ] After 170ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 22:43:05] [INFO ] After 201ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2022-05-20 22:43:05] [INFO ] After 340ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 3694 steps, including 0 resets, run visited all 1 properties in 43 ms. (steps per millisecond=85 )
Parikh walk visited 1 properties in 42 ms.
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1)), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (AND p1 p0))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 6 factoid took 375 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 161 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 151 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 9 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:43:06] [INFO ] Computed 202 place invariants in 2 ms
[2022-05-20 22:43:06] [INFO ] Dead Transitions using invariants and state equation in 275 ms found 0 transitions.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:43:06] [INFO ] Computed 202 place invariants in 2 ms
[2022-05-20 22:43:06] [INFO ] Implicit Places using invariants in 235 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:43:06] [INFO ] Computed 202 place invariants in 2 ms
[2022-05-20 22:43:06] [INFO ] Implicit Places using invariants and state equation in 407 ms returned []
Implicit Place search using SMT with State Equation took 644 ms to find 0 implicit places.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:43:06] [INFO ] Computed 202 place invariants in 3 ms
[2022-05-20 22:43:07] [INFO ] Dead Transitions using invariants and state equation in 226 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 504/504 places, 403/403 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 p0), (X (X (AND p1 p0))), (X (X p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 196 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10002 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 101091 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 101091 steps, saw 98516 distinct states, run finished after 3003 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:43:10] [INFO ] Computed 202 place invariants in 0 ms
[2022-05-20 22:43:10] [INFO ] [Real]Absence check using 202 positive place invariants in 39 ms returned sat
[2022-05-20 22:43:11] [INFO ] After 318ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-20 22:43:11] [INFO ] [Nat]Absence check using 202 positive place invariants in 32 ms returned sat
[2022-05-20 22:43:11] [INFO ] After 263ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-20 22:43:11] [INFO ] After 382ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 71 ms.
[2022-05-20 22:43:11] [INFO ] After 644ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Finished Parikh walk after 5320 steps, including 0 resets, run visited all 1 properties in 44 ms. (steps per millisecond=120 )
Parikh walk visited 4 properties in 249 ms.
Knowledge obtained : [(AND p1 p0), (X p0), (X (X (AND p1 p0))), (X (X p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (AND p1 p0))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 6 factoid took 417 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 135 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 175 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 168 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 1489 ms.
Product exploration explored 100000 steps with 0 reset in 1298 ms.
Built C files in :
/tmp/ltsmin7004883081541684445
[2022-05-20 22:43:16] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7004883081541684445
Running compilation step : cd /tmp/ltsmin7004883081541684445;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 843 ms.
Running link step : cd /tmp/ltsmin7004883081541684445;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin7004883081541684445;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7514706768369350642.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 6 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:43:31] [INFO ] Computed 202 place invariants in 3 ms
[2022-05-20 22:43:31] [INFO ] Dead Transitions using invariants and state equation in 188 ms found 0 transitions.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:43:31] [INFO ] Computed 202 place invariants in 1 ms
[2022-05-20 22:43:31] [INFO ] Implicit Places using invariants in 150 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:43:31] [INFO ] Computed 202 place invariants in 1 ms
[2022-05-20 22:43:31] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 421 ms to find 0 implicit places.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:43:31] [INFO ] Computed 202 place invariants in 5 ms
[2022-05-20 22:43:31] [INFO ] Dead Transitions using invariants and state equation in 200 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 504/504 places, 403/403 transitions.
Built C files in :
/tmp/ltsmin16102310499711727850
[2022-05-20 22:43:31] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16102310499711727850
Running compilation step : cd /tmp/ltsmin16102310499711727850;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 623 ms.
Running link step : cd /tmp/ltsmin16102310499711727850;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin16102310499711727850;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10417788112567856453.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 22:43:47] [INFO ] Flatten gal took : 21 ms
[2022-05-20 22:43:47] [INFO ] Flatten gal took : 22 ms
[2022-05-20 22:43:47] [INFO ] Time to serialize gal into /tmp/LTL7628086334632850495.gal : 5 ms
[2022-05-20 22:43:47] [INFO ] Time to serialize properties into /tmp/LTL12030470824342972550.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7628086334632850495.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12030470824342972550.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7628086...267
Read 1 LTL properties
Checking formula 0 : !((X(G(((X("(p237<1)"))||("(p209>=1)"))||("(p270>=1)")))))
Formula 0 simplified : !XG("(p209>=1)" | "(p270>=1)" | X"(p237<1)")
Detected timeout of ITS tools.
[2022-05-20 22:44:02] [INFO ] Flatten gal took : 18 ms
[2022-05-20 22:44:02] [INFO ] Applying decomposition
[2022-05-20 22:44:02] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph8457581665855770303.txt' '-o' '/tmp/graph8457581665855770303.bin' '-w' '/tmp/graph8457581665855770303.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8457581665855770303.bin' '-l' '-1' '-v' '-w' '/tmp/graph8457581665855770303.weights' '-q' '0' '-e' '0.001'
[2022-05-20 22:44:02] [INFO ] Decomposing Gal with order
[2022-05-20 22:44:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 22:44:02] [INFO ] Flatten gal took : 56 ms
[2022-05-20 22:44:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2022-05-20 22:44:02] [INFO ] Time to serialize gal into /tmp/LTL16911719655910245241.gal : 8 ms
[2022-05-20 22:44:02] [INFO ] Time to serialize properties into /tmp/LTL11472600096453622508.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16911719655910245241.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11472600096453622508.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1691171...247
Read 1 LTL properties
Checking formula 0 : !((X(G(((X("(i17.i2.u116.p237<1)"))||("(i15.i0.u103.p209>=1)"))||("(i19.i1.u132.p270>=1)")))))
Formula 0 simplified : !XG("(i15.i0.u103.p209>=1)" | "(i19.i1.u132.p270>=1)" | X"(i17.i2.u116.p237<1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14734048388994371601
[2022-05-20 22:44:17] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14734048388994371601
Running compilation step : cd /tmp/ltsmin14734048388994371601;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 770 ms.
Running link step : cd /tmp/ltsmin14734048388994371601;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin14734048388994371601;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((X((LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property RefineWMG-PT-100100-LTLFireability-03 finished in 92863 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(G(p0))&&p1)||((p0 U p2)&&X(p3)))))'
Support contains 4 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 10 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:44:32] [INFO ] Computed 202 place invariants in 3 ms
[2022-05-20 22:44:32] [INFO ] Dead Transitions using invariants and state equation in 260 ms found 0 transitions.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:44:32] [INFO ] Computed 202 place invariants in 4 ms
[2022-05-20 22:44:33] [INFO ] Implicit Places using invariants in 144 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:44:33] [INFO ] Computed 202 place invariants in 2 ms
[2022-05-20 22:44:33] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 479 ms to find 0 implicit places.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:44:33] [INFO ] Computed 202 place invariants in 1 ms
[2022-05-20 22:44:33] [INFO ] Dead Transitions using invariants and state equation in 277 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 296 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), true, (NOT p0), (NOT p2), (NOT p3), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : RefineWMG-PT-100100-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=1 dest: 4}, { cond=(OR (AND (NOT p1) p2) (AND (NOT p1) p0)), acceptance={} source=1 dest: 5}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=1 dest: 6}, { cond=(OR (AND p1 p2) (AND p1 p0)), acceptance={} source=1 dest: 7}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p3), acceptance={} source=5 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=7 dest: 2}, { cond=(AND p0 (NOT p3)), acceptance={} source=7 dest: 3}]], initial=0, aps=[p1:(LT s238 1), p2:(GEQ s472 1), p0:(GEQ s468 1), p3:(GEQ s470 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-100100-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100100-LTLFireability-04 finished in 1376 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G((G(F(p0))||p1))) U X(p2)))'
Support contains 3 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 5 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:44:34] [INFO ] Computed 202 place invariants in 1 ms
[2022-05-20 22:44:34] [INFO ] Dead Transitions using invariants and state equation in 251 ms found 0 transitions.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:44:34] [INFO ] Computed 202 place invariants in 4 ms
[2022-05-20 22:44:34] [INFO ] Implicit Places using invariants in 218 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:44:34] [INFO ] Computed 202 place invariants in 2 ms
[2022-05-20 22:44:34] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 595 ms to find 0 implicit places.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:44:34] [INFO ] Computed 202 place invariants in 1 ms
[2022-05-20 22:44:35] [INFO ] Dead Transitions using invariants and state equation in 235 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 159 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-100100-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(GEQ s183 1), p0:(AND (GEQ s152 1) (GEQ s183 1)), p1:(GEQ s210 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 613 reset in 1354 ms.
Stack based approach found an accepted trace after 551 steps with 4 reset with depth 9 and stack size 9 in 9 ms.
FORMULA RefineWMG-PT-100100-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-100100-LTLFireability-05 finished in 2637 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((G(p0)||p1))&&X(p2))))'
Support contains 5 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 6 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:44:36] [INFO ] Computed 202 place invariants in 2 ms
[2022-05-20 22:44:36] [INFO ] Dead Transitions using invariants and state equation in 255 ms found 0 transitions.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:44:36] [INFO ] Computed 202 place invariants in 3 ms
[2022-05-20 22:44:37] [INFO ] Implicit Places using invariants in 190 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:44:37] [INFO ] Computed 202 place invariants in 6 ms
[2022-05-20 22:44:37] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 531 ms to find 0 implicit places.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:44:37] [INFO ] Computed 202 place invariants in 1 ms
[2022-05-20 22:44:37] [INFO ] Dead Transitions using invariants and state equation in 225 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p2)]
Running random walk in product with property : RefineWMG-PT-100100-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}, { cond=(OR p1 p0), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 2}]], initial=0, aps=[p1:(LT s417 1), p0:(OR (LT s496 1) (LT s497 1) (LT s499 1)), p2:(LT s37 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 950 steps with 0 reset in 15 ms.
FORMULA RefineWMG-PT-100100-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100100-LTLFireability-06 finished in 1225 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 504 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 297 edges and 504 vertex of which 198 / 504 are part of one of the 99 SCC in 4 ms
Free SCC test removed 99 places
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Reduce places removed 99 places and 0 transitions.
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 306 transition count 206
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 0 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 1 with 297 rules applied. Total rules applied 396 place count 108 transition count 107
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 1 with 96 rules applied. Total rules applied 492 place count 108 transition count 11
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 2 with 96 rules applied. Total rules applied 588 place count 12 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 588 place count 12 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 590 place count 11 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 592 place count 10 transition count 9
Applied a total of 592 rules in 31 ms. Remains 10 /504 variables (removed 494) and now considering 9/403 (removed 394) transitions.
// Phase 1: matrix 9 rows 10 cols
[2022-05-20 22:44:37] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:44:37] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
// Phase 1: matrix 9 rows 10 cols
[2022-05-20 22:44:37] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:44:37] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2022-05-20 22:44:37] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:44:37] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2022-05-20 22:44:37] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2022-05-20 22:44:37] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:44:38] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/504 places, 9/403 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/504 places, 9/403 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : RefineWMG-PT-100100-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s6 1) (LT s7 1) (LT s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-100100-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100100-LTLFireability-08 finished in 182 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&(F(p1)||p2)) U X(X((!X(p3)||G(p1))))))'
Support contains 8 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 12 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:44:38] [INFO ] Computed 202 place invariants in 1 ms
[2022-05-20 22:44:38] [INFO ] Dead Transitions using invariants and state equation in 249 ms found 0 transitions.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:44:38] [INFO ] Computed 202 place invariants in 2 ms
[2022-05-20 22:44:38] [INFO ] Implicit Places using invariants in 182 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:44:38] [INFO ] Computed 202 place invariants in 2 ms
[2022-05-20 22:44:38] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 524 ms to find 0 implicit places.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:44:38] [INFO ] Computed 202 place invariants in 1 ms
[2022-05-20 22:44:39] [INFO ] Dead Transitions using invariants and state equation in 231 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 668 ms :[(AND (NOT p1) p3), (AND p3 (NOT p1)), (AND (NOT p1) p3), (AND (NOT p1) p3), (AND p3 (NOT p1)), p3, (AND (NOT p1) p3), true, (AND (NOT p1) p3), (AND p3 (NOT p1)), (AND (NOT p1) p3), (AND (NOT p1) p3), (NOT p1), (AND (NOT p1) p3), (AND p3 (NOT p1)), (AND (NOT p1) p3), (AND p3 (NOT p1)), (AND (NOT p1) p3), (AND (NOT p1) p3), (NOT p1)]
Running random walk in product with property : RefineWMG-PT-100100-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 8}], [{ cond=(NOT p0), acceptance={} source=3 dest: 9}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 10}, { cond=p0, acceptance={} source=3 dest: 11}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}, { cond=p1, acceptance={} source=4 dest: 6}], [{ cond=p3, acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p1) p3), acceptance={} source=6 dest: 7}, { cond=(AND p1 p3), acceptance={} source=6 dest: 12}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=(NOT p1), acceptance={} source=8 dest: 13}], [{ cond=true, acceptance={} source=9 dest: 14}], [{ cond=(NOT p1), acceptance={} source=10 dest: 15}], [{ cond=(NOT p0), acceptance={} source=11 dest: 16}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=11 dest: 17}, { cond=p0, acceptance={} source=11 dest: 18}], [{ cond=(NOT p1), acceptance={} source=12 dest: 7}, { cond=p1, acceptance={} source=12 dest: 12}], [{ cond=(AND (NOT p1) p3), acceptance={} source=13 dest: 19}], [{ cond=(AND (NOT p1) p3), acceptance={} source=14 dest: 5}, { cond=(AND p1 p3), acceptance={} source=14 dest: 6}], [{ cond=(AND (NOT p1) p3), acceptance={} source=15 dest: 13}], [{ cond=p3, acceptance={} source=16 dest: 14}], [{ cond=(AND (NOT p1) p3), acceptance={} source=17 dest: 15}], [{ cond=(AND (NOT p0) p3), acceptance={} source=18 dest: 16}, { cond=(AND p0 (NOT p2) (NOT p1) p3), acceptance={} source=18 dest: 17}, { cond=(AND p0 p1 p3), acceptance={} source=18 dest: 18}, { cond=(AND p0 (NOT p1) p3), acceptance={0} source=18 dest: 18}], [{ cond=(NOT p1), acceptance={0} source=19 dest: 19}]], initial=0, aps=[p0:(GEQ s337 1), p2:(AND (GEQ s231 1) (GEQ s232 1) (GEQ s234 1)), p1:(GEQ s75 1), p3:(AND (GEQ s486 1) (GEQ s487 1) (GEQ s489 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 981 ms.
Product exploration explored 100000 steps with 25000 reset in 1041 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) (NOT p1) (NOT p3)), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT p1)), (X p0), true, (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 448 ms. Reduced automaton from 20 states, 33 edges and 4 AP to 14 states, 21 edges and 4 AP.
Stuttering acceptance computed with spot in 519 ms :[(AND (NOT p1) p3), (AND (NOT p1) p3), p3, (AND (NOT p1) p3), true, (AND (NOT p1) p3), (NOT p1), (AND (NOT p1) p3), (AND p3 (NOT p1)), (AND (NOT p1) p3), (AND p3 (NOT p1)), (AND (NOT p1) p3), (AND (NOT p1) p3), (NOT p1)]
Incomplete random walk after 10003 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 101196 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 101196 steps, saw 98618 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:44:46] [INFO ] Computed 202 place invariants in 1 ms
[2022-05-20 22:44:46] [INFO ] [Real]Absence check using 202 positive place invariants in 21 ms returned sat
[2022-05-20 22:44:46] [INFO ] After 316ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-20 22:44:46] [INFO ] [Nat]Absence check using 202 positive place invariants in 21 ms returned sat
[2022-05-20 22:44:46] [INFO ] After 221ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-05-20 22:44:47] [INFO ] After 439ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 131 ms.
[2022-05-20 22:44:47] [INFO ] After 728ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 7 different solutions.
Finished Parikh walk after 32316 steps, including 1 resets, run visited all 8 properties in 598 ms. (steps per millisecond=54 )
Parikh walk visited 8 properties in 597 ms.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1) (NOT p3)), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT p1)), (X p0), true, (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F (AND p3 (NOT p0))), (F p1), (F (AND p3 p1 p0)), (F (AND p3 (NOT p1) p0 (NOT p2))), (F p3), (F (AND p3 p1)), (F (AND p3 (NOT p1))), (F (AND p3 (NOT p1) p0))]
Knowledge based reduction with 8 factoid took 752 ms. Reduced automaton from 14 states, 21 edges and 4 AP to 14 states, 21 edges and 4 AP.
Stuttering acceptance computed with spot in 596 ms :[(AND (NOT p1) p3), (AND (NOT p1) p3), p3, (AND (NOT p1) p3), true, (AND (NOT p1) p3), (NOT p1), (AND (NOT p1) p3), (AND p3 (NOT p1)), (AND (NOT p1) p3), (AND p3 (NOT p1)), (AND (NOT p1) p3), (AND (NOT p1) p3), (NOT p1)]
Stuttering acceptance computed with spot in 757 ms :[(AND (NOT p1) p3), (AND (NOT p1) p3), p3, (AND (NOT p1) p3), true, (AND (NOT p1) p3), (NOT p1), (AND (NOT p1) p3), (AND p3 (NOT p1)), (AND (NOT p1) p3), (AND p3 (NOT p1)), (AND (NOT p1) p3), (AND (NOT p1) p3), (NOT p1)]
Support contains 8 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 11 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:44:49] [INFO ] Computed 202 place invariants in 2 ms
[2022-05-20 22:44:50] [INFO ] Dead Transitions using invariants and state equation in 284 ms found 0 transitions.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:44:50] [INFO ] Computed 202 place invariants in 1 ms
[2022-05-20 22:44:50] [INFO ] Implicit Places using invariants in 213 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:44:50] [INFO ] Computed 202 place invariants in 5 ms
[2022-05-20 22:44:50] [INFO ] Implicit Places using invariants and state equation in 401 ms returned []
Implicit Place search using SMT with State Equation took 616 ms to find 0 implicit places.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:44:50] [INFO ] Computed 202 place invariants in 4 ms
[2022-05-20 22:44:51] [INFO ] Dead Transitions using invariants and state equation in 261 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 504/504 places, 403/403 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 p3) (NOT p1) p0 (NOT p2)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 164 ms. Reduced automaton from 14 states, 21 edges and 4 AP to 14 states, 21 edges and 4 AP.
Stuttering acceptance computed with spot in 673 ms :[(AND (NOT p1) p3), (AND (NOT p1) p3), p3, (AND (NOT p1) p3), true, (AND (NOT p1) p3), (NOT p1), (AND (NOT p1) p3), (AND p3 (NOT p1)), (AND (NOT p1) p3), (AND p3 (NOT p1)), (AND (NOT p1) p3), (AND (NOT p1) p3), (NOT p1)]
Incomplete random walk after 10005 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 96996 steps, run timeout after 3013 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 96996 steps, saw 94538 distinct states, run finished after 3013 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:44:55] [INFO ] Computed 202 place invariants in 2 ms
[2022-05-20 22:44:55] [INFO ] [Real]Absence check using 202 positive place invariants in 20 ms returned sat
[2022-05-20 22:44:55] [INFO ] After 314ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-20 22:44:55] [INFO ] [Nat]Absence check using 202 positive place invariants in 27 ms returned sat
[2022-05-20 22:44:56] [INFO ] After 229ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-05-20 22:44:56] [INFO ] After 441ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 123 ms.
[2022-05-20 22:44:56] [INFO ] After 763ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 7 different solutions.
Finished Parikh walk after 19630 steps, including 0 resets, run visited all 8 properties in 247 ms. (steps per millisecond=79 )
Parikh walk visited 8 properties in 246 ms.
Knowledge obtained : [(AND (NOT p3) (NOT p1) p0 (NOT p2)), true]
False Knowledge obtained : [(F (AND p3 (NOT p0))), (F p1), (F (AND p3 p1 p0)), (F (AND p3 (NOT p1) p0 (NOT p2))), (F p3), (F (AND p3 p1)), (F (AND p3 (NOT p1))), (F (AND p3 (NOT p1) p0))]
Knowledge based reduction with 2 factoid took 356 ms. Reduced automaton from 14 states, 21 edges and 4 AP to 14 states, 21 edges and 4 AP.
Stuttering acceptance computed with spot in 688 ms :[(AND (NOT p1) p3), (AND (NOT p1) p3), p3, (AND (NOT p1) p3), true, (AND (NOT p1) p3), (NOT p1), (AND (NOT p1) p3), (AND p3 (NOT p1)), (AND (NOT p1) p3), (AND p3 (NOT p1)), (AND (NOT p1) p3), (AND (NOT p1) p3), (NOT p1)]
Stuttering acceptance computed with spot in 667 ms :[(AND (NOT p1) p3), (AND (NOT p1) p3), p3, (AND (NOT p1) p3), true, (AND (NOT p1) p3), (NOT p1), (AND (NOT p1) p3), (AND p3 (NOT p1)), (AND (NOT p1) p3), (AND p3 (NOT p1)), (AND (NOT p1) p3), (AND (NOT p1) p3), (NOT p1)]
Stuttering acceptance computed with spot in 629 ms :[(AND (NOT p1) p3), (AND (NOT p1) p3), p3, (AND (NOT p1) p3), true, (AND (NOT p1) p3), (NOT p1), (AND (NOT p1) p3), (AND p3 (NOT p1)), (AND (NOT p1) p3), (AND p3 (NOT p1)), (AND (NOT p1) p3), (AND (NOT p1) p3), (NOT p1)]
Product exploration explored 100000 steps with 25000 reset in 1085 ms.
Product exploration explored 100000 steps with 25000 reset in 927 ms.
Applying partial POR strategy [false, false, true, true, true, false, true, true, false, false, false, false, false, true]
Stuttering acceptance computed with spot in 637 ms :[(AND (NOT p1) p3), (AND (NOT p1) p3), p3, (AND (NOT p1) p3), true, (AND (NOT p1) p3), (NOT p1), (AND (NOT p1) p3), (AND p3 (NOT p1)), (AND (NOT p1) p3), (AND p3 (NOT p1)), (AND (NOT p1) p3), (AND (NOT p1) p3), (NOT p1)]
Support contains 8 out of 504 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 291 edges and 504 vertex of which 194 / 504 are part of one of the 97 SCC in 2 ms
Free SCC test removed 97 places
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Reduce places removed 97 places and 0 transitions.
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 0 with 96 rules applied. Total rules applied 97 place count 310 transition count 210
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 1 ms
Iterating global reduction 1 with 97 rules applied. Total rules applied 194 place count 310 transition count 210
Deduced a syphon composed of 97 places in 1 ms
Applied a total of 194 rules in 56 ms. Remains 310 /504 variables (removed 194) and now considering 210/403 (removed 193) transitions.
// Phase 1: matrix 210 rows 310 cols
[2022-05-20 22:45:02] [INFO ] Computed 105 place invariants in 1 ms
[2022-05-20 22:45:02] [INFO ] Dead Transitions using invariants and state equation in 167 ms found 0 transitions.
[2022-05-20 22:45:02] [INFO ] Redundant transitions in 22 ms returned []
// Phase 1: matrix 210 rows 310 cols
[2022-05-20 22:45:02] [INFO ] Computed 105 place invariants in 1 ms
[2022-05-20 22:45:02] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 310/504 places, 210/403 transitions.
Finished structural reductions, in 1 iterations. Remains : 310/504 places, 210/403 transitions.
Product exploration explored 100000 steps with 25000 reset in 1339 ms.
Product exploration explored 100000 steps with 25000 reset in 1183 ms.
Built C files in :
/tmp/ltsmin2300067761678526633
[2022-05-20 22:45:04] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2300067761678526633
Running compilation step : cd /tmp/ltsmin2300067761678526633;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 824 ms.
Running link step : cd /tmp/ltsmin2300067761678526633;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin2300067761678526633;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased888890177220608940.hoa' '--buchi-type=spotba'
LTSmin run took 5082 ms.
FORMULA RefineWMG-PT-100100-LTLFireability-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property RefineWMG-PT-100100-LTLFireability-09 finished in 32847 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(X(X(p0))) U G(F(X(X(p0))))))))'
Support contains 3 out of 504 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 297 edges and 504 vertex of which 198 / 504 are part of one of the 99 SCC in 1 ms
Free SCC test removed 99 places
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Reduce places removed 99 places and 0 transitions.
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 306 transition count 206
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 0 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 1 with 297 rules applied. Total rules applied 396 place count 108 transition count 107
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 1 with 96 rules applied. Total rules applied 492 place count 108 transition count 11
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 2 with 96 rules applied. Total rules applied 588 place count 12 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 588 place count 12 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 590 place count 11 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 592 place count 10 transition count 9
Applied a total of 592 rules in 19 ms. Remains 10 /504 variables (removed 494) and now considering 9/403 (removed 394) transitions.
// Phase 1: matrix 9 rows 10 cols
[2022-05-20 22:45:10] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 22:45:10] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
// Phase 1: matrix 9 rows 10 cols
[2022-05-20 22:45:10] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 22:45:10] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2022-05-20 22:45:10] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 22:45:10] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2022-05-20 22:45:11] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2022-05-20 22:45:11] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 22:45:11] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/504 places, 9/403 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/504 places, 9/403 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-100100-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s6 1) (GEQ s7 1) (GEQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-100100-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100100-LTLFireability-10 finished in 193 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X((X((G(p0)&&F(p1)))||p2)))))'
Support contains 3 out of 504 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 295 edges and 504 vertex of which 196 / 504 are part of one of the 98 SCC in 1 ms
Free SCC test removed 98 places
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Reduce places removed 98 places and 0 transitions.
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 308 transition count 208
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 0 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 1 with 297 rules applied. Total rules applied 395 place count 110 transition count 109
Drop transitions removed 93 transitions
Trivial Post-agglo rules discarded 93 transitions
Performed 93 trivial Post agglomeration. Transition count delta: 93
Iterating post reduction 1 with 93 rules applied. Total rules applied 488 place count 110 transition count 16
Reduce places removed 93 places and 0 transitions.
Iterating post reduction 2 with 93 rules applied. Total rules applied 581 place count 17 transition count 16
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 581 place count 17 transition count 13
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 587 place count 14 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 589 place count 13 transition count 12
Applied a total of 589 rules in 11 ms. Remains 13 /504 variables (removed 491) and now considering 12/403 (removed 391) transitions.
// Phase 1: matrix 12 rows 13 cols
[2022-05-20 22:45:11] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-20 22:45:11] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
// Phase 1: matrix 12 rows 13 cols
[2022-05-20 22:45:11] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-20 22:45:11] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 12 rows 13 cols
[2022-05-20 22:45:11] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-20 22:45:11] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2022-05-20 22:45:11] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 12 rows 13 cols
[2022-05-20 22:45:11] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-20 22:45:11] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/504 places, 12/403 transitions.
Finished structural reductions, in 1 iterations. Remains : 13/504 places, 12/403 transitions.
Stuttering acceptance computed with spot in 139 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-100100-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={1} source=0 dest: 0}, { cond=(NOT p2), acceptance={0, 1} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={1} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p2 p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={1} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p2 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={1} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p2:(GEQ s6 1), p0:(LT s9 1), p1:(GEQ s11 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-100100-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100100-LTLFireability-11 finished in 265 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U !(F(!G(X(p0)))||p0)))'
Support contains 3 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 6 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:45:11] [INFO ] Computed 202 place invariants in 1 ms
[2022-05-20 22:45:11] [INFO ] Dead Transitions using invariants and state equation in 219 ms found 0 transitions.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:45:11] [INFO ] Computed 202 place invariants in 4 ms
[2022-05-20 22:45:11] [INFO ] Implicit Places using invariants in 143 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:45:11] [INFO ] Computed 202 place invariants in 0 ms
[2022-05-20 22:45:12] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 449 ms to find 0 implicit places.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:45:12] [INFO ] Computed 202 place invariants in 1 ms
[2022-05-20 22:45:12] [INFO ] Dead Transitions using invariants and state equation in 177 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), true, true]
Running random walk in product with property : RefineWMG-PT-100100-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=2, aps=[p0:(AND (GEQ s441 1) (GEQ s442 1) (GEQ s444 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-100100-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100100-LTLFireability-12 finished in 933 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((F(p1)&&p0))))))'
Support contains 2 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 4 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:45:12] [INFO ] Computed 202 place invariants in 1 ms
[2022-05-20 22:45:12] [INFO ] Dead Transitions using invariants and state equation in 220 ms found 0 transitions.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:45:12] [INFO ] Computed 202 place invariants in 2 ms
[2022-05-20 22:45:12] [INFO ] Implicit Places using invariants in 152 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:45:12] [INFO ] Computed 202 place invariants in 1 ms
[2022-05-20 22:45:12] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 434 ms to find 0 implicit places.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:45:12] [INFO ] Computed 202 place invariants in 1 ms
[2022-05-20 22:45:13] [INFO ] Dead Transitions using invariants and state equation in 244 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : RefineWMG-PT-100100-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s335 1) (GEQ s292 1)), p1:(GEQ s292 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-100100-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100100-LTLFireability-13 finished in 1138 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(F((X(G(p0))||p0))))||G(p1)))'
Support contains 2 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 7 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:45:13] [INFO ] Computed 202 place invariants in 1 ms
[2022-05-20 22:45:13] [INFO ] Dead Transitions using invariants and state equation in 214 ms found 0 transitions.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:45:13] [INFO ] Computed 202 place invariants in 1 ms
[2022-05-20 22:45:13] [INFO ] Implicit Places using invariants in 171 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:45:13] [INFO ] Computed 202 place invariants in 1 ms
[2022-05-20 22:45:14] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 451 ms to find 0 implicit places.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:45:14] [INFO ] Computed 202 place invariants in 1 ms
[2022-05-20 22:45:14] [INFO ] Dead Transitions using invariants and state equation in 236 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-100100-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LT s382 1), p1:(GEQ s18 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1525 ms.
Stack based approach found an accepted trace after 95 steps with 0 reset with depth 96 and stack size 96 in 1 ms.
FORMULA RefineWMG-PT-100100-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-100100-LTLFireability-14 finished in 2557 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(G(X(G(X(G(X(X(p0)))))))))))'
Support contains 3 out of 504 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 297 edges and 504 vertex of which 198 / 504 are part of one of the 99 SCC in 1 ms
Free SCC test removed 99 places
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Reduce places removed 99 places and 0 transitions.
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 306 transition count 206
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 0 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 1 with 297 rules applied. Total rules applied 396 place count 108 transition count 107
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 1 with 96 rules applied. Total rules applied 492 place count 108 transition count 11
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 2 with 96 rules applied. Total rules applied 588 place count 12 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 588 place count 12 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 590 place count 11 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 592 place count 10 transition count 9
Applied a total of 592 rules in 9 ms. Remains 10 /504 variables (removed 494) and now considering 9/403 (removed 394) transitions.
// Phase 1: matrix 9 rows 10 cols
[2022-05-20 22:45:16] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:45:16] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
// Phase 1: matrix 9 rows 10 cols
[2022-05-20 22:45:16] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:45:16] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2022-05-20 22:45:16] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:45:16] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2022-05-20 22:45:16] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2022-05-20 22:45:16] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:45:16] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/504 places, 9/403 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/504 places, 9/403 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : RefineWMG-PT-100100-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s6 1) (GEQ s7 1) (GEQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-100100-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100100-LTLFireability-15 finished in 185 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p1)||p0))))'
Found a SL insensitive property : RefineWMG-PT-100100-LTLFireability-03
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 504 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 295 edges and 504 vertex of which 196 / 504 are part of one of the 98 SCC in 1 ms
Free SCC test removed 98 places
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Reduce places removed 98 places and 0 transitions.
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 308 transition count 208
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 0 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 1 with 297 rules applied. Total rules applied 395 place count 110 transition count 109
Drop transitions removed 93 transitions
Trivial Post-agglo rules discarded 93 transitions
Performed 93 trivial Post agglomeration. Transition count delta: 93
Iterating post reduction 1 with 93 rules applied. Total rules applied 488 place count 110 transition count 16
Reduce places removed 93 places and 0 transitions.
Iterating post reduction 2 with 93 rules applied. Total rules applied 581 place count 17 transition count 16
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 581 place count 17 transition count 13
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 587 place count 14 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 589 place count 13 transition count 12
Applied a total of 589 rules in 10 ms. Remains 13 /504 variables (removed 491) and now considering 12/403 (removed 391) transitions.
// Phase 1: matrix 12 rows 13 cols
[2022-05-20 22:45:16] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-20 22:45:16] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
// Phase 1: matrix 12 rows 13 cols
[2022-05-20 22:45:16] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-20 22:45:16] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 12 rows 13 cols
[2022-05-20 22:45:16] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-20 22:45:16] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
// Phase 1: matrix 12 rows 13 cols
[2022-05-20 22:45:16] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-20 22:45:16] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 13/504 places, 12/403 transitions.
Finished structural reductions, in 1 iterations. Remains : 13/504 places, 12/403 transitions.
Running random walk in product with property : RefineWMG-PT-100100-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(LT s8 1), p0:(OR (GEQ s5 1) (GEQ s12 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 280 ms.
Product exploration explored 100000 steps with 0 reset in 199 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1)), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 249 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 132 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Finished random walk after 620 steps, including 0 resets, run visited all 4 properties in 1 ms. (steps per millisecond=620 )
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1)), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (AND p1 p0))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 6 factoid took 348 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 13 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13/13 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 13 cols
[2022-05-20 22:45:18] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-20 22:45:18] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
// Phase 1: matrix 12 rows 13 cols
[2022-05-20 22:45:18] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-20 22:45:18] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 12 rows 13 cols
[2022-05-20 22:45:18] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-20 22:45:18] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
// Phase 1: matrix 12 rows 13 cols
[2022-05-20 22:45:18] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-20 22:45:18] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 13/13 places, 12/12 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (X (AND p1 p0))), (X (X p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 262 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 145 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Finished random walk after 728 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=364 )
Knowledge obtained : [(AND p1 p0), (X p0), (X (X (AND p1 p0))), (X (X p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (AND p1 p0))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 6 factoid took 327 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 130 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 149 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 142 ms.
Product exploration explored 100000 steps with 0 reset in 145 ms.
Built C files in :
/tmp/ltsmin5305880038427633875
[2022-05-20 22:45:19] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5305880038427633875
Running compilation step : cd /tmp/ltsmin5305880038427633875;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 120 ms.
Running link step : cd /tmp/ltsmin5305880038427633875;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin5305880038427633875;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10663221978665659430.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 13 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13/13 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 13 cols
[2022-05-20 22:45:34] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-20 22:45:34] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
// Phase 1: matrix 12 rows 13 cols
[2022-05-20 22:45:34] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-20 22:45:34] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 12 rows 13 cols
[2022-05-20 22:45:34] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-20 22:45:34] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
// Phase 1: matrix 12 rows 13 cols
[2022-05-20 22:45:34] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-20 22:45:34] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 13/13 places, 12/12 transitions.
Built C files in :
/tmp/ltsmin7419257615035809290
[2022-05-20 22:45:35] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7419257615035809290
Running compilation step : cd /tmp/ltsmin7419257615035809290;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 100 ms.
Running link step : cd /tmp/ltsmin7419257615035809290;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin7419257615035809290;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14289122243716459216.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 22:45:50] [INFO ] Flatten gal took : 2 ms
[2022-05-20 22:45:50] [INFO ] Flatten gal took : 1 ms
[2022-05-20 22:45:50] [INFO ] Time to serialize gal into /tmp/LTL15685730712211517704.gal : 1 ms
[2022-05-20 22:45:50] [INFO ] Time to serialize properties into /tmp/LTL9386896767451084393.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15685730712211517704.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9386896767451084393.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1568573...267
Read 1 LTL properties
Checking formula 0 : !((X(G(((X("(p237<1)"))||("(p209>=1)"))||("(p270>=1)")))))
Formula 0 simplified : !XG("(p209>=1)" | "(p270>=1)" | X"(p237<1)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2022-05-20 22:46:05] [INFO ] Flatten gal took : 2 ms
[2022-05-20 22:46:05] [INFO ] Applying decomposition
[2022-05-20 22:46:05] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph14120411799888265055.txt' '-o' '/tmp/graph14120411799888265055.bin' '-w' '/tmp/graph14120411799888265055.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14120411799888265055.bin' '-l' '-1' '-v' '-w' '/tmp/graph14120411799888265055.weights' '-q' '0' '-e' '0.001'
[2022-05-20 22:46:05] [INFO ] Decomposing Gal with order
[2022-05-20 22:46:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 22:46:05] [INFO ] Flatten gal took : 1 ms
[2022-05-20 22:46:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-20 22:46:05] [INFO ] Time to serialize gal into /tmp/LTL9116964248525304721.gal : 0 ms
[2022-05-20 22:46:05] [INFO ] Time to serialize properties into /tmp/LTL7107347572295206515.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9116964248525304721.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7107347572295206515.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9116964...245
Read 1 LTL properties
Checking formula 0 : !((X(G(((X("(u3.p237<1)"))||("(u2.p209>=1)"))||("(u5.p270>=1)")))))
Formula 0 simplified : !XG("(u2.p209>=1)" | "(u5.p270>=1)" | X"(u3.p237<1)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8913350192099027777
[2022-05-20 22:46:20] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8913350192099027777
Running compilation step : cd /tmp/ltsmin8913350192099027777;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 114 ms.
Running link step : cd /tmp/ltsmin8913350192099027777;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin8913350192099027777;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((X((LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property RefineWMG-PT-100100-LTLFireability-03 finished in 79139 ms.
[2022-05-20 22:46:35] [INFO ] Flatten gal took : 40 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13581312344861687608
[2022-05-20 22:46:35] [INFO ] Computing symmetric may disable matrix : 403 transitions.
[2022-05-20 22:46:35] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 22:46:35] [INFO ] Computing symmetric may enable matrix : 403 transitions.
[2022-05-20 22:46:35] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 22:46:35] [INFO ] Applying decomposition
[2022-05-20 22:46:35] [INFO ] Flatten gal took : 15 ms
[2022-05-20 22:46:35] [INFO ] Computing Do-Not-Accords matrix : 403 transitions.
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12439464528498573636.txt' '-o' '/tmp/graph12439464528498573636.bin' '-w' '/tmp/graph12439464528498573636.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12439464528498573636.bin' '-l' '-1' '-v' '-w' '/tmp/graph12439464528498573636.weights' '-q' '0' '-e' '0.001'
[2022-05-20 22:46:35] [INFO ] Decomposing Gal with order
[2022-05-20 22:46:35] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 22:46:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 22:46:35] [INFO ] Built C files in 96ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13581312344861687608
Running compilation step : cd /tmp/ltsmin13581312344861687608;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-20 22:46:35] [INFO ] Flatten gal took : 24 ms
[2022-05-20 22:46:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-20 22:46:35] [INFO ] Time to serialize gal into /tmp/LTLFireability12124651837962232309.gal : 4 ms
[2022-05-20 22:46:35] [INFO ] Time to serialize properties into /tmp/LTLFireability473769876883616053.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12124651837962232309.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability473769876883616053.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...267
Read 1 LTL properties
Checking formula 0 : !((X(G(((X("(i17.u118.p237<1)"))||("(i14.u104.p209>=1)"))||("(i19.u134.p270>=1)")))))
Formula 0 simplified : !XG("(i14.u104.p209>=1)" | "(i19.u134.p270>=1)" | X"(i17.u118.p237<1)")
Compilation finished in 794 ms.
Running link step : cd /tmp/ltsmin13581312344861687608;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin13581312344861687608;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((X((LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.011: LTL layer: formula: X([]((X((LTLAPp1==true))||(LTLAPp0==true))))
pins2lts-mc-linux64( 2/ 8), 0.011: "X([]((X((LTLAPp1==true))||(LTLAPp0==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.011: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.017: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.017: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.024: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.025: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.027: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.034: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.035: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.033: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.036: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.042: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.131: DFS-FIFO for weak LTL, using special progress label 406
pins2lts-mc-linux64( 0/ 8), 0.131: There are 407 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.131: State length is 505, there are 410 groups
pins2lts-mc-linux64( 0/ 8), 0.131: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.131: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.131: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.131: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 0.687: ~1 levels ~960 states ~99328 transitions
pins2lts-mc-linux64( 4/ 8), 0.935: ~1 levels ~1920 states ~199152 transitions
pins2lts-mc-linux64( 4/ 8), 1.525: ~1 levels ~3840 states ~398392 transitions
pins2lts-mc-linux64( 2/ 8), 2.258: ~1 levels ~7680 states ~790432 transitions
pins2lts-mc-linux64( 2/ 8), 3.099: ~1 levels ~15360 states ~1581368 transitions
pins2lts-mc-linux64( 2/ 8), 4.607: ~1 levels ~30720 states ~3167632 transitions
pins2lts-mc-linux64( 2/ 8), 7.648: ~1 levels ~61440 states ~6357760 transitions
pins2lts-mc-linux64( 2/ 8), 13.113: ~1 levels ~122880 states ~12742224 transitions
pins2lts-mc-linux64( 2/ 8), 24.697: ~1 levels ~245760 states ~25514536 transitions
pins2lts-mc-linux64( 2/ 8), 47.118: ~1 levels ~491520 states ~51061104 transitions
pins2lts-mc-linux64( 2/ 8), 94.178: ~1 levels ~983040 states ~102476704 transitions
pins2lts-mc-linux64( 0/ 8), 186.184: ~1 levels ~1966080 states ~206141440 transitions
pins2lts-mc-linux64( 0/ 8), 369.380: ~1 levels ~3932160 states ~412428304 transitions
pins2lts-mc-linux64( 4/ 8), 414.818: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 415.671:
pins2lts-mc-linux64( 0/ 8), 415.671: mean standard work distribution: 1.4% (states) 1.1% (transitions)
pins2lts-mc-linux64( 0/ 8), 415.671:
pins2lts-mc-linux64( 0/ 8), 415.671: Explored 4187487 states 439925983 transitions, fanout: 105.057
pins2lts-mc-linux64( 0/ 8), 415.671: Total exploration time 415.480 sec (414.690 sec minimum, 414.940 sec on average)
pins2lts-mc-linux64( 0/ 8), 415.671: States per second: 10079, Transitions per second: 1058838
pins2lts-mc-linux64( 0/ 8), 415.671:
pins2lts-mc-linux64( 0/ 8), 415.671: Progress states detected: 134217096
pins2lts-mc-linux64( 0/ 8), 415.671: Redundant explorations: -96.8801
pins2lts-mc-linux64( 0/ 8), 415.671:
pins2lts-mc-linux64( 0/ 8), 415.671: Queue width: 8B, total height: 160686384, memory: 1225.94MB
pins2lts-mc-linux64( 0/ 8), 415.671: Tree memory: 1095.0MB, 8.6 B/state, compr.: 0.4%
pins2lts-mc-linux64( 0/ 8), 415.671: Tree fill ratio (roots/leafs): 99.0%/27.0%
pins2lts-mc-linux64( 0/ 8), 415.671: Stored 406 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 415.671: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 415.671: Est. total memory use: 2321.0MB (~2249.9MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin13581312344861687608;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((X((LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin13581312344861687608;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((X((LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-20 23:07:51] [INFO ] Flatten gal took : 33 ms
[2022-05-20 23:07:51] [INFO ] Time to serialize gal into /tmp/LTLFireability10321528562048152132.gal : 4 ms
[2022-05-20 23:07:51] [INFO ] Time to serialize properties into /tmp/LTLFireability7579576676542465989.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10321528562048152132.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7579576676542465989.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...289
Read 1 LTL properties
Checking formula 0 : !((X(G(((X("(p237<1)"))||("(p209>=1)"))||("(p270>=1)")))))
Formula 0 simplified : !XG("(p209>=1)" | "(p270>=1)" | X"(p237<1)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2022-05-20 23:29:07] [INFO ] Flatten gal took : 21 ms
[2022-05-20 23:29:07] [INFO ] Input system was already deterministic with 403 transitions.
[2022-05-20 23:29:07] [INFO ] Transformed 504 places.
[2022-05-20 23:29:07] [INFO ] Transformed 403 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-20 23:29:08] [INFO ] Time to serialize gal into /tmp/LTLFireability12506742072632074332.gal : 2 ms
[2022-05-20 23:29:08] [INFO ] Time to serialize properties into /tmp/LTLFireability1272947981863586158.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12506742072632074332.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1272947981863586158.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...334
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(G(((X("(p237<1)"))||("(p209>=1)"))||("(p270>=1)")))))
Formula 0 simplified : !XG("(p209>=1)" | "(p270>=1)" | X"(p237<1)")

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="RefineWMG-PT-100100"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is RefineWMG-PT-100100, 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 r186-tajo-165281572400572"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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