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.r101-tall-167814475400460.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 itstools
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 r101-tall-167814475400460
=====================================================================

--------------------
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 1678273017958

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-40a
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-08 10:56:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-08 10:56:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 10:56:59] [INFO ] Load time of PNML (sax parser for PT used): 58 ms
[2023-03-08 10:56:59] [INFO ] Transformed 274 places.
[2023-03-08 10:56:59] [INFO ] Transformed 231 transitions.
[2023-03-08 10:56:59] [INFO ] Found NUPN structural information;
[2023-03-08 10:56:59] [INFO ] Parsed PT model containing 274 places and 231 transitions and 1116 arcs in 122 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 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 27 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 10:56:59] [INFO ] Computed 59 place invariants in 28 ms
[2023-03-08 10:57:00] [INFO ] Implicit Places using invariants in 492 ms returned [171]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 517 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 566 ms. Remains : 273/274 places, 217/217 transitions.
Support contains 55 out of 273 places after structural reductions.
[2023-03-08 10:57:00] [INFO ] Flatten gal took : 48 ms
[2023-03-08 10:57:00] [INFO ] Flatten gal took : 22 ms
[2023-03-08 10:57:00] [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 221 resets, run finished after 558 ms. (steps per millisecond=17 ) properties (out of 31) seen :10
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 1000 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 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 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 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 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 5 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 4 resets, run finished after 6 ms. (steps per millisecond=166 ) 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 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 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 1000 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 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 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 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 5 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 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 10:57:01] [INFO ] Computed 58 place invariants in 8 ms
[2023-03-08 10:57:01] [INFO ] [Real]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 10:57:01] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 16 ms returned sat
[2023-03-08 10:57:01] [INFO ] After 216ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:21
[2023-03-08 10:57:01] [INFO ] [Nat]Absence check using 33 positive place invariants in 10 ms returned sat
[2023-03-08 10:57:01] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 63 ms returned sat
[2023-03-08 10:57:07] [INFO ] After 4886ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :20
[2023-03-08 10:57:09] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 3 ms to minimize.
[2023-03-08 10:57:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 308 ms
[2023-03-08 10:57:11] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2023-03-08 10:57:11] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2023-03-08 10:57:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 189 ms
[2023-03-08 10:57:11] [INFO ] After 9573ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :20
Attempting to minimize the solution found.
Minimization took 5572 ms.
[2023-03-08 10:57:17] [INFO ] After 15909ms 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 16 properties in 650 ms.
Support contains 8 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 54 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 54 ms. Remains : 272/273 places, 214/217 transitions.
Incomplete random walk after 10000 steps, including 139 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 946499 steps, run timeout after 3001 ms. (steps per millisecond=315 ) properties seen :{}
Probabilistic random walk after 946499 steps, saw 134584 distinct states, run finished after 3002 ms. (steps per millisecond=315 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 214 rows 272 cols
[2023-03-08 10:57:21] [INFO ] Computed 60 place invariants in 5 ms
[2023-03-08 10:57:21] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 10:57:21] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-08 10:57:21] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 10:57:21] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 10:57:21] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 93 ms returned sat
[2023-03-08 10:57:21] [INFO ] After 286ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-08 10:57:21] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 10:57:22] [INFO ] After 135ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-08 10:57:22] [INFO ] After 377ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 179 ms.
[2023-03-08 10:57:22] [INFO ] After 1011ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 92 ms.
Support contains 8 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 11 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 11 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 11 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-08 10:57:22] [INFO ] Invariant cache hit.
[2023-03-08 10:57:22] [INFO ] Implicit Places using invariants in 269 ms returned []
[2023-03-08 10:57:22] [INFO ] Invariant cache hit.
[2023-03-08 10:57:23] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 10:57:23] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 638 ms to find 0 implicit places.
[2023-03-08 10:57:23] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-08 10:57:23] [INFO ] Invariant cache hit.
[2023-03-08 10:57:23] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 776 ms. Remains : 272/272 places, 214/214 transitions.
Applied a total of 0 rules in 10 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Running SMT prover for 4 properties.
[2023-03-08 10:57:23] [INFO ] Invariant cache hit.
[2023-03-08 10:57:23] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 10:57:23] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-08 10:57:23] [INFO ] After 193ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 10:57:23] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 10:57:23] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2023-03-08 10:57:23] [INFO ] After 277ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-08 10:57:24] [INFO ] After 460ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 168 ms.
[2023-03-08 10:57:24] [INFO ] After 715ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
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 7 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 10:57:24] [INFO ] Computed 58 place invariants in 7 ms
[2023-03-08 10:57:24] [INFO ] Implicit Places using invariants in 133 ms returned []
[2023-03-08 10:57:24] [INFO ] Invariant cache hit.
[2023-03-08 10:57:24] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
[2023-03-08 10:57:25] [INFO ] Invariant cache hit.
[2023-03-08 10:57:25] [INFO ] Dead Transitions using invariants and state equation in 110 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 493 ms. Remains : 272/273 places, 216/217 transitions.
Stuttering acceptance computed with spot in 396 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 1752 steps with 419 reset in 37 ms.
FORMULA DES-PT-40a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40a-LTLFireability-00 finished in 980 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 15 ms. Remains 272 /273 variables (removed 1) and now considering 216/217 (removed 1) transitions.
[2023-03-08 10:57:25] [INFO ] Invariant cache hit.
[2023-03-08 10:57:25] [INFO ] Implicit Places using invariants in 132 ms returned []
[2023-03-08 10:57:25] [INFO ] Invariant cache hit.
[2023-03-08 10:57:26] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 419 ms to find 0 implicit places.
[2023-03-08 10:57:26] [INFO ] Invariant cache hit.
[2023-03-08 10:57:26] [INFO ] Dead Transitions using invariants and state equation in 114 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 549 ms. Remains : 272/273 places, 216/217 transitions.
Stuttering acceptance computed with spot in 135 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 0 ms.
FORMULA DES-PT-40a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40a-LTLFireability-02 finished in 710 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 7 ms. Remains 272 /273 variables (removed 1) and now considering 216/217 (removed 1) transitions.
[2023-03-08 10:57:26] [INFO ] Invariant cache hit.
[2023-03-08 10:57:26] [INFO ] Implicit Places using invariants in 138 ms returned []
[2023-03-08 10:57:26] [INFO ] Invariant cache hit.
[2023-03-08 10:57:26] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
[2023-03-08 10:57:26] [INFO ] Invariant cache hit.
[2023-03-08 10:57:26] [INFO ] Dead Transitions using invariants and state equation in 104 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 486 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 1 ms.
FORMULA DES-PT-40a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40a-LTLFireability-03 finished in 1032 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 20 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 10:57:27] [INFO ] Computed 58 place invariants in 7 ms
[2023-03-08 10:57:27] [INFO ] Implicit Places using invariants in 150 ms returned []
[2023-03-08 10:57:27] [INFO ] Invariant cache hit.
[2023-03-08 10:57:27] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 421 ms to find 0 implicit places.
[2023-03-08 10:57:27] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-08 10:57:27] [INFO ] Invariant cache hit.
[2023-03-08 10:57:27] [INFO ] Dead Transitions using invariants and state equation in 105 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 562 ms. Remains : 271/273 places, 215/217 transitions.
Stuttering acceptance computed with spot in 41 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 33 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 618 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 7 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 10:57:27] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-08 10:57:28] [INFO ] Implicit Places using invariants in 149 ms returned []
[2023-03-08 10:57:28] [INFO ] Invariant cache hit.
[2023-03-08 10:57:28] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 426 ms to find 0 implicit places.
[2023-03-08 10:57:28] [INFO ] Invariant cache hit.
[2023-03-08 10:57:28] [INFO ] Dead Transitions using invariants and state equation in 123 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 557 ms. Remains : 272/273 places, 216/217 transitions.
Stuttering acceptance computed with spot in 97 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 415 ms.
Product exploration explored 100000 steps with 33333 reset in 409 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 53 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 1555 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 13 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 10:57:29] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-08 10:57:29] [INFO ] Implicit Places using invariants in 196 ms returned []
[2023-03-08 10:57:29] [INFO ] Invariant cache hit.
[2023-03-08 10:57:30] [INFO ] Implicit Places using invariants and state equation in 901 ms returned []
Implicit Place search using SMT with State Equation took 1099 ms to find 0 implicit places.
[2023-03-08 10:57:30] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-08 10:57:30] [INFO ] Invariant cache hit.
[2023-03-08 10:57:30] [INFO ] Dead Transitions using invariants and state equation in 165 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1288 ms. Remains : 273/273 places, 217/217 transitions.
Stuttering acceptance computed with spot in 32 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 2245 reset in 258 ms.
Product exploration explored 100000 steps with 2229 reset in 311 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 372 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 228 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 50 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 53 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-08 10:57:31] [INFO ] Invariant cache hit.
[2023-03-08 10:57:32] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 10:57:32] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 13 ms returned sat
[2023-03-08 10:57:32] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 10:57:32] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 10:57:32] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 49 ms returned sat
[2023-03-08 10:57:32] [INFO ] After 721ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 10:57:33] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 0 ms to minimize.
[2023-03-08 10:57:33] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2023-03-08 10:57:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 191 ms
[2023-03-08 10:57:33] [INFO ] After 1019ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 126 ms.
[2023-03-08 10:57:33] [INFO ] After 1317ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 60 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 21 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 21 ms. Remains : 272/273 places, 214/217 transitions.
Incomplete random walk after 10000 steps, including 133 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1035394 steps, run timeout after 3001 ms. (steps per millisecond=345 ) properties seen :{}
Probabilistic random walk after 1035394 steps, saw 146121 distinct states, run finished after 3001 ms. (steps per millisecond=345 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 214 rows 272 cols
[2023-03-08 10:57:36] [INFO ] Computed 60 place invariants in 5 ms
[2023-03-08 10:57:36] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 10:57:36] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 10:57:36] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 10:57:36] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 10:57:36] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 62 ms returned sat
[2023-03-08 10:57:37] [INFO ] After 213ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 10:57:37] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 10:57:37] [INFO ] After 61ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 10:57:37] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 0 ms to minimize.
[2023-03-08 10:57:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2023-03-08 10:57:37] [INFO ] After 213ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 67 ms.
[2023-03-08 10:57:37] [INFO ] After 626ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 41 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 8 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 7 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-08 10:57:37] [INFO ] Invariant cache hit.
[2023-03-08 10:57:37] [INFO ] Implicit Places using invariants in 134 ms returned []
[2023-03-08 10:57:37] [INFO ] Invariant cache hit.
[2023-03-08 10:57:37] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 10:57:37] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 482 ms to find 0 implicit places.
[2023-03-08 10:57:37] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-08 10:57:37] [INFO ] Invariant cache hit.
[2023-03-08 10:57:37] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 622 ms. Remains : 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.
Running SMT prover for 2 properties.
[2023-03-08 10:57:38] [INFO ] Invariant cache hit.
[2023-03-08 10:57:38] [INFO ] [Real]Absence check using 35 positive place invariants in 8 ms returned sat
[2023-03-08 10:57:38] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 22 ms returned sat
[2023-03-08 10:57:38] [INFO ] After 241ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 10:57:38] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 10:57:38] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 18 ms returned sat
[2023-03-08 10:57:38] [INFO ] After 210ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 10:57:38] [INFO ] After 273ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 50 ms.
[2023-03-08 10:57:38] [INFO ] After 484ms 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 379 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 30 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 9 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 10:57:39] [INFO ] Computed 58 place invariants in 6 ms
[2023-03-08 10:57:39] [INFO ] Implicit Places using invariants in 189 ms returned []
[2023-03-08 10:57:39] [INFO ] Invariant cache hit.
[2023-03-08 10:57:40] [INFO ] Implicit Places using invariants and state equation in 922 ms returned []
Implicit Place search using SMT with State Equation took 1113 ms to find 0 implicit places.
[2023-03-08 10:57:40] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 10:57:40] [INFO ] Invariant cache hit.
[2023-03-08 10:57:40] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1278 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 369 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 43 ms :[(AND (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 221 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 49 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-08 10:57:41] [INFO ] Invariant cache hit.
[2023-03-08 10:57:41] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 10:57:41] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 10:57:41] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 10:57:41] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-08 10:57:41] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 50 ms returned sat
[2023-03-08 10:57:41] [INFO ] After 717ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 10:57:42] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 3 ms to minimize.
[2023-03-08 10:57:42] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 0 ms to minimize.
[2023-03-08 10:57:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 166 ms
[2023-03-08 10:57:42] [INFO ] After 972ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 114 ms.
[2023-03-08 10:57:42] [INFO ] After 1264ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 49 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 25 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 26 ms. Remains : 272/273 places, 214/217 transitions.
Incomplete random walk after 10000 steps, including 137 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1133108 steps, run timeout after 3001 ms. (steps per millisecond=377 ) properties seen :{}
Probabilistic random walk after 1133108 steps, saw 158641 distinct states, run finished after 3001 ms. (steps per millisecond=377 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 214 rows 272 cols
[2023-03-08 10:57:45] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-08 10:57:45] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 10:57:45] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 13 ms returned sat
[2023-03-08 10:57:45] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 10:57:45] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 10:57:45] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 62 ms returned sat
[2023-03-08 10:57:46] [INFO ] After 235ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 10:57:46] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 10:57:46] [INFO ] After 62ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 10:57:46] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 0 ms to minimize.
[2023-03-08 10:57:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2023-03-08 10:57:46] [INFO ] After 211ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 73 ms.
[2023-03-08 10:57:46] [INFO ] After 659ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 40 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 8 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 8 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 7 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-08 10:57:46] [INFO ] Invariant cache hit.
[2023-03-08 10:57:46] [INFO ] Implicit Places using invariants in 147 ms returned []
[2023-03-08 10:57:46] [INFO ] Invariant cache hit.
[2023-03-08 10:57:46] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 10:57:46] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 516 ms to find 0 implicit places.
[2023-03-08 10:57:46] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 10:57:46] [INFO ] Invariant cache hit.
[2023-03-08 10:57:47] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 640 ms. Remains : 272/272 places, 214/214 transitions.
Applied a total of 0 rules in 11 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-08 10:57:47] [INFO ] Invariant cache hit.
[2023-03-08 10:57:47] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 10:57:47] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 16 ms returned sat
[2023-03-08 10:57:47] [INFO ] After 224ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 10:57:47] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 10:57:47] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 22 ms returned sat
[2023-03-08 10:57:47] [INFO ] After 212ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 10:57:47] [INFO ] After 277ms 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 10:57:47] [INFO ] After 511ms 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 488 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 30 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 38 ms :[(AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 2218 reset in 258 ms.
Product exploration explored 100000 steps with 2256 reset in 282 ms.
Built C files in :
/tmp/ltsmin1347579672629623675
[2023-03-08 10:57:48] [INFO ] Computing symmetric may disable matrix : 217 transitions.
[2023-03-08 10:57:48] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 10:57:48] [INFO ] Computing symmetric may enable matrix : 217 transitions.
[2023-03-08 10:57:48] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 10:57:49] [INFO ] Computing Do-Not-Accords matrix : 217 transitions.
[2023-03-08 10:57:49] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 10:57:49] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1347579672629623675
Running compilation step : cd /tmp/ltsmin1347579672629623675;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 565 ms.
Running link step : cd /tmp/ltsmin1347579672629623675;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin1347579672629623675;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6287718489887687287.hoa' '--buchi-type=spotba'
LTSmin run took 6209 ms.
FORMULA DES-PT-40a-LTLFireability-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-40a-LTLFireability-09 finished in 26383 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 18 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 10:57:55] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-08 10:57:56] [INFO ] Implicit Places using invariants in 127 ms returned []
[2023-03-08 10:57:56] [INFO ] Invariant cache hit.
[2023-03-08 10:57:56] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
[2023-03-08 10:57:56] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 10:57:56] [INFO ] Invariant cache hit.
[2023-03-08 10:57:56] [INFO ] Dead Transitions using invariants and state equation in 106 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 506 ms. Remains : 272/273 places, 216/217 transitions.
Stuttering acceptance computed with spot in 114 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 44 steps with 0 reset in 0 ms.
FORMULA DES-PT-40a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40a-LTLFireability-10 finished in 633 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 10 ms. Remains 272 /273 variables (removed 1) and now considering 216/217 (removed 1) transitions.
[2023-03-08 10:57:56] [INFO ] Invariant cache hit.
[2023-03-08 10:57:56] [INFO ] Implicit Places using invariants in 130 ms returned []
[2023-03-08 10:57:56] [INFO ] Invariant cache hit.
[2023-03-08 10:57:56] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
[2023-03-08 10:57:56] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 10:57:56] [INFO ] Invariant cache hit.
[2023-03-08 10:57:57] [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 515 ms. Remains : 272/273 places, 216/217 transitions.
Stuttering acceptance computed with spot in 29 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 44 steps with 0 reset in 1 ms.
FORMULA DES-PT-40a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40a-LTLFireability-11 finished in 556 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 23 ms. Remains 272 /273 variables (removed 1) and now considering 216/217 (removed 1) transitions.
[2023-03-08 10:57:57] [INFO ] Invariant cache hit.
[2023-03-08 10:57:57] [INFO ] Implicit Places using invariants in 129 ms returned []
[2023-03-08 10:57:57] [INFO ] Invariant cache hit.
[2023-03-08 10:57:57] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
[2023-03-08 10:57:57] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 10:57:57] [INFO ] Invariant cache hit.
[2023-03-08 10:57:57] [INFO ] Dead Transitions using invariants and state equation in 107 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 527 ms. Remains : 272/273 places, 216/217 transitions.
Stuttering acceptance computed with spot in 66 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 24 steps with 0 reset in 0 ms.
FORMULA DES-PT-40a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40a-LTLFireability-12 finished in 609 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 10:57:57] [INFO ] Invariant cache hit.
[2023-03-08 10:57:57] [INFO ] Implicit Places using invariants in 130 ms returned []
[2023-03-08 10:57:57] [INFO ] Invariant cache hit.
[2023-03-08 10:57:58] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
[2023-03-08 10:57:58] [INFO ] Invariant cache hit.
[2023-03-08 10:57:58] [INFO ] Dead Transitions using invariants and state equation in 110 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 515 ms. Remains : 272/273 places, 216/217 transitions.
Stuttering acceptance computed with spot in 194 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 2229 reset in 227 ms.
Product exploration explored 100000 steps with 2217 reset in 250 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 872 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 186 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 222 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 64 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 63 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 56 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 53 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 65 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 62 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 50 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 736617 steps, run timeout after 3001 ms. (steps per millisecond=245 ) properties seen :{}
Probabilistic random walk after 736617 steps, saw 112446 distinct states, run finished after 3001 ms. (steps per millisecond=245 ) properties seen :0
Running SMT prover for 9 properties.
[2023-03-08 10:58:03] [INFO ] Invariant cache hit.
[2023-03-08 10:58:03] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-08 10:58:03] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 10:58:03] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 64 ms returned sat
[2023-03-08 10:58:04] [INFO ] After 418ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-08 10:58:04] [INFO ] After 976ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 283 ms.
[2023-03-08 10:58:05] [INFO ] After 1488ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 360 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 12 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 12 ms. Remains : 272/272 places, 214/216 transitions.
Incomplete random walk after 10000 steps, including 131 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 9) seen :4
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 10000 steps, including 73 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 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 73 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 214 rows 272 cols
[2023-03-08 10:58:05] [INFO ] Computed 60 place invariants in 2 ms
[2023-03-08 10:58:05] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-08 10:58:05] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 10:58:05] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 103 ms returned sat
[2023-03-08 10:58:06] [INFO ] After 532ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-08 10:58:06] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 10:58:06] [INFO ] After 166ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-08 10:58:06] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
[2023-03-08 10:58:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2023-03-08 10:58:07] [INFO ] After 449ms 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 10:58:07] [INFO ] After 1359ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 138 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 9 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.
Incomplete random walk after 10000 steps, including 140 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 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 10001 steps, including 71 resets, run finished after 34 ms. (steps per millisecond=294 ) 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
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 10001 steps, including 71 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 938164 steps, run timeout after 3001 ms. (steps per millisecond=312 ) properties seen :{}
Probabilistic random walk after 938164 steps, saw 133350 distinct states, run finished after 3001 ms. (steps per millisecond=312 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-08 10:58:10] [INFO ] Invariant cache hit.
[2023-03-08 10:58:10] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-08 10:58:10] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 10:58:10] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 76 ms returned sat
[2023-03-08 10:58:11] [INFO ] After 297ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-08 10:58:11] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 10:58:11] [INFO ] After 190ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-08 10:58:11] [INFO ] After 497ms 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 10:58:11] [INFO ] After 1139ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 175 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 6 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.
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 10:58:11] [INFO ] Invariant cache hit.
[2023-03-08 10:58:12] [INFO ] Implicit Places using invariants in 148 ms returned []
[2023-03-08 10:58:12] [INFO ] Invariant cache hit.
[2023-03-08 10:58:12] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 10:58:12] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 516 ms to find 0 implicit places.
[2023-03-08 10:58:12] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 10:58:12] [INFO ] Invariant cache hit.
[2023-03-08 10:58:12] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 640 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 10:58:12] [INFO ] Invariant cache hit.
[2023-03-08 10:58:12] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-08 10:58:12] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 10:58:12] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 77 ms returned sat
[2023-03-08 10:58:13] [INFO ] After 304ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-08 10:58:13] [INFO ] After 499ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 150 ms.
[2023-03-08 10:58:13] [INFO ] After 818ms 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 870 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 215 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 197 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 5 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 10:58:14] [INFO ] Computed 58 place invariants in 5 ms
[2023-03-08 10:58:14] [INFO ] Implicit Places using invariants in 139 ms returned []
[2023-03-08 10:58:14] [INFO ] Invariant cache hit.
[2023-03-08 10:58:15] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
[2023-03-08 10:58:15] [INFO ] Invariant cache hit.
[2023-03-08 10:58:15] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Finished structural reductions in 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
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 844 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 191 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 224 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 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 62 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 56 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 58 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 65 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 62 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 47 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 728708 steps, run timeout after 3001 ms. (steps per millisecond=242 ) properties seen :{}
Probabilistic random walk after 728708 steps, saw 111444 distinct states, run finished after 3001 ms. (steps per millisecond=242 ) properties seen :0
Running SMT prover for 9 properties.
[2023-03-08 10:58:19] [INFO ] Invariant cache hit.
[2023-03-08 10:58:20] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-08 10:58:20] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 10:58:20] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 58 ms returned sat
[2023-03-08 10:58:20] [INFO ] After 417ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-08 10:58:21] [INFO ] After 962ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 283 ms.
[2023-03-08 10:58:21] [INFO ] After 1483ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 4 properties in 295 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 12 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 12 ms. Remains : 272/272 places, 214/216 transitions.
Incomplete random walk after 10000 steps, including 140 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 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 10000 steps, including 72 resets, run finished after 36 ms. (steps per millisecond=277 ) 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 72 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 868828 steps, run timeout after 3001 ms. (steps per millisecond=289 ) properties seen :{}
Probabilistic random walk after 868828 steps, saw 123758 distinct states, run finished after 3001 ms. (steps per millisecond=289 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 214 rows 272 cols
[2023-03-08 10:58:25] [INFO ] Computed 60 place invariants in 6 ms
[2023-03-08 10:58:25] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-08 10:58:25] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 10:58:25] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 105 ms returned sat
[2023-03-08 10:58:25] [INFO ] After 529ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-08 10:58:25] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 10:58:26] [INFO ] After 171ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-08 10:58:26] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 0 ms to minimize.
[2023-03-08 10:58:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2023-03-08 10:58:26] [INFO ] After 447ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 167 ms.
[2023-03-08 10:58:26] [INFO ] After 1350ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 148 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 6 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.
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 10:58:26] [INFO ] Invariant cache hit.
[2023-03-08 10:58:26] [INFO ] Implicit Places using invariants in 144 ms returned []
[2023-03-08 10:58:26] [INFO ] Invariant cache hit.
[2023-03-08 10:58:26] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 10:58:27] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 502 ms to find 0 implicit places.
[2023-03-08 10:58:27] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 10:58:27] [INFO ] Invariant cache hit.
[2023-03-08 10:58:27] [INFO ] Dead Transitions using invariants and state equation in 107 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 5 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Running SMT prover for 5 properties.
[2023-03-08 10:58:27] [INFO ] Invariant cache hit.
[2023-03-08 10:58:27] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-08 10:58:27] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 10:58:27] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 76 ms returned sat
[2023-03-08 10:58:27] [INFO ] After 305ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-08 10:58:28] [INFO ] After 497ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 147 ms.
[2023-03-08 10:58:28] [INFO ] After 814ms 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 822 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 199 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 182 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 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)]
Product exploration explored 100000 steps with 2242 reset in 229 ms.
Product exploration explored 100000 steps with 2195 reset in 258 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 208 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 25 ms. Remains 272 /272 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2023-03-08 10:58:30] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 216 rows 272 cols
[2023-03-08 10:58:30] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-08 10:58:30] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 160 ms. Remains : 272/272 places, 216/216 transitions.
Built C files in :
/tmp/ltsmin7054211739231605897
[2023-03-08 10:58:30] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7054211739231605897
Running compilation step : cd /tmp/ltsmin7054211739231605897;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 385 ms.
Running link step : cd /tmp/ltsmin7054211739231605897;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin7054211739231605897;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9011973835379603862.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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 11 ms. Remains 272 /272 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2023-03-08 10:58:45] [INFO ] Invariant cache hit.
[2023-03-08 10:58:45] [INFO ] Implicit Places using invariants in 137 ms returned []
[2023-03-08 10:58:45] [INFO ] Invariant cache hit.
[2023-03-08 10:58:46] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 424 ms to find 0 implicit places.
[2023-03-08 10:58:46] [INFO ] Invariant cache hit.
[2023-03-08 10:58:46] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 547 ms. Remains : 272/272 places, 216/216 transitions.
Built C files in :
/tmp/ltsmin5173276250295385702
[2023-03-08 10:58:46] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5173276250295385702
Running compilation step : cd /tmp/ltsmin5173276250295385702;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 366 ms.
Running link step : cd /tmp/ltsmin5173276250295385702;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin5173276250295385702;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14599192402418932682.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-08 10:59:01] [INFO ] Flatten gal took : 22 ms
[2023-03-08 10:59:01] [INFO ] Flatten gal took : 20 ms
[2023-03-08 10:59:01] [INFO ] Time to serialize gal into /tmp/LTL1576520052923945983.gal : 12 ms
[2023-03-08 10:59:01] [INFO ] Time to serialize properties into /tmp/LTL17694390363322671260.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1576520052923945983.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15149206893662131348.hoa' '-atoms' '/tmp/LTL17694390363322671260.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL17694390363322671260.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15149206893662131348.hoa
Detected timeout of ITS tools.
[2023-03-08 10:59:16] [INFO ] Flatten gal took : 17 ms
[2023-03-08 10:59:16] [INFO ] Flatten gal took : 16 ms
[2023-03-08 10:59:16] [INFO ] Time to serialize gal into /tmp/LTL2801824112584486102.gal : 3 ms
[2023-03-08 10:59:16] [INFO ] Time to serialize properties into /tmp/LTL9562441097336601937.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2801824112584486102.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9562441097336601937.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((F((F("((p129==1)&&(p164==1))"))&&(X("((p116==1)&&(p189==1))"))))||(X(G("((p143==0)||(p164==0))")))))
Formula 0 simplified : G(G!"((p129==1)&&(p164==1))" | X!"((p116==1)&&(p189==1))") & XF!"((p143==0)||(p164==0))"
Detected timeout of ITS tools.
[2023-03-08 10:59:31] [INFO ] Flatten gal took : 15 ms
[2023-03-08 10:59:31] [INFO ] Applying decomposition
[2023-03-08 10:59:31] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph9675824450838454081.txt' '-o' '/tmp/graph9675824450838454081.bin' '-w' '/tmp/graph9675824450838454081.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph9675824450838454081.bin' '-l' '-1' '-v' '-w' '/tmp/graph9675824450838454081.weights' '-q' '0' '-e' '0.001'
[2023-03-08 10:59:31] [INFO ] Decomposing Gal with order
[2023-03-08 10:59:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 10:59:31] [INFO ] Removed a total of 16 redundant transitions.
[2023-03-08 10:59:31] [INFO ] Flatten gal took : 57 ms
[2023-03-08 10:59:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2023-03-08 10:59:31] [INFO ] Time to serialize gal into /tmp/LTL17389639393929740489.gal : 4 ms
[2023-03-08 10:59:31] [INFO ] Time to serialize properties into /tmp/LTL9624257124397231294.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17389639393929740489.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9624257124397231294.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((F((F("((u2.p129==1)&&(u2.p164==1))"))&&(X("((u13.p116==1)&&(u13.p189==1))"))))||(X(G("((u2.p143==0)||(u2.p164==0))")))))
Formula 0 simplified : G(G!"((u2.p129==1)&&(u2.p164==1))" | X!"((u13.p116==1)&&(u13.p189==1))") & XF!"((u2.p143==0)||(u2.p164==0))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16949560543637815627
[2023-03-08 10:59:46] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16949560543637815627
Running compilation step : cd /tmp/ltsmin16949560543637815627;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 366 ms.
Running link step : cd /tmp/ltsmin16949560543637815627;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin16949560543637815627;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>((<>((LTLAPp0==true))&&X((LTLAPp1==true))))||X([]((LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-40a-LTLFireability-13 finished in 124385 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 16 ms. Remains 272 /273 variables (removed 1) and now considering 216/217 (removed 1) transitions.
[2023-03-08 11:00:02] [INFO ] Invariant cache hit.
[2023-03-08 11:00:02] [INFO ] Implicit Places using invariants in 146 ms returned []
[2023-03-08 11:00:02] [INFO ] Invariant cache hit.
[2023-03-08 11:00:02] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
[2023-03-08 11:00:02] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 11:00:02] [INFO ] Invariant cache hit.
[2023-03-08 11:00:02] [INFO ] Dead Transitions using invariants and state equation in 105 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 542 ms. Remains : 272/273 places, 216/217 transitions.
Stuttering acceptance computed with spot in 196 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 2241 reset in 238 ms.
Product exploration explored 100000 steps with 2233 reset in 249 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 1067 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 240 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 223 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 65 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 65 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 67 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 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 61 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 67 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-08 11:00:05] [INFO ] Invariant cache hit.
[2023-03-08 11:00:05] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 11:00:05] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 15 ms returned sat
[2023-03-08 11:00:05] [INFO ] After 119ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-08 11:00:05] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-08 11:00:05] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 110 ms returned sat
[2023-03-08 11:00:06] [INFO ] After 407ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :8
[2023-03-08 11:00:06] [INFO ] After 692ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :8
Attempting to minimize the solution found.
Minimization took 217 ms.
[2023-03-08 11:00:06] [INFO ] After 1165ms 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 318 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 24 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 24 ms. Remains : 272/272 places, 214/216 transitions.
Incomplete random walk after 10000 steps, including 130 resets, run finished after 188 ms. (steps per millisecond=53 ) 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
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 72 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 74 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 72 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 538832 steps, run timeout after 3001 ms. (steps per millisecond=179 ) properties seen :{}
Probabilistic random walk after 538832 steps, saw 77350 distinct states, run finished after 3001 ms. (steps per millisecond=179 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 214 rows 272 cols
[2023-03-08 11:00:10] [INFO ] Computed 60 place invariants in 2 ms
[2023-03-08 11:00:10] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 11:00:10] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-08 11:00:10] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-08 11:00:10] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 11:00:10] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 55 ms returned sat
[2023-03-08 11:00:11] [INFO ] After 340ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-08 11:00:11] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 11:00:11] [INFO ] After 235ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-08 11:00:11] [INFO ] After 510ms 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 11:00:11] [INFO ] After 1265ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 3 properties in 232 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 16 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 17 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 11:00:12] [INFO ] Invariant cache hit.
[2023-03-08 11:00:12] [INFO ] Implicit Places using invariants in 153 ms returned []
[2023-03-08 11:00:12] [INFO ] Invariant cache hit.
[2023-03-08 11:00:12] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 11:00:12] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 510 ms to find 0 implicit places.
[2023-03-08 11:00:12] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 11:00:12] [INFO ] Invariant cache hit.
[2023-03-08 11:00:12] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 643 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 5 properties.
// Phase 1: matrix 214 rows 272 cols
[2023-03-08 11:00:12] [INFO ] Computed 60 place invariants in 6 ms
[2023-03-08 11:00:12] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 11:00:12] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-08 11:00:12] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-08 11:00:13] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 11:00:13] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 107 ms returned sat
[2023-03-08 11:00:13] [INFO ] After 381ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-08 11:00:13] [INFO ] After 580ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 182 ms.
[2023-03-08 11:00:13] [INFO ] After 957ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
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 (OR p0 (NOT p2)))), (F (AND (NOT p0) p2)), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND p1 (NOT p2))), (F (AND (NOT p1) p2))]
Knowledge based reduction with 22 factoid took 1180 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 68 ms :[(OR p2 p3), p3]
Stuttering acceptance computed with spot in 72 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 19 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 11:00:15] [INFO ] Computed 58 place invariants in 7 ms
[2023-03-08 11:00:15] [INFO ] Implicit Places using invariants in 138 ms returned []
[2023-03-08 11:00:15] [INFO ] Invariant cache hit.
[2023-03-08 11:00:15] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
[2023-03-08 11:00:15] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 11:00:15] [INFO ] Invariant cache hit.
[2023-03-08 11:00:15] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 580 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 342 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 68 ms :[(OR p2 p3), p3]
Incomplete random walk after 10000 steps, including 221 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 65 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 65 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1082911 steps, run timeout after 3001 ms. (steps per millisecond=360 ) properties seen :{}
Probabilistic random walk after 1082911 steps, saw 154152 distinct states, run finished after 3001 ms. (steps per millisecond=360 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-08 11:00:19] [INFO ] Invariant cache hit.
[2023-03-08 11:00:19] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 11:00:19] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 11:00:19] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 11:00:19] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 11:00:19] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 67 ms returned sat
[2023-03-08 11:00:20] [INFO ] After 277ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 11:00:20] [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 11:00:20] [INFO ] After 637ms 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 36 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 9 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 9 ms. Remains : 272/272 places, 214/216 transitions.
Incomplete random walk after 10000 steps, including 135 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 70 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 72 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1080304 steps, run timeout after 3001 ms. (steps per millisecond=359 ) properties seen :{}
Probabilistic random walk after 1080304 steps, saw 151496 distinct states, run finished after 3004 ms. (steps per millisecond=359 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 214 rows 272 cols
[2023-03-08 11:00:23] [INFO ] Computed 60 place invariants in 6 ms
[2023-03-08 11:00:23] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 11:00:23] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-08 11:00:23] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 11:00:23] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 11:00:23] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 57 ms returned sat
[2023-03-08 11:00:24] [INFO ] After 767ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 11:00:24] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 11:00:24] [INFO ] After 424ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-08 11:00:25] [INFO ] After 653ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 480 ms.
[2023-03-08 11:00:25] [INFO ] After 2081ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 64 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 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 11:00:25] [INFO ] Invariant cache hit.
[2023-03-08 11:00:25] [INFO ] Implicit Places using invariants in 147 ms returned []
[2023-03-08 11:00:25] [INFO ] Invariant cache hit.
[2023-03-08 11:00:26] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 11:00:26] [INFO ] Implicit Places using invariants and state equation in 381 ms returned []
Implicit Place search using SMT with State Equation took 529 ms to find 0 implicit places.
[2023-03-08 11:00:26] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 11:00:26] [INFO ] Invariant cache hit.
[2023-03-08 11:00:26] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 665 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 3 properties.
// Phase 1: matrix 214 rows 272 cols
[2023-03-08 11:00:26] [INFO ] Computed 60 place invariants in 2 ms
[2023-03-08 11:00:26] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 11:00:26] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-08 11:00:26] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 11:00:26] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 11:00:26] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 57 ms returned sat
[2023-03-08 11:00:27] [INFO ] After 531ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 11:00:27] [INFO ] Deduced a trap composed of 46 places in 39 ms of which 0 ms to minimize.
[2023-03-08 11:00:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2023-03-08 11:00:27] [INFO ] After 878ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 139 ms.
[2023-03-08 11:00:27] [INFO ] After 1192ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
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 281 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 73 ms :[(OR p2 p3), p3]
Stuttering acceptance computed with spot in 77 ms :[(OR p2 p3), p3]
Stuttering acceptance computed with spot in 83 ms :[(OR p2 p3), p3]
Product exploration explored 100000 steps with 2242 reset in 210 ms.
Product exploration explored 100000 steps with 2252 reset in 229 ms.
Built C files in :
/tmp/ltsmin14639807127378938682
[2023-03-08 11:00:28] [INFO ] Computing symmetric may disable matrix : 216 transitions.
[2023-03-08 11:00:28] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 11:00:28] [INFO ] Computing symmetric may enable matrix : 216 transitions.
[2023-03-08 11:00:28] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 11:00:28] [INFO ] Computing Do-Not-Accords matrix : 216 transitions.
[2023-03-08 11:00:28] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 11:00:28] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14639807127378938682
Running compilation step : cd /tmp/ltsmin14639807127378938682;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 460 ms.
Running link step : cd /tmp/ltsmin14639807127378938682;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin14639807127378938682;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11028321653289408220.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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 12 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 11:00:43] [INFO ] Computed 58 place invariants in 6 ms
[2023-03-08 11:00:43] [INFO ] Implicit Places using invariants in 142 ms returned []
[2023-03-08 11:00:43] [INFO ] Invariant cache hit.
[2023-03-08 11:00:44] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 445 ms to find 0 implicit places.
[2023-03-08 11:00:44] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 11:00:44] [INFO ] Invariant cache hit.
[2023-03-08 11:00:44] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 587 ms. Remains : 272/272 places, 216/216 transitions.
Built C files in :
/tmp/ltsmin14416395265039349849
[2023-03-08 11:00:44] [INFO ] Computing symmetric may disable matrix : 216 transitions.
[2023-03-08 11:00:44] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 11:00:44] [INFO ] Computing symmetric may enable matrix : 216 transitions.
[2023-03-08 11:00:44] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 11:00:44] [INFO ] Computing Do-Not-Accords matrix : 216 transitions.
[2023-03-08 11:00:44] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 11:00:44] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14416395265039349849
Running compilation step : cd /tmp/ltsmin14416395265039349849;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 467 ms.
Running link step : cd /tmp/ltsmin14416395265039349849;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin14416395265039349849;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7344662517763122827.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-08 11:00:59] [INFO ] Flatten gal took : 14 ms
[2023-03-08 11:00:59] [INFO ] Flatten gal took : 14 ms
[2023-03-08 11:00:59] [INFO ] Time to serialize gal into /tmp/LTL16294687435741404359.gal : 3 ms
[2023-03-08 11:00:59] [INFO ] Time to serialize properties into /tmp/LTL17353810723129473776.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16294687435741404359.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8141323174542909228.hoa' '-atoms' '/tmp/LTL17353810723129473776.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL17353810723129473776.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8141323174542909228.hoa
Detected timeout of ITS tools.
[2023-03-08 11:01:14] [INFO ] Flatten gal took : 13 ms
[2023-03-08 11:01:14] [INFO ] Flatten gal took : 13 ms
[2023-03-08 11:01:14] [INFO ] Time to serialize gal into /tmp/LTL13615180573058021221.gal : 2 ms
[2023-03-08 11:01:14] [INFO ] Time to serialize properties into /tmp/LTL10080005417267668555.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13615180573058021221.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10080005417267668555.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G((("((p124==1)&&(p164==1))")&&(F(G("((p211==1)&&(p228==1))"))))U((!("((p147==1)&&(p164==1))"))&&(F(!("((p137==1)&&(p164==1))")))...160
Formula 0 simplified : GF((!"((p124==1)&&(p164==1))" | GF!"((p211==1)&&(p228==1))") R ("((p147==1)&&(p164==1))" | G"((p137==1)&&(p164==1))"))
Detected timeout of ITS tools.
[2023-03-08 11:01:29] [INFO ] Flatten gal took : 13 ms
[2023-03-08 11:01:29] [INFO ] Applying decomposition
[2023-03-08 11:01:29] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph13278661840879470872.txt' '-o' '/tmp/graph13278661840879470872.bin' '-w' '/tmp/graph13278661840879470872.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph13278661840879470872.bin' '-l' '-1' '-v' '-w' '/tmp/graph13278661840879470872.weights' '-q' '0' '-e' '0.001'
[2023-03-08 11:01:29] [INFO ] Decomposing Gal with order
[2023-03-08 11:01:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 11:01:29] [INFO ] Removed a total of 16 redundant transitions.
[2023-03-08 11:01:29] [INFO ] Flatten gal took : 17 ms
[2023-03-08 11:01:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2023-03-08 11:01:29] [INFO ] Time to serialize gal into /tmp/LTL15986477566797116788.gal : 3 ms
[2023-03-08 11:01:29] [INFO ] Time to serialize properties into /tmp/LTL13439473901711525108.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15986477566797116788.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13439473901711525108.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F(G((("((u2.p124==1)&&(u2.p164==1))")&&(F(G("((i10.u23.p211==1)&&(i10.u31.p228==1))"))))U((!("((u2.p147==1)&&(u2.p164==1))"))&&(F(!...194
Formula 0 simplified : GF((!"((u2.p124==1)&&(u2.p164==1))" | GF!"((i10.u23.p211==1)&&(i10.u31.p228==1))") R ("((u2.p147==1)&&(u2.p164==1))" | G"((u2.p137==...175
Reverse transition relation is NOT exact ! Due to transitions t1, t176, t177, t210, u2.t8, u2.t90, u2.t94, u2.t95, u2.t96, u2.t97, u2.t98, u2.t99, u2.t100,...655
Computing Next relation with stutter on 3.63306e+06 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18008976246721981925
[2023-03-08 11:01:44] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18008976246721981925
Running compilation step : cd /tmp/ltsmin18008976246721981925;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 381 ms.
Running link step : cd /tmp/ltsmin18008976246721981925;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin18008976246721981925;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([](((<>([]((LTLAPp1==true)))&&(LTLAPp0==true)) U (!(LTLAPp2==true)&&<>(!(LTLAPp3==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-40a-LTLFireability-15 finished in 117846 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))))'
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 11:02:00] [INFO ] Flatten gal took : 21 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin162828591120360372
[2023-03-08 11:02:00] [INFO ] Computing symmetric may disable matrix : 217 transitions.
[2023-03-08 11:02:00] [INFO ] Applying decomposition
[2023-03-08 11:02:00] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 11:02:00] [INFO ] Computing symmetric may enable matrix : 217 transitions.
[2023-03-08 11:02:00] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 11:02:00] [INFO ] Flatten gal took : 9 ms
[2023-03-08 11:02:00] [INFO ] Computing Do-Not-Accords matrix : 217 transitions.
[2023-03-08 11:02:00] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 11:02:00] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin162828591120360372
Running compilation step : cd /tmp/ltsmin162828591120360372;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph7640793320499344751.txt' '-o' '/tmp/graph7640793320499344751.bin' '-w' '/tmp/graph7640793320499344751.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph7640793320499344751.bin' '-l' '-1' '-v' '-w' '/tmp/graph7640793320499344751.weights' '-q' '0' '-e' '0.001'
[2023-03-08 11:02:00] [INFO ] Decomposing Gal with order
[2023-03-08 11:02:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 11:02:00] [INFO ] Removed a total of 9 redundant transitions.
[2023-03-08 11:02:00] [INFO ] Flatten gal took : 14 ms
[2023-03-08 11:02:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2023-03-08 11:02:00] [INFO ] Time to serialize gal into /tmp/LTLFireability3590750168328845967.gal : 4 ms
[2023-03-08 11:02:00] [INFO ] Time to serialize properties into /tmp/LTLFireability3371844513793175879.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability3590750168328845967.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3371844513793175879.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 2 LTL properties
Checking formula 0 : !(((F((F("((u2.p129==1)&&(u2.p164==1))"))&&(X("((u12.p116==1)&&(u12.p189==1))"))))||(X(G("((u2.p143==0)||(u2.p164==0))")))))
Formula 0 simplified : G(G!"((u2.p129==1)&&(u2.p164==1))" | X!"((u12.p116==1)&&(u12.p189==1))") & XF!"((u2.p143==0)||(u2.p164==0))"
Compilation finished in 450 ms.
Running link step : cd /tmp/ltsmin162828591120360372;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin162828591120360372;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>((<>((LTLAPp0==true))&&X((LTLAPp1==true))))||X([]((LTLAPp2==true))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t1, t176, t177, t210, u2.t8, u2.t90, u2.t94, u2.t95, u2.t96, u2.t97, u2.t98, u2.t99, u2.t100,...665
Computing Next relation with stutter on 3.98543e+06 deadlock states
61 unique states visited
61 strongly connected components in search stack
62 transitions explored
61 items max in DFS search stack
21852 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,218.551,4383680,1,0,1.34576e+07,135211,845,9.67222e+06,1387,809271,7392109
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA DES-PT-40a-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F(G((("((u2.p124==1)&&(u2.p164==1))")&&(F(G("((i11.u21.p211==1)&&(i11.u29.p228==1))"))))U((!("((u2.p147==1)&&(u2.p164==1))"))&&(F(!...194
Formula 1 simplified : GF((!"((u2.p124==1)&&(u2.p164==1))" | GF!"((i11.u21.p211==1)&&(i11.u29.p228==1))") R ("((u2.p147==1)&&(u2.p164==1))" | G"((u2.p137==...175
Computing Next relation with stutter on 3.98543e+06 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.006: LTL layer: formula: (<>((<>((LTLAPp0==true))&&X((LTLAPp1==true))))||X([]((LTLAPp2==true))))
pins2lts-mc-linux64( 1/ 8), 0.006: "(<>((<>((LTLAPp0==true))&&X((LTLAPp1==true))))||X([]((LTLAPp2==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.007: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.019: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.027: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.089: DFS-FIFO for weak LTL, using special progress label 225
pins2lts-mc-linux64( 0/ 8), 0.089: There are 226 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.089: State length is 274, there are 237 groups
pins2lts-mc-linux64( 0/ 8), 0.089: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.089: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.089: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.089: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 0.125: ~1 levels ~960 states ~6144 transitions
pins2lts-mc-linux64( 6/ 8), 0.148: ~1 levels ~1920 states ~12392 transitions
pins2lts-mc-linux64( 3/ 8), 0.178: ~1 levels ~3840 states ~18896 transitions
pins2lts-mc-linux64( 3/ 8), 0.230: ~1 levels ~7680 states ~38712 transitions
pins2lts-mc-linux64( 3/ 8), 0.352: ~1 levels ~15360 states ~82160 transitions
pins2lts-mc-linux64( 6/ 8), 0.573: ~1 levels ~30720 states ~177312 transitions
pins2lts-mc-linux64( 1/ 8), 0.958: ~1 levels ~61440 states ~349120 transitions
pins2lts-mc-linux64( 1/ 8), 1.672: ~1 levels ~122880 states ~667328 transitions
pins2lts-mc-linux64( 5/ 8), 3.036: ~1 levels ~245760 states ~1620424 transitions
pins2lts-mc-linux64( 0/ 8), 5.248: ~1 levels ~491520 states ~2977696 transitions
pins2lts-mc-linux64( 0/ 8), 10.005: ~1 levels ~983040 states ~7987344 transitions
pins2lts-mc-linux64( 4/ 8), 19.547: ~1 levels ~1966080 states ~19166568 transitions
pins2lts-mc-linux64( 4/ 8), 38.094: ~1 levels ~3932160 states ~38258952 transitions
pins2lts-mc-linux64( 4/ 8), 74.802: ~1 levels ~7864320 states ~78080528 transitions
pins2lts-mc-linux64( 4/ 8), 155.641: ~1 levels ~15728640 states ~163157088 transitions
pins2lts-mc-linux64( 1/ 8), 301.257: ~1 levels ~31457280 states ~320292544 transitions
pins2lts-mc-linux64( 1/ 8), 576.230: ~1 levels ~62914560 states ~622487952 transitions
pins2lts-mc-linux64( 6/ 8), 1011.355: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1011.382:
pins2lts-mc-linux64( 0/ 8), 1011.382: mean standard work distribution: 3.6% (states) 1.1% (transitions)
pins2lts-mc-linux64( 0/ 8), 1011.382:
pins2lts-mc-linux64( 0/ 8), 1011.382: Explored 100238675 states 1095765966 transitions, fanout: 10.932
pins2lts-mc-linux64( 0/ 8), 1011.382: Total exploration time 1011.280 sec (1011.250 sec minimum, 1011.266 sec on average)
pins2lts-mc-linux64( 0/ 8), 1011.382: States per second: 99121, Transitions per second: 1083544
pins2lts-mc-linux64( 0/ 8), 1011.382:
pins2lts-mc-linux64( 0/ 8), 1011.382: Progress states detected: 134217094
pins2lts-mc-linux64( 0/ 8), 1011.382: Redundant explorations: -25.3160
pins2lts-mc-linux64( 0/ 8), 1011.382:
pins2lts-mc-linux64( 0/ 8), 1011.382: Queue width: 8B, total height: 66012615, memory: 503.64MB
pins2lts-mc-linux64( 0/ 8), 1011.382: Tree memory: 1252.3MB, 9.8 B/state, compr.: 0.9%
pins2lts-mc-linux64( 0/ 8), 1011.382: Tree fill ratio (roots/leafs): 99.0%/89.0%
pins2lts-mc-linux64( 0/ 8), 1011.382: Stored 226 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1011.382: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1011.382: Est. total memory use: 1756.0MB (~1527.6MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin162828591120360372;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>((<>((LTLAPp0==true))&&X((LTLAPp1==true))))||X([]((LTLAPp2==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin162828591120360372;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>((<>((LTLAPp0==true))&&X((LTLAPp1==true))))||X([]((LTLAPp2==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-08 11:23:40] [INFO ] Applying decomposition
[2023-03-08 11:23:40] [INFO ] Flatten gal took : 11 ms
[2023-03-08 11:23:40] [INFO ] Decomposing Gal with order
[2023-03-08 11:23:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 11:23:40] [INFO ] Removed a total of 291 redundant transitions.
[2023-03-08 11:23:40] [INFO ] Flatten gal took : 19 ms
[2023-03-08 11:23:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 167 labels/synchronizations in 7 ms.
[2023-03-08 11:23:40] [INFO ] Time to serialize gal into /tmp/LTLFireability1992171377309631240.gal : 7 ms
[2023-03-08 11:23:40] [INFO ] Time to serialize properties into /tmp/LTLFireability5704700966406557420.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability1992171377309631240.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5704700966406557420.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G((("((u4.p124==1)&&(u7.p164==1))")&&(F(G("((u30.p211==1)&&(u38.p228==1))"))))U((!("((u4.p147==1)&&(u7.p164==1))"))&&(F(!("((u4.p...186
Formula 0 simplified : GF((!"((u4.p124==1)&&(u7.p164==1))" | GF!"((u30.p211==1)&&(u38.p228==1))") R ("((u4.p147==1)&&(u7.p164==1))" | G"((u4.p137==1)&&(u7....167
Detected timeout of ITS tools.
[2023-03-08 11:45:20] [INFO ] Flatten gal took : 9 ms
[2023-03-08 11:45:20] [INFO ] Input system was already deterministic with 217 transitions.
[2023-03-08 11:45:20] [INFO ] Transformed 273 places.
[2023-03-08 11:45:20] [INFO ] Transformed 217 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-08 11:45:20] [INFO ] Time to serialize gal into /tmp/LTLFireability2410775609803066636.gal : 3 ms
[2023-03-08 11:45:20] [INFO ] Time to serialize properties into /tmp/LTLFireability2081174183236951105.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2410775609803066636.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2081174183236951105.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G((("((p124==1)&&(p164==1))")&&(F(G("((p211==1)&&(p228==1))"))))U((!("((p147==1)&&(p164==1))"))&&(F(!("((p137==1)&&(p164==1))")))...160
Formula 0 simplified : GF((!"((p124==1)&&(p164==1))" | GF!"((p211==1)&&(p228==1))") R ("((p147==1)&&(p164==1))" | G"((p137==1)&&(p164==1))"))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393228 kB
MemFree: 11710612 kB
After kill :
MemTotal: 16393228 kB
MemFree: 16034216 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
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 r101-tall-167814475400460"
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 ;