Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 6.4K Feb 26 15:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 15:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 15:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 15:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 15:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Feb 26 15:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 15:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 15:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 83K Mar 5 18:22 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 DES-PT-40a-LTLFireability-00
FORMULA_NAME DES-PT-40a-LTLFireability-01
FORMULA_NAME DES-PT-40a-LTLFireability-02
FORMULA_NAME DES-PT-40a-LTLFireability-03
FORMULA_NAME DES-PT-40a-LTLFireability-04
FORMULA_NAME DES-PT-40a-LTLFireability-05
FORMULA_NAME DES-PT-40a-LTLFireability-06
FORMULA_NAME DES-PT-40a-LTLFireability-07
FORMULA_NAME DES-PT-40a-LTLFireability-08
FORMULA_NAME DES-PT-40a-LTLFireability-09
FORMULA_NAME DES-PT-40a-LTLFireability-10
FORMULA_NAME DES-PT-40a-LTLFireability-11
FORMULA_NAME DES-PT-40a-LTLFireability-12
FORMULA_NAME DES-PT-40a-LTLFireability-13
FORMULA_NAME DES-PT-40a-LTLFireability-14
FORMULA_NAME DES-PT-40a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678303926125

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-40a
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-08 19:32:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 19:32:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 19:32:07] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2023-03-08 19:32:07] [INFO ] Transformed 274 places.
[2023-03-08 19:32:07] [INFO ] Transformed 231 transitions.
[2023-03-08 19:32:07] [INFO ] Found NUPN structural information;
[2023-03-08 19:32:07] [INFO ] Parsed PT model containing 274 places and 231 transitions and 1116 arcs in 124 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA DES-PT-40a-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40a-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40a-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40a-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 55 out of 274 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 217/217 transitions.
Applied a total of 0 rules in 124 ms. Remains 274 /274 variables (removed 0) and now considering 217/217 (removed 0) transitions.
// Phase 1: matrix 217 rows 274 cols
[2023-03-08 19:32:08] [INFO ] Computed 59 place invariants in 23 ms
[2023-03-08 19:32:08] [INFO ] Implicit Places using invariants in 305 ms returned [171]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 413 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 273/274 places, 217/217 transitions.
Applied a total of 0 rules in 21 ms. Remains 273 /273 variables (removed 0) and now considering 217/217 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 559 ms. Remains : 273/274 places, 217/217 transitions.
Support contains 55 out of 273 places after structural reductions.
[2023-03-08 19:32:08] [INFO ] Flatten gal took : 49 ms
[2023-03-08 19:32:08] [INFO ] Flatten gal took : 23 ms
[2023-03-08 19:32:08] [INFO ] Input system was already deterministic with 217 transitions.
Support contains 53 out of 273 places (down from 55) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 236 resets, run finished after 454 ms. (steps per millisecond=22 ) properties (out of 31) seen :10
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Running SMT prover for 21 properties.
// Phase 1: matrix 217 rows 273 cols
[2023-03-08 19:32:09] [INFO ] Computed 58 place invariants in 8 ms
[2023-03-08 19:32:09] [INFO ] [Real]Absence check using 33 positive place invariants in 8 ms returned sat
[2023-03-08 19:32:09] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 16 ms returned sat
[2023-03-08 19:32:09] [INFO ] After 246ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:21
[2023-03-08 19:32:09] [INFO ] [Nat]Absence check using 33 positive place invariants in 10 ms returned sat
[2023-03-08 19:32:09] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 65 ms returned sat
[2023-03-08 19:32:15] [INFO ] After 4789ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :20
[2023-03-08 19:32:17] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 4 ms to minimize.
[2023-03-08 19:32:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 302 ms
[2023-03-08 19:32:19] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2023-03-08 19:32:19] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2023-03-08 19:32:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 162 ms
[2023-03-08 19:32:19] [INFO ] After 9363ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :20
Attempting to minimize the solution found.
Minimization took 5452 ms.
[2023-03-08 19:32:25] [INFO ] After 15580ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :20
Fused 21 Parikh solutions to 20 different solutions.
Parikh walk visited 14 properties in 800 ms.
Support contains 21 out of 273 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 273/273 places, 217/217 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 273 transition count 215
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 272 transition count 214
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 272 transition count 214
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 272 transition count 214
Applied a total of 7 rules in 42 ms. Remains 272 /273 variables (removed 1) and now considering 214/217 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 272/273 places, 214/217 transitions.
Incomplete random walk after 10000 steps, including 131 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 905237 steps, run timeout after 3001 ms. (steps per millisecond=301 ) properties seen :{}
Probabilistic random walk after 905237 steps, saw 128975 distinct states, run finished after 3002 ms. (steps per millisecond=301 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 214 rows 272 cols
[2023-03-08 19:32:29] [INFO ] Computed 60 place invariants in 6 ms
[2023-03-08 19:32:29] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 19:32:29] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-08 19:32:29] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-08 19:32:29] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 19:32:29] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 84 ms returned sat
[2023-03-08 19:32:29] [INFO ] After 306ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-08 19:32:29] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 19:32:30] [INFO ] After 186ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-08 19:32:30] [INFO ] After 457ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 219 ms.
[2023-03-08 19:32:30] [INFO ] After 1175ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 258 ms.
Support contains 21 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 214/214 transitions.
Applied a total of 0 rules in 12 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 272/272 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 214/214 transitions.
Applied a total of 0 rules in 12 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-08 19:32:30] [INFO ] Invariant cache hit.
[2023-03-08 19:32:31] [INFO ] Implicit Places using invariants in 134 ms returned []
[2023-03-08 19:32:31] [INFO ] Invariant cache hit.
[2023-03-08 19:32:31] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 19:32:31] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
[2023-03-08 19:32:31] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-08 19:32:31] [INFO ] Invariant cache hit.
[2023-03-08 19:32:31] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 562 ms. Remains : 272/272 places, 214/214 transitions.
Applied a total of 0 rules in 9 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Running SMT prover for 6 properties.
[2023-03-08 19:32:31] [INFO ] Invariant cache hit.
[2023-03-08 19:32:31] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 19:32:31] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 15 ms returned sat
[2023-03-08 19:32:31] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-08 19:32:31] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 19:32:31] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 68 ms returned sat
[2023-03-08 19:32:32] [INFO ] After 376ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-08 19:32:32] [INFO ] After 610ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 226 ms.
[2023-03-08 19:32:32] [INFO ] After 1070ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA DES-PT-40a-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 176 stabilizing places and 171 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(!p0)&&((!p1 U (p2||G(!p1))) U p3)) U G(p1)))'
Support contains 9 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 217/217 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 272 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 272 transition count 216
Applied a total of 2 rules in 8 ms. Remains 272 /273 variables (removed 1) and now considering 216/217 (removed 1) transitions.
// Phase 1: matrix 216 rows 272 cols
[2023-03-08 19:32:33] [INFO ] Computed 58 place invariants in 9 ms
[2023-03-08 19:32:33] [INFO ] Implicit Places using invariants in 139 ms returned []
[2023-03-08 19:32:33] [INFO ] Invariant cache hit.
[2023-03-08 19:32:33] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
[2023-03-08 19:32:33] [INFO ] Invariant cache hit.
[2023-03-08 19:32:33] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 272/273 places, 216/217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 525 ms. Remains : 272/273 places, 216/217 transitions.
Stuttering acceptance computed with spot in 358 ms :[(NOT p1), p0, (NOT p1), (AND p1 (NOT p2)), (NOT p3), (AND p0 (NOT p1)), true]
Running random walk in product with property : DES-PT-40a-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(OR (AND p1 p3) (AND p1 p2)), acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=0 dest: 4}, { cond=(OR (AND p1 p3) (AND p1 p2)), acceptance={} source=0 dest: 5}], [{ cond=p0, acceptance={} source=1 dest: 6}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(OR (AND (NOT p1) (NOT p3)) (AND (NOT p3) p2)), acceptance={0} source=4 dest: 4}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=(OR (AND p1 p3 p0) (AND p1 p2 p0)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(AND (EQ s82 1) (EQ s188 1)), p3:(AND (EQ s161 1) (EQ s173 1)), p2:(AND (NOT (AND (EQ s48 1) (EQ s267 1))) (NOT (AND (EQ s82 1) (EQ s188 1)))), p0:(AND...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 7839 steps with 1943 reset in 123 ms.
FORMULA DES-PT-40a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40a-LTLFireability-00 finished in 1067 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(p1)||p0))&&X(G(p2))))'
Support contains 4 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 217/217 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 272 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 272 transition count 216
Applied a total of 2 rules in 9 ms. Remains 272 /273 variables (removed 1) and now considering 216/217 (removed 1) transitions.
[2023-03-08 19:32:34] [INFO ] Invariant cache hit.
[2023-03-08 19:32:34] [INFO ] Implicit Places using invariants in 136 ms returned []
[2023-03-08 19:32:34] [INFO ] Invariant cache hit.
[2023-03-08 19:32:34] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
[2023-03-08 19:32:34] [INFO ] Invariant cache hit.
[2023-03-08 19:32:34] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 272/273 places, 216/217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 516 ms. Remains : 272/273 places, 216/217 transitions.
Stuttering acceptance computed with spot in 144 ms :[true, (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : DES-PT-40a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 2}, { cond=(AND p0 p2), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (EQ s44 0) (EQ s267 0)), p1:(OR (EQ s44 0) (EQ s267 0)), p2:(AND (EQ s204 1) (EQ s221 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DES-PT-40a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40a-LTLFireability-02 finished in 684 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||X(G(p1))) U (F(p3)&&X(F(p1))&&p2)))'
Support contains 6 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 217/217 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 272 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 272 transition count 216
Applied a total of 2 rules in 12 ms. Remains 272 /273 variables (removed 1) and now considering 216/217 (removed 1) transitions.
[2023-03-08 19:32:34] [INFO ] Invariant cache hit.
[2023-03-08 19:32:34] [INFO ] Implicit Places using invariants in 131 ms returned []
[2023-03-08 19:32:34] [INFO ] Invariant cache hit.
[2023-03-08 19:32:35] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
[2023-03-08 19:32:35] [INFO ] Invariant cache hit.
[2023-03-08 19:32:35] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 272/273 places, 216/217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 532 ms. Remains : 272/273 places, 216/217 transitions.
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p3) (NOT p2) (NOT p1)), (NOT p1), (NOT p3), (NOT p1), true]
Running random walk in product with property : DES-PT-40a-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND p2 (NOT p3)), acceptance={0} source=0 dest: 2}, { cond=p2, acceptance={0} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p3), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s220 1) (EQ s236 1)), p0:(AND (EQ s257 1) (EQ s266 1)), p3:(AND (EQ s136 1) (EQ s164 1)), p1:(AND (EQ s220 1) (EQ s236 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DES-PT-40a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40a-LTLFireability-03 finished in 727 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 273 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 273/273 places, 217/217 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 271 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 271 transition count 215
Applied a total of 2 rules in 21 ms. Remains 271 /273 variables (removed 2) and now considering 215/217 (removed 2) transitions.
// Phase 1: matrix 215 rows 271 cols
[2023-03-08 19:32:35] [INFO ] Computed 58 place invariants in 6 ms
[2023-03-08 19:32:35] [INFO ] Implicit Places using invariants in 141 ms returned []
[2023-03-08 19:32:35] [INFO ] Invariant cache hit.
[2023-03-08 19:32:35] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
[2023-03-08 19:32:35] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-08 19:32:35] [INFO ] Invariant cache hit.
[2023-03-08 19:32:36] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 271/273 places, 215/217 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 576 ms. Remains : 271/273 places, 215/217 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-40a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s37 1) (EQ s190 1) (EQ s192 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 24 steps with 0 reset in 1 ms.
FORMULA DES-PT-40a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40a-LTLFireability-05 finished in 614 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 217/217 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 272 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 272 transition count 216
Applied a total of 2 rules in 9 ms. Remains 272 /273 variables (removed 1) and now considering 216/217 (removed 1) transitions.
// Phase 1: matrix 216 rows 272 cols
[2023-03-08 19:32:36] [INFO ] Computed 58 place invariants in 6 ms
[2023-03-08 19:32:36] [INFO ] Implicit Places using invariants in 147 ms returned []
[2023-03-08 19:32:36] [INFO ] Invariant cache hit.
[2023-03-08 19:32:36] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
[2023-03-08 19:32:36] [INFO ] Invariant cache hit.
[2023-03-08 19:32:36] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 272/273 places, 216/217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 527 ms. Remains : 272/273 places, 216/217 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-40a-LTLFireability-07 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:(NEQ s175 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 33333 reset in 345 ms.
Product exploration explored 100000 steps with 33333 reset in 396 ms.
Computed a total of 175 stabilizing places and 170 stable transitions
Computed a total of 175 stabilizing places and 170 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 59 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-40a-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-40a-LTLFireability-07 finished in 1456 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||(G(p1) U X(G(p2))))))'
Support contains 4 out of 273 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 273/273 places, 217/217 transitions.
Applied a total of 0 rules in 16 ms. Remains 273 /273 variables (removed 0) and now considering 217/217 (removed 0) transitions.
// Phase 1: matrix 217 rows 273 cols
[2023-03-08 19:32:37] [INFO ] Computed 58 place invariants in 5 ms
[2023-03-08 19:32:37] [INFO ] Implicit Places using invariants in 206 ms returned []
[2023-03-08 19:32:37] [INFO ] Invariant cache hit.
[2023-03-08 19:32:38] [INFO ] Implicit Places using invariants and state equation in 922 ms returned []
Implicit Place search using SMT with State Equation took 1132 ms to find 0 implicit places.
[2023-03-08 19:32:38] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-08 19:32:38] [INFO ] Invariant cache hit.
[2023-03-08 19:32:38] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1320 ms. Remains : 273/273 places, 217/217 transitions.
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p2))]
Running random walk in product with property : DES-PT-40a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p0 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s87 0) (EQ s188 0)), p2:(AND (EQ s172 1) (EQ s246 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2221 reset in 258 ms.
Product exploration explored 100000 steps with 2198 reset in 336 ms.
Computed a total of 176 stabilizing places and 171 stable transitions
Computed a total of 176 stabilizing places and 171 stable transitions
Detected a total of 176/273 stabilizing places and 171/217 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 302 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 226 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 51 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-08 19:32:39] [INFO ] Invariant cache hit.
[2023-03-08 19:32:39] [INFO ] [Real]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-08 19:32:40] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 13 ms returned sat
[2023-03-08 19:32:40] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 19:32:40] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 19:32:40] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 50 ms returned sat
[2023-03-08 19:32:40] [INFO ] After 726ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 19:32:40] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
[2023-03-08 19:32:41] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2023-03-08 19:32:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 163 ms
[2023-03-08 19:32:41] [INFO ] After 979ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 123 ms.
[2023-03-08 19:32:41] [INFO ] After 1271ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 33 ms.
Support contains 4 out of 273 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 273/273 places, 217/217 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 273 transition count 215
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 272 transition count 214
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 272 transition count 214
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 9 place count 272 transition count 214
Applied a total of 9 rules in 27 ms. Remains 272 /273 variables (removed 1) and now considering 214/217 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 272/273 places, 214/217 transitions.
Incomplete random walk after 10000 steps, including 136 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1112545 steps, run timeout after 3001 ms. (steps per millisecond=370 ) properties seen :{}
Probabilistic random walk after 1112545 steps, saw 155669 distinct states, run finished after 3001 ms. (steps per millisecond=370 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 214 rows 272 cols
[2023-03-08 19:32:44] [INFO ] Computed 60 place invariants in 7 ms
[2023-03-08 19:32:44] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 19:32:44] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2023-03-08 19:32:44] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 19:32:44] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 19:32:44] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 69 ms returned sat
[2023-03-08 19:32:44] [INFO ] After 219ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 19:32:44] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 19:32:44] [INFO ] After 63ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 19:32:45] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 0 ms to minimize.
[2023-03-08 19:32:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2023-03-08 19:32:45] [INFO ] After 198ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 72 ms.
[2023-03-08 19:32:45] [INFO ] After 625ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 34 ms.
Support contains 4 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 214/214 transitions.
Applied a total of 0 rules in 7 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 272/272 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 214/214 transitions.
Applied a total of 0 rules in 8 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-08 19:32:45] [INFO ] Invariant cache hit.
[2023-03-08 19:32:45] [INFO ] Implicit Places using invariants in 134 ms returned []
[2023-03-08 19:32:45] [INFO ] Invariant cache hit.
[2023-03-08 19:32:45] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 19:32:45] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 478 ms to find 0 implicit places.
[2023-03-08 19:32:45] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-08 19:32:45] [INFO ] Invariant cache hit.
[2023-03-08 19:32:45] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 615 ms. Remains : 272/272 places, 214/214 transitions.
Applied a total of 0 rules in 8 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-08 19:32:45] [INFO ] Invariant cache hit.
[2023-03-08 19:32:45] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 19:32:45] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 18 ms returned sat
[2023-03-08 19:32:46] [INFO ] After 224ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 19:32:46] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 19:32:46] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2023-03-08 19:32:46] [INFO ] After 211ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 19:32:46] [INFO ] After 275ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 53 ms.
[2023-03-08 19:32:46] [INFO ] After 493ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p2 p0)), (F (NOT (AND (NOT p2) p0)))]
Knowledge based reduction with 10 factoid took 401 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p2) (NOT p0))]
Support contains 4 out of 273 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 273/273 places, 217/217 transitions.
Applied a total of 0 rules in 16 ms. Remains 273 /273 variables (removed 0) and now considering 217/217 (removed 0) transitions.
// Phase 1: matrix 217 rows 273 cols
[2023-03-08 19:32:47] [INFO ] Computed 58 place invariants in 7 ms
[2023-03-08 19:32:47] [INFO ] Implicit Places using invariants in 204 ms returned []
[2023-03-08 19:32:47] [INFO ] Invariant cache hit.
[2023-03-08 19:32:48] [INFO ] Implicit Places using invariants and state equation in 977 ms returned []
Implicit Place search using SMT with State Equation took 1183 ms to find 0 implicit places.
[2023-03-08 19:32:48] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 19:32:48] [INFO ] Invariant cache hit.
[2023-03-08 19:32:48] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1359 ms. Remains : 273/273 places, 217/217 transitions.
Computed a total of 176 stabilizing places and 171 stable transitions
Computed a total of 176 stabilizing places and 171 stable transitions
Detected a total of 176/273 stabilizing places and 171/217 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0), (X (NOT (AND p2 p0))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p2) p0)), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 343 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 226 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-08 19:32:49] [INFO ] Invariant cache hit.
[2023-03-08 19:32:49] [INFO ] [Real]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 19:32:49] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 13 ms returned sat
[2023-03-08 19:32:49] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 19:32:49] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-08 19:32:49] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 51 ms returned sat
[2023-03-08 19:32:50] [INFO ] After 750ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 19:32:50] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2023-03-08 19:32:50] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2023-03-08 19:32:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 162 ms
[2023-03-08 19:32:50] [INFO ] After 1002ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 110 ms.
[2023-03-08 19:32:50] [INFO ] After 1295ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 64 ms.
Support contains 4 out of 273 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 273/273 places, 217/217 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 273 transition count 215
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 272 transition count 214
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 272 transition count 214
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 9 place count 272 transition count 214
Applied a total of 9 rules in 20 ms. Remains 272 /273 variables (removed 1) and now considering 214/217 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 272/273 places, 214/217 transitions.
Incomplete random walk after 10000 steps, including 123 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1087509 steps, run timeout after 3001 ms. (steps per millisecond=362 ) properties seen :{}
Probabilistic random walk after 1087509 steps, saw 152366 distinct states, run finished after 3001 ms. (steps per millisecond=362 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 214 rows 272 cols
[2023-03-08 19:32:53] [INFO ] Computed 60 place invariants in 6 ms
[2023-03-08 19:32:53] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 19:32:53] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2023-03-08 19:32:53] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 19:32:53] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 19:32:53] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 72 ms returned sat
[2023-03-08 19:32:54] [INFO ] After 236ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 19:32:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 19:32:54] [INFO ] After 60ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 19:32:54] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 0 ms to minimize.
[2023-03-08 19:32:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2023-03-08 19:32:54] [INFO ] After 205ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 62 ms.
[2023-03-08 19:32:54] [INFO ] After 648ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 56 ms.
Support contains 4 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 214/214 transitions.
Applied a total of 0 rules in 7 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 272/272 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 214/214 transitions.
Applied a total of 0 rules in 8 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-08 19:32:54] [INFO ] Invariant cache hit.
[2023-03-08 19:32:54] [INFO ] Implicit Places using invariants in 140 ms returned []
[2023-03-08 19:32:54] [INFO ] Invariant cache hit.
[2023-03-08 19:32:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 19:32:54] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
[2023-03-08 19:32:54] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 19:32:54] [INFO ] Invariant cache hit.
[2023-03-08 19:32:55] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 621 ms. Remains : 272/272 places, 214/214 transitions.
Applied a total of 0 rules in 15 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-08 19:32:55] [INFO ] Invariant cache hit.
[2023-03-08 19:32:55] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 19:32:55] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 17 ms returned sat
[2023-03-08 19:32:55] [INFO ] After 222ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 19:32:55] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 19:32:55] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2023-03-08 19:32:55] [INFO ] After 212ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 19:32:55] [INFO ] After 281ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 53 ms.
[2023-03-08 19:32:55] [INFO ] After 489ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p2) p0), (X (NOT (AND p2 p0))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p2) p0)), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p2 p0)), (F (NOT (AND (NOT p2) p0)))]
Knowledge based reduction with 10 factoid took 492 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 2254 reset in 231 ms.
Product exploration explored 100000 steps with 2224 reset in 258 ms.
Support contains 4 out of 273 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 273/273 places, 217/217 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 272 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 272 transition count 216
Applied a total of 2 rules in 13 ms. Remains 272 /273 variables (removed 1) and now considering 216/217 (removed 1) transitions.
// Phase 1: matrix 216 rows 272 cols
[2023-03-08 19:32:56] [INFO ] Computed 58 place invariants in 6 ms
[2023-03-08 19:32:57] [INFO ] Implicit Places using invariants in 143 ms returned []
[2023-03-08 19:32:57] [INFO ] Invariant cache hit.
[2023-03-08 19:32:57] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
[2023-03-08 19:32:57] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 19:32:57] [INFO ] Invariant cache hit.
[2023-03-08 19:32:57] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 272/273 places, 216/217 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 562 ms. Remains : 272/273 places, 216/217 transitions.
Treatment of property DES-PT-40a-LTLFireability-09 finished in 20039 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((F(p2)&&p1))&&p0)))'
Support contains 8 out of 273 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 273/273 places, 217/217 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 272 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 272 transition count 216
Applied a total of 2 rules in 17 ms. Remains 272 /273 variables (removed 1) and now considering 216/217 (removed 1) transitions.
[2023-03-08 19:32:57] [INFO ] Invariant cache hit.
[2023-03-08 19:32:57] [INFO ] Implicit Places using invariants in 135 ms returned []
[2023-03-08 19:32:57] [INFO ] Invariant cache hit.
[2023-03-08 19:32:57] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
[2023-03-08 19:32:57] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 19:32:57] [INFO ] Invariant cache hit.
[2023-03-08 19:32:58] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 272/273 places, 216/217 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 528 ms. Remains : 272/273 places, 216/217 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : DES-PT-40a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s260 1) (EQ s262 1) (EQ s99 1) (EQ s188 1)), p1:(AND (EQ s109 1) (EQ s188 1)), p2:(OR (EQ s8 0) (EQ s191 0) (EQ s193 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 34 steps with 0 reset in 1 ms.
FORMULA DES-PT-40a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40a-LTLFireability-10 finished in 667 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 273 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 273/273 places, 217/217 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 272 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 272 transition count 216
Applied a total of 2 rules in 18 ms. Remains 272 /273 variables (removed 1) and now considering 216/217 (removed 1) transitions.
[2023-03-08 19:32:58] [INFO ] Invariant cache hit.
[2023-03-08 19:32:58] [INFO ] Implicit Places using invariants in 136 ms returned []
[2023-03-08 19:32:58] [INFO ] Invariant cache hit.
[2023-03-08 19:32:58] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
[2023-03-08 19:32:58] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 19:32:58] [INFO ] Invariant cache hit.
[2023-03-08 19:32:58] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 272/273 places, 216/217 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 541 ms. Remains : 272/273 places, 216/217 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-40a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s49 1) (EQ s267 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 28 steps with 0 reset in 0 ms.
FORMULA DES-PT-40a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40a-LTLFireability-11 finished in 589 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 273 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 273/273 places, 217/217 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 272 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 272 transition count 216
Applied a total of 2 rules in 15 ms. Remains 272 /273 variables (removed 1) and now considering 216/217 (removed 1) transitions.
[2023-03-08 19:32:58] [INFO ] Invariant cache hit.
[2023-03-08 19:32:58] [INFO ] Implicit Places using invariants in 135 ms returned []
[2023-03-08 19:32:58] [INFO ] Invariant cache hit.
[2023-03-08 19:32:59] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
[2023-03-08 19:32:59] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 19:32:59] [INFO ] Invariant cache hit.
[2023-03-08 19:32:59] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 272/273 places, 216/217 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 543 ms. Remains : 272/273 places, 216/217 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-40a-LTLFireability-12 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 (EQ s212 1) (EQ s229 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 43 steps with 0 reset in 1 ms.
FORMULA DES-PT-40a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40a-LTLFireability-12 finished in 638 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((F(p0)&&X(p1)))||X(G(p2))))'
Support contains 5 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 217/217 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 272 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 272 transition count 216
Applied a total of 2 rules in 10 ms. Remains 272 /273 variables (removed 1) and now considering 216/217 (removed 1) transitions.
[2023-03-08 19:32:59] [INFO ] Invariant cache hit.
[2023-03-08 19:32:59] [INFO ] Implicit Places using invariants in 139 ms returned []
[2023-03-08 19:32:59] [INFO ] Invariant cache hit.
[2023-03-08 19:32:59] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
[2023-03-08 19:32:59] [INFO ] Invariant cache hit.
[2023-03-08 19:32:59] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 272/273 places, 216/217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 540 ms. Remains : 272/273 places, 216/217 transitions.
Stuttering acceptance computed with spot in 203 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1)]
Running random walk in product with property : DES-PT-40a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s129 1) (EQ s164 1)), p2:(OR (EQ s143 0) (EQ s164 0)), p1:(AND (EQ s116 1) (EQ s188 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 2227 reset in 225 ms.
Product exploration explored 100000 steps with 2228 reset in 248 ms.
Computed a total of 175 stabilizing places and 170 stable transitions
Computed a total of 175 stabilizing places and 170 stable transitions
Detected a total of 175/272 stabilizing places and 170/216 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p2 (NOT p1))), (X (AND (NOT p0) p2 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND (NOT p0) p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p2 (NOT p1)))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p2))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 782 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 215 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 63 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 64 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 59 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 710918 steps, run timeout after 3001 ms. (steps per millisecond=236 ) properties seen :{}
Probabilistic random walk after 710918 steps, saw 109397 distinct states, run finished after 3001 ms. (steps per millisecond=236 ) properties seen :0
Running SMT prover for 9 properties.
[2023-03-08 19:33:05] [INFO ] Invariant cache hit.
[2023-03-08 19:33:05] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-08 19:33:05] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 19:33:05] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 69 ms returned sat
[2023-03-08 19:33:06] [INFO ] After 445ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-08 19:33:06] [INFO ] After 1051ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 291 ms.
[2023-03-08 19:33:06] [INFO ] After 1585ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 443 ms.
Support contains 5 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 216/216 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 272 transition count 214
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 6 place count 272 transition count 214
Applied a total of 6 rules in 25 ms. Remains 272 /272 variables (removed 0) and now considering 214/216 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 272/272 places, 214/216 transitions.
Incomplete random walk after 10000 steps, including 135 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 73 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 214 rows 272 cols
[2023-03-08 19:33:07] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-08 19:33:07] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-08 19:33:07] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 19:33:07] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 109 ms returned sat
[2023-03-08 19:33:08] [INFO ] After 547ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-08 19:33:08] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 19:33:08] [INFO ] After 163ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-08 19:33:08] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2023-03-08 19:33:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2023-03-08 19:33:09] [INFO ] After 434ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 175 ms.
[2023-03-08 19:33:09] [INFO ] After 1361ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 182 ms.
Support contains 5 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 214/214 transitions.
Applied a total of 0 rules in 5 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 272/272 places, 214/214 transitions.
Incomplete random walk after 10000 steps, including 136 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 894743 steps, run timeout after 3001 ms. (steps per millisecond=298 ) properties seen :{}
Probabilistic random walk after 894743 steps, saw 127503 distinct states, run finished after 3001 ms. (steps per millisecond=298 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-08 19:33:12] [INFO ] Invariant cache hit.
[2023-03-08 19:33:12] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-08 19:33:12] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 19:33:12] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 80 ms returned sat
[2023-03-08 19:33:13] [INFO ] After 322ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-08 19:33:13] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 19:33:13] [INFO ] After 195ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-08 19:33:13] [INFO ] After 512ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 188 ms.
[2023-03-08 19:33:14] [INFO ] After 1198ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 162 ms.
Support contains 5 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 214/214 transitions.
Applied a total of 0 rules in 15 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 272/272 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 214/214 transitions.
Applied a total of 0 rules in 5 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-08 19:33:14] [INFO ] Invariant cache hit.
[2023-03-08 19:33:14] [INFO ] Implicit Places using invariants in 134 ms returned []
[2023-03-08 19:33:14] [INFO ] Invariant cache hit.
[2023-03-08 19:33:14] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 19:33:14] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 499 ms to find 0 implicit places.
[2023-03-08 19:33:14] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 19:33:14] [INFO ] Invariant cache hit.
[2023-03-08 19:33:14] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 629 ms. Remains : 272/272 places, 214/214 transitions.
Applied a total of 0 rules in 6 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Running SMT prover for 5 properties.
[2023-03-08 19:33:14] [INFO ] Invariant cache hit.
[2023-03-08 19:33:14] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-08 19:33:14] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 19:33:15] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 83 ms returned sat
[2023-03-08 19:33:15] [INFO ] After 314ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-08 19:33:15] [INFO ] After 503ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 154 ms.
[2023-03-08 19:33:15] [INFO ] After 836ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p2 (NOT p1))), (X (AND (NOT p0) p2 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND (NOT p0) p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p2 (NOT p1)))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p2))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p2))), (F (NOT (AND (NOT p0) (NOT p1) p2))), (F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 17 factoid took 813 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 185 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1)]
Support contains 5 out of 272 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 216/216 transitions.
Applied a total of 0 rules in 8 ms. Remains 272 /272 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 272 cols
[2023-03-08 19:33:16] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-08 19:33:17] [INFO ] Implicit Places using invariants in 130 ms returned []
[2023-03-08 19:33:17] [INFO ] Invariant cache hit.
[2023-03-08 19:33:17] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
[2023-03-08 19:33:17] [INFO ] Invariant cache hit.
[2023-03-08 19:33:17] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 528 ms. Remains : 272/272 places, 216/216 transitions.
Computed a total of 175 stabilizing places and 170 stable transitions
Computed a total of 175 stabilizing places and 170 stable transitions
Detected a total of 175/272 stabilizing places and 170/216 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p1) p2)), (X (AND (NOT p0) p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X (AND (NOT p1) p2))), (X (X (AND (NOT p0) p2))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 763 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 231 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 61 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 55 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 55 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 705506 steps, run timeout after 3001 ms. (steps per millisecond=235 ) properties seen :{}
Probabilistic random walk after 705506 steps, saw 108810 distinct states, run finished after 3001 ms. (steps per millisecond=235 ) properties seen :0
Running SMT prover for 9 properties.
[2023-03-08 19:33:21] [INFO ] Invariant cache hit.
[2023-03-08 19:33:22] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-08 19:33:22] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-08 19:33:22] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 59 ms returned sat
[2023-03-08 19:33:22] [INFO ] After 425ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-08 19:33:23] [INFO ] After 973ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 275 ms.
[2023-03-08 19:33:23] [INFO ] After 1479ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 444 ms.
Support contains 5 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 216/216 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 272 transition count 214
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 6 place count 272 transition count 214
Applied a total of 6 rules in 16 ms. Remains 272 /272 variables (removed 0) and now considering 214/216 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 272/272 places, 214/216 transitions.
Incomplete random walk after 10000 steps, including 140 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 71 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 214 rows 272 cols
[2023-03-08 19:33:24] [INFO ] Computed 60 place invariants in 7 ms
[2023-03-08 19:33:24] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-08 19:33:24] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 19:33:24] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 105 ms returned sat
[2023-03-08 19:33:25] [INFO ] After 531ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-08 19:33:25] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 19:33:25] [INFO ] After 164ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-08 19:33:25] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 0 ms to minimize.
[2023-03-08 19:33:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2023-03-08 19:33:25] [INFO ] After 441ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 172 ms.
[2023-03-08 19:33:25] [INFO ] After 1348ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 142 ms.
Support contains 5 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 214/214 transitions.
Applied a total of 0 rules in 5 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 272/272 places, 214/214 transitions.
Incomplete random walk after 10000 steps, including 134 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 73 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 897526 steps, run timeout after 3001 ms. (steps per millisecond=299 ) properties seen :{}
Probabilistic random walk after 897526 steps, saw 127890 distinct states, run finished after 3001 ms. (steps per millisecond=299 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-08 19:33:29] [INFO ] Invariant cache hit.
[2023-03-08 19:33:29] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-08 19:33:29] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 19:33:29] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 76 ms returned sat
[2023-03-08 19:33:29] [INFO ] After 307ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-08 19:33:29] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 19:33:29] [INFO ] After 189ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-08 19:33:30] [INFO ] After 483ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 177 ms.
[2023-03-08 19:33:30] [INFO ] After 1146ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 193 ms.
Support contains 5 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 214/214 transitions.
Applied a total of 0 rules in 5 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 272/272 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 214/214 transitions.
Applied a total of 0 rules in 4 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-08 19:33:30] [INFO ] Invariant cache hit.
[2023-03-08 19:33:30] [INFO ] Implicit Places using invariants in 132 ms returned []
[2023-03-08 19:33:30] [INFO ] Invariant cache hit.
[2023-03-08 19:33:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 19:33:31] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 492 ms to find 0 implicit places.
[2023-03-08 19:33:31] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 19:33:31] [INFO ] Invariant cache hit.
[2023-03-08 19:33:31] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 626 ms. Remains : 272/272 places, 214/214 transitions.
Applied a total of 0 rules in 8 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Running SMT prover for 5 properties.
[2023-03-08 19:33:31] [INFO ] Invariant cache hit.
[2023-03-08 19:33:31] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-08 19:33:31] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 19:33:31] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 80 ms returned sat
[2023-03-08 19:33:31] [INFO ] After 311ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-08 19:33:31] [INFO ] After 492ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 141 ms.
[2023-03-08 19:33:32] [INFO ] After 813ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p1) p2)), (X (AND (NOT p0) p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X (AND (NOT p1) p2))), (X (X (AND (NOT p0) p2))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p2))), (F (NOT (AND (NOT p0) (NOT p1) p2))), (F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 17 factoid took 794 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 271 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 217 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 2244 reset in 224 ms.
Product exploration explored 100000 steps with 2218 reset in 243 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 205 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1)]
Support contains 5 out of 272 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 272/272 places, 216/216 transitions.
Applied a total of 0 rules in 13 ms. Remains 272 /272 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2023-03-08 19:33:34] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 216 rows 272 cols
[2023-03-08 19:33:34] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-08 19:33:34] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 137 ms. Remains : 272/272 places, 216/216 transitions.
Support contains 5 out of 272 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 216/216 transitions.
Applied a total of 0 rules in 5 ms. Remains 272 /272 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2023-03-08 19:33:34] [INFO ] Invariant cache hit.
[2023-03-08 19:33:34] [INFO ] Implicit Places using invariants in 129 ms returned []
[2023-03-08 19:33:34] [INFO ] Invariant cache hit.
[2023-03-08 19:33:34] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
[2023-03-08 19:33:34] [INFO ] Invariant cache hit.
[2023-03-08 19:33:35] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 530 ms. Remains : 272/272 places, 216/216 transitions.
Treatment of property DES-PT-40a-LTLFireability-13 finished in 35645 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((F(G(p1))&&p0) U (!p2&&F(!p3))))))'
Support contains 6 out of 273 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 273/273 places, 217/217 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 272 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 272 transition count 216
Applied a total of 2 rules in 21 ms. Remains 272 /273 variables (removed 1) and now considering 216/217 (removed 1) transitions.
[2023-03-08 19:33:35] [INFO ] Invariant cache hit.
[2023-03-08 19:33:35] [INFO ] Implicit Places using invariants in 131 ms returned []
[2023-03-08 19:33:35] [INFO ] Invariant cache hit.
[2023-03-08 19:33:35] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
[2023-03-08 19:33:35] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 19:33:35] [INFO ] Invariant cache hit.
[2023-03-08 19:33:35] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 272/273 places, 216/217 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 543 ms. Remains : 272/273 places, 216/217 transitions.
Stuttering acceptance computed with spot in 227 ms :[(OR p2 p3), p3, (AND p3 (NOT p1)), (OR (AND (NOT p1) p3) (AND (NOT p1) p2)), (OR p2 p3)]
Running random walk in product with property : DES-PT-40a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p2) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p2) p3), acceptance={} source=0 dest: 1}, { cond=(AND p2 p0), acceptance={} source=0 dest: 3}, { cond=(AND p2 p0), acceptance={0, 1} source=0 dest: 4}], [{ cond=p3, acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND p3 p1), acceptance={1} source=2 dest: 2}, { cond=(AND p3 (NOT p1)), acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND (NOT p2) p3), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND p2 p1), acceptance={1} source=3 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={0, 1} source=3 dest: 3}], [{ cond=(AND p2 (NOT p0)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND (NOT p2) p3), acceptance={} source=4 dest: 1}, { cond=(AND p2 p0), acceptance={} source=4 dest: 3}, { cond=(AND p2 p0), acceptance={0, 1} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s147 1) (EQ s164 1)), p0:(AND (EQ s124 1) (EQ s164 1)), p3:(AND (EQ s137 1) (EQ s164 1)), p1:(AND (EQ s210 1) (EQ s227 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 2243 reset in 240 ms.
Product exploration explored 100000 steps with 2225 reset in 251 ms.
Computed a total of 175 stabilizing places and 170 stable transitions
Computed a total of 175 stabilizing places and 170 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p3) (NOT p1)), (X (NOT (AND p2 (NOT p1)))), (X (NOT p3)), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p2 (NOT p0)))), (X (OR (NOT p2) p0)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p2) p3))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p3))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p3 (NOT p1))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (OR (NOT p2) p0))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p3 p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) p3))))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 1080 ms. Reduced automaton from 5 states, 17 edges and 4 AP (stutter insensitive) to 5 states, 17 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 242 ms :[(OR p2 p3), p3, (AND p3 (NOT p1)), (OR (AND (NOT p1) p3) (AND (NOT p1) p2)), (OR p2 p3)]
Incomplete random walk after 10000 steps, including 219 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 61 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-08 19:33:38] [INFO ] Invariant cache hit.
[2023-03-08 19:33:38] [INFO ] [Real]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-08 19:33:38] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 23 ms returned sat
[2023-03-08 19:33:38] [INFO ] After 134ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-08 19:33:38] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-08 19:33:38] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 117 ms returned sat
[2023-03-08 19:33:39] [INFO ] After 418ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :8
[2023-03-08 19:33:39] [INFO ] After 712ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :8
Attempting to minimize the solution found.
Minimization took 224 ms.
[2023-03-08 19:33:39] [INFO ] After 1212ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :8
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 243 ms.
Support contains 6 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 216/216 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 272 transition count 214
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 7 place count 272 transition count 214
Applied a total of 7 rules in 16 ms. Remains 272 /272 variables (removed 0) and now considering 214/216 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 272/272 places, 214/216 transitions.
Incomplete random walk after 10000 steps, including 139 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 73 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 74 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 72 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 73 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 72 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 72 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 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 72 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 750578 steps, run timeout after 3001 ms. (steps per millisecond=250 ) properties seen :{}
Probabilistic random walk after 750578 steps, saw 107774 distinct states, run finished after 3001 ms. (steps per millisecond=250 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 214 rows 272 cols
[2023-03-08 19:33:43] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-08 19:33:43] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 19:33:43] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-08 19:33:43] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-08 19:33:43] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 19:33:43] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 59 ms returned sat
[2023-03-08 19:33:44] [INFO ] After 354ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-08 19:33:44] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 19:33:44] [INFO ] After 222ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-08 19:33:44] [INFO ] After 490ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 215 ms.
[2023-03-08 19:33:44] [INFO ] After 1253ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 257 ms.
Support contains 6 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 214/214 transitions.
Applied a total of 0 rules in 5 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 272/272 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 214/214 transitions.
Applied a total of 0 rules in 4 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-08 19:33:45] [INFO ] Invariant cache hit.
[2023-03-08 19:33:45] [INFO ] Implicit Places using invariants in 136 ms returned []
[2023-03-08 19:33:45] [INFO ] Invariant cache hit.
[2023-03-08 19:33:45] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 19:33:45] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 510 ms to find 0 implicit places.
[2023-03-08 19:33:45] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 19:33:45] [INFO ] Invariant cache hit.
[2023-03-08 19:33:45] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 632 ms. Remains : 272/272 places, 214/214 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 272 transition count 214
Applied a total of 1 rules in 8 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 214 rows 272 cols
[2023-03-08 19:33:45] [INFO ] Computed 60 place invariants in 2 ms
[2023-03-08 19:33:45] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 19:33:45] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-08 19:33:45] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-08 19:33:45] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 19:33:45] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 60 ms returned sat
[2023-03-08 19:33:46] [INFO ] After 339ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-08 19:33:46] [INFO ] After 608ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 201 ms.
[2023-03-08 19:33:46] [INFO ] After 1003ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p3) (NOT p1)), (X (NOT (AND p2 (NOT p1)))), (X (NOT p3)), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p2 (NOT p0)))), (X (OR (NOT p2) p0)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p2) p3))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p3))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p3 (NOT p1))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (OR (NOT p2) p0))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p3 p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) p3)))), (G (NOT (AND p0 p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 22 factoid took 1037 ms. Reduced automaton from 5 states, 17 edges and 4 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(OR p2 p3), p3]
Stuttering acceptance computed with spot in 65 ms :[(OR p2 p3), p3]
Support contains 3 out of 272 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 272/272 places, 216/216 transitions.
Applied a total of 0 rules in 8 ms. Remains 272 /272 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 272 cols
[2023-03-08 19:33:48] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-08 19:33:48] [INFO ] Implicit Places using invariants in 130 ms returned []
[2023-03-08 19:33:48] [INFO ] Invariant cache hit.
[2023-03-08 19:33:48] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
[2023-03-08 19:33:48] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 19:33:48] [INFO ] Invariant cache hit.
[2023-03-08 19:33:48] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 533 ms. Remains : 272/272 places, 216/216 transitions.
Computed a total of 175 stabilizing places and 170 stable transitions
Computed a total of 175 stabilizing places and 170 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p3)), (X (NOT p3)), (X (NOT (AND p3 (NOT p2)))), (X (NOT p2)), (X (X (NOT p3))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 264 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(OR p2 p3), p3]
Incomplete random walk after 10000 steps, including 223 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 64 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 66 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1031408 steps, run timeout after 3001 ms. (steps per millisecond=343 ) properties seen :{}
Probabilistic random walk after 1031408 steps, saw 147112 distinct states, run finished after 3001 ms. (steps per millisecond=343 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-08 19:33:52] [INFO ] Invariant cache hit.
[2023-03-08 19:33:52] [INFO ] [Real]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-08 19:33:52] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 15 ms returned sat
[2023-03-08 19:33:52] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 19:33:52] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 19:33:52] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 67 ms returned sat
[2023-03-08 19:33:52] [INFO ] After 272ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 19:33:52] [INFO ] After 376ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 70 ms.
[2023-03-08 19:33:52] [INFO ] After 639ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 42 ms.
Support contains 3 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 216/216 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 272 transition count 214
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 7 place count 272 transition count 214
Applied a total of 7 rules in 11 ms. Remains 272 /272 variables (removed 0) and now considering 214/216 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 272/272 places, 214/216 transitions.
Incomplete random walk after 10000 steps, including 125 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 72 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 73 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 908343 steps, run timeout after 3001 ms. (steps per millisecond=302 ) properties seen :{}
Probabilistic random walk after 908343 steps, saw 129330 distinct states, run finished after 3001 ms. (steps per millisecond=302 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 214 rows 272 cols
[2023-03-08 19:33:56] [INFO ] Computed 60 place invariants in 6 ms
[2023-03-08 19:33:56] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 19:33:56] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-08 19:33:56] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 19:33:56] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 19:33:56] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 59 ms returned sat
[2023-03-08 19:33:57] [INFO ] After 804ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 19:33:57] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 19:33:57] [INFO ] After 451ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-08 19:33:57] [INFO ] After 676ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 489 ms.
[2023-03-08 19:33:58] [INFO ] After 2147ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 1 properties in 106 ms.
Support contains 3 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 214/214 transitions.
Applied a total of 0 rules in 4 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 272/272 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 214/214 transitions.
Applied a total of 0 rules in 4 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-08 19:33:58] [INFO ] Invariant cache hit.
[2023-03-08 19:33:58] [INFO ] Implicit Places using invariants in 138 ms returned []
[2023-03-08 19:33:58] [INFO ] Invariant cache hit.
[2023-03-08 19:33:58] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 19:33:59] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 518 ms to find 0 implicit places.
[2023-03-08 19:33:59] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 19:33:59] [INFO ] Invariant cache hit.
[2023-03-08 19:33:59] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 642 ms. Remains : 272/272 places, 214/214 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 272 transition count 214
Applied a total of 1 rules in 8 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 214 rows 272 cols
[2023-03-08 19:33:59] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-08 19:33:59] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 19:33:59] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-08 19:33:59] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 19:33:59] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 19:33:59] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 58 ms returned sat
[2023-03-08 19:33:59] [INFO ] After 197ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 19:33:59] [INFO ] After 274ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-03-08 19:33:59] [INFO ] After 464ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p2) (NOT p3)), (X (NOT p3)), (X (NOT (AND p3 (NOT p2)))), (X (NOT p2)), (X (X (NOT p3))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT p2)))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 7 factoid took 268 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(OR p2 p3), p3]
Stuttering acceptance computed with spot in 72 ms :[(OR p2 p3), p3]
Stuttering acceptance computed with spot in 76 ms :[(OR p2 p3), p3]
Product exploration explored 100000 steps with 2229 reset in 208 ms.
Product exploration explored 100000 steps with 2240 reset in 250 ms.
Support contains 3 out of 272 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 272/272 places, 216/216 transitions.
Applied a total of 0 rules in 4 ms. Remains 272 /272 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 272 cols
[2023-03-08 19:34:00] [INFO ] Computed 58 place invariants in 7 ms
[2023-03-08 19:34:00] [INFO ] Implicit Places using invariants in 146 ms returned []
[2023-03-08 19:34:00] [INFO ] Invariant cache hit.
[2023-03-08 19:34:01] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
[2023-03-08 19:34:01] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 19:34:01] [INFO ] Invariant cache hit.
[2023-03-08 19:34:01] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 560 ms. Remains : 272/272 places, 216/216 transitions.
Treatment of property DES-PT-40a-LTLFireability-15 finished in 26220 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||(G(p1) U X(G(p2))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((F(p0)&&X(p1)))||X(G(p2))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((F(G(p1))&&p0) U (!p2&&F(!p3))))))'
[2023-03-08 19:34:01] [INFO ] Flatten gal took : 22 ms
[2023-03-08 19:34:01] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-08 19:34:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 273 places, 217 transitions and 1049 arcs took 3 ms.
Total runtime 114090 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1972/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1972/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1972/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : DES-PT-40a-LTLFireability-09
Could not compute solution for formula : DES-PT-40a-LTLFireability-13
Could not compute solution for formula : DES-PT-40a-LTLFireability-15

BK_STOP 1678304042873

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name DES-PT-40a-LTLFireability-09
ltl formula formula --ltl=/tmp/1972/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 273 places, 217 transitions and 1049 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1972/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1972/ltl_0_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.000 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1972/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1972/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x55b8a250a3f4]
1: pnml2lts-mc(+0xa2496) [0x55b8a250a496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f4d4dbf4140]
3: pnml2lts-mc(+0x405be5) [0x55b8a286dbe5]
4: pnml2lts-mc(+0x16b3f9) [0x55b8a25d33f9]
5: pnml2lts-mc(+0x164ac4) [0x55b8a25ccac4]
6: pnml2lts-mc(+0x272e0a) [0x55b8a26dae0a]
7: pnml2lts-mc(+0xb61f0) [0x55b8a251e1f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f4d4da474d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f4d4da4767a]
10: pnml2lts-mc(+0xa1581) [0x55b8a2509581]
11: pnml2lts-mc(+0xa1910) [0x55b8a2509910]
12: pnml2lts-mc(+0xa32a2) [0x55b8a250b2a2]
13: pnml2lts-mc(+0xa50f4) [0x55b8a250d0f4]
14: pnml2lts-mc(+0x3f34b3) [0x55b8a285b4b3]
15: pnml2lts-mc(+0x7c63d) [0x55b8a24e463d]
16: pnml2lts-mc(+0x67d86) [0x55b8a24cfd86]
17: pnml2lts-mc(+0x60a8a) [0x55b8a24c8a8a]
18: pnml2lts-mc(+0x5eb15) [0x55b8a24c6b15]
19: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f4d4da2fd0a]
20: pnml2lts-mc(+0x6075e) [0x55b8a24c875e]
ltl formula name DES-PT-40a-LTLFireability-13
ltl formula formula --ltl=/tmp/1972/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 273 places, 217 transitions and 1049 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1972/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1972/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1972/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1972/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name DES-PT-40a-LTLFireability-15
ltl formula formula --ltl=/tmp/1972/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 273 places, 217 transitions and 1049 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1972/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1972/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1972/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1972/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 9 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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="DES-PT-40a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is DES-PT-40a, 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 r105-tall-167814481200460"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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