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.r103-tall-167814478400484.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 lolaxred
Input is DES-PT-50b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r103-tall-167814478400484
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 7.3K Feb 26 15:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 26 15:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 15:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 15:44 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:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 15:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 138K Feb 26 15:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 26 15:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 26 15:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:51 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 127K 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-50b-LTLFireability-00
FORMULA_NAME DES-PT-50b-LTLFireability-01
FORMULA_NAME DES-PT-50b-LTLFireability-02
FORMULA_NAME DES-PT-50b-LTLFireability-03
FORMULA_NAME DES-PT-50b-LTLFireability-04
FORMULA_NAME DES-PT-50b-LTLFireability-05
FORMULA_NAME DES-PT-50b-LTLFireability-06
FORMULA_NAME DES-PT-50b-LTLFireability-07
FORMULA_NAME DES-PT-50b-LTLFireability-08
FORMULA_NAME DES-PT-50b-LTLFireability-09
FORMULA_NAME DES-PT-50b-LTLFireability-10
FORMULA_NAME DES-PT-50b-LTLFireability-11
FORMULA_NAME DES-PT-50b-LTLFireability-12
FORMULA_NAME DES-PT-50b-LTLFireability-13
FORMULA_NAME DES-PT-50b-LTLFireability-14
FORMULA_NAME DES-PT-50b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678254744850

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-50b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 05:52:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 05:52:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 05:52:26] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2023-03-08 05:52:26] [INFO ] Transformed 479 places.
[2023-03-08 05:52:26] [INFO ] Transformed 430 transitions.
[2023-03-08 05:52:26] [INFO ] Found NUPN structural information;
[2023-03-08 05:52:26] [INFO ] Parsed PT model containing 479 places and 430 transitions and 1463 arcs in 127 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 3 formulas.
FORMULA DES-PT-50b-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50b-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50b-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 430/430 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 476 transition count 430
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 27 place count 452 transition count 406
Iterating global reduction 1 with 24 rules applied. Total rules applied 51 place count 452 transition count 406
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 64 place count 439 transition count 393
Iterating global reduction 1 with 13 rules applied. Total rules applied 77 place count 439 transition count 393
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 88 place count 439 transition count 382
Applied a total of 88 rules in 89 ms. Remains 439 /479 variables (removed 40) and now considering 382/430 (removed 48) transitions.
// Phase 1: matrix 382 rows 439 cols
[2023-03-08 05:52:26] [INFO ] Computed 62 place invariants in 50 ms
[2023-03-08 05:52:27] [INFO ] Implicit Places using invariants in 528 ms returned []
[2023-03-08 05:52:27] [INFO ] Invariant cache hit.
[2023-03-08 05:52:27] [INFO ] Implicit Places using invariants and state equation in 488 ms returned []
Implicit Place search using SMT with State Equation took 1039 ms to find 0 implicit places.
[2023-03-08 05:52:27] [INFO ] Invariant cache hit.
[2023-03-08 05:52:27] [INFO ] Dead Transitions using invariants and state equation in 182 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 439/479 places, 382/430 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1310 ms. Remains : 439/479 places, 382/430 transitions.
Support contains 44 out of 439 places after structural reductions.
[2023-03-08 05:52:27] [INFO ] Flatten gal took : 56 ms
[2023-03-08 05:52:28] [INFO ] Flatten gal took : 30 ms
[2023-03-08 05:52:28] [INFO ] Input system was already deterministic with 382 transitions.
Incomplete random walk after 10000 steps, including 83 resets, run finished after 417 ms. (steps per millisecond=23 ) properties (out of 25) seen :14
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-08 05:52:29] [INFO ] Invariant cache hit.
[2023-03-08 05:52:29] [INFO ] [Real]Absence check using 33 positive place invariants in 9 ms returned sat
[2023-03-08 05:52:29] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 34 ms returned sat
[2023-03-08 05:52:29] [INFO ] After 236ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-08 05:52:29] [INFO ] [Nat]Absence check using 33 positive place invariants in 9 ms returned sat
[2023-03-08 05:52:29] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 26 ms returned sat
[2023-03-08 05:52:30] [INFO ] After 660ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-08 05:52:30] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 3 ms to minimize.
[2023-03-08 05:52:30] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 1 ms to minimize.
[2023-03-08 05:52:30] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 0 ms to minimize.
[2023-03-08 05:52:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 350 ms
[2023-03-08 05:52:30] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 2 ms to minimize.
[2023-03-08 05:52:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 153 ms
[2023-03-08 05:52:31] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 0 ms to minimize.
[2023-03-08 05:52:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
[2023-03-08 05:52:31] [INFO ] Deduced a trap composed of 36 places in 65 ms of which 0 ms to minimize.
[2023-03-08 05:52:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2023-03-08 05:52:31] [INFO ] Deduced a trap composed of 9 places in 161 ms of which 0 ms to minimize.
[2023-03-08 05:52:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 197 ms
[2023-03-08 05:52:31] [INFO ] After 2127ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 530 ms.
[2023-03-08 05:52:32] [INFO ] After 2952ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Fused 11 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 1286 ms.
Support contains 15 out of 439 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 382/382 transitions.
Graph (complete) has 1018 edges and 439 vertex of which 432 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 432 transition count 364
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 27 place count 420 transition count 364
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 27 place count 420 transition count 351
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 53 place count 407 transition count 351
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 55 place count 405 transition count 349
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 405 transition count 349
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 59 place count 405 transition count 347
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 61 place count 404 transition count 346
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 62 place count 403 transition count 345
Iterating global reduction 4 with 1 rules applied. Total rules applied 63 place count 403 transition count 345
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 64 place count 403 transition count 344
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 5 with 144 rules applied. Total rules applied 208 place count 331 transition count 272
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 6 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 214 place count 328 transition count 280
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 215 place count 328 transition count 279
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 216 place count 327 transition count 279
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 217 place count 326 transition count 278
Applied a total of 217 rules in 156 ms. Remains 326 /439 variables (removed 113) and now considering 278/382 (removed 104) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 326/439 places, 278/382 transitions.
Incomplete random walk after 10000 steps, including 382 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 83 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 83 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 83 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 74 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 683200 steps, run timeout after 3001 ms. (steps per millisecond=227 ) properties seen :{}
Probabilistic random walk after 683200 steps, saw 103677 distinct states, run finished after 3004 ms. (steps per millisecond=227 ) properties seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 278 rows 326 cols
[2023-03-08 05:52:37] [INFO ] Computed 61 place invariants in 7 ms
[2023-03-08 05:52:37] [INFO ] [Real]Absence check using 37 positive place invariants in 6 ms returned sat
[2023-03-08 05:52:37] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-08 05:52:37] [INFO ] After 185ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-08 05:52:37] [INFO ] [Nat]Absence check using 37 positive place invariants in 7 ms returned sat
[2023-03-08 05:52:37] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 142 ms returned sat
[2023-03-08 05:52:39] [INFO ] After 1047ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-08 05:52:39] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-08 05:52:39] [INFO ] After 598ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-08 05:52:40] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 1 ms to minimize.
[2023-03-08 05:52:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2023-03-08 05:52:40] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 0 ms to minimize.
[2023-03-08 05:52:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2023-03-08 05:52:40] [INFO ] After 1667ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 703 ms.
[2023-03-08 05:52:41] [INFO ] After 3795ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 430 ms.
Support contains 15 out of 326 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 326/326 places, 278/278 transitions.
Applied a total of 0 rules in 14 ms. Remains 326 /326 variables (removed 0) and now considering 278/278 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 326/326 places, 278/278 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 326/326 places, 278/278 transitions.
Applied a total of 0 rules in 16 ms. Remains 326 /326 variables (removed 0) and now considering 278/278 (removed 0) transitions.
[2023-03-08 05:52:41] [INFO ] Invariant cache hit.
[2023-03-08 05:52:42] [INFO ] Implicit Places using invariants in 307 ms returned []
[2023-03-08 05:52:42] [INFO ] Invariant cache hit.
[2023-03-08 05:52:42] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-08 05:52:42] [INFO ] Implicit Places using invariants and state equation in 427 ms returned []
Implicit Place search using SMT with State Equation took 742 ms to find 0 implicit places.
[2023-03-08 05:52:42] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-08 05:52:42] [INFO ] Invariant cache hit.
[2023-03-08 05:52:42] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 904 ms. Remains : 326/326 places, 278/278 transitions.
Graph (complete) has 1096 edges and 326 vertex of which 325 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 11 ms. Remains 325 /326 variables (removed 1) and now considering 278/278 (removed 0) transitions.
Running SMT prover for 11 properties.
// Phase 1: matrix 278 rows 325 cols
[2023-03-08 05:52:42] [INFO ] Computed 60 place invariants in 5 ms
[2023-03-08 05:52:43] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 05:52:43] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-08 05:52:43] [INFO ] After 406ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-08 05:52:43] [INFO ] [Nat]Absence check using 36 positive place invariants in 12 ms returned sat
[2023-03-08 05:52:43] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 119 ms returned sat
[2023-03-08 05:52:43] [INFO ] After 409ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-08 05:52:44] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2023-03-08 05:52:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2023-03-08 05:52:44] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2023-03-08 05:52:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2023-03-08 05:52:44] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2023-03-08 05:52:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2023-03-08 05:52:44] [INFO ] After 972ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 265 ms.
[2023-03-08 05:52:44] [INFO ] After 1576ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
FORMULA DES-PT-50b-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 257 stabilizing places and 249 stable transitions
Graph (complete) has 1018 edges and 439 vertex of which 432 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.14 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(G((p0||F(p1)))))'
Support contains 10 out of 439 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 439/439 places, 382/382 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 435 transition count 378
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 435 transition count 378
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 435 transition count 377
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 433 transition count 375
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 433 transition count 375
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 15 place count 433 transition count 373
Applied a total of 15 rules in 20 ms. Remains 433 /439 variables (removed 6) and now considering 373/382 (removed 9) transitions.
// Phase 1: matrix 373 rows 433 cols
[2023-03-08 05:52:45] [INFO ] Computed 62 place invariants in 6 ms
[2023-03-08 05:52:45] [INFO ] Implicit Places using invariants in 305 ms returned []
[2023-03-08 05:52:45] [INFO ] Invariant cache hit.
[2023-03-08 05:52:45] [INFO ] Implicit Places using invariants and state equation in 493 ms returned []
Implicit Place search using SMT with State Equation took 800 ms to find 0 implicit places.
[2023-03-08 05:52:45] [INFO ] Invariant cache hit.
[2023-03-08 05:52:46] [INFO ] Dead Transitions using invariants and state equation in 182 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 433/439 places, 373/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1003 ms. Remains : 433/439 places, 373/382 transitions.
Stuttering acceptance computed with spot in 210 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DES-PT-50b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s421 1) (EQ s431 1)), p1:(AND (EQ s317 1) (EQ s319 1) (EQ s321 1) (EQ s323 1) (EQ s325 1) (EQ s327 1) (EQ s329 1) (EQ s331 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 272 steps with 1 reset in 4 ms.
FORMULA DES-PT-50b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50b-LTLFireability-01 finished in 1284 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 3 out of 439 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 439/439 places, 382/382 transitions.
Graph (complete) has 1018 edges and 439 vertex of which 432 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 431 transition count 365
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 419 transition count 364
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 27 place count 418 transition count 364
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 27 place count 418 transition count 351
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 53 place count 405 transition count 351
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 54 place count 404 transition count 350
Iterating global reduction 3 with 1 rules applied. Total rules applied 55 place count 404 transition count 350
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 56 place count 403 transition count 349
Iterating global reduction 3 with 1 rules applied. Total rules applied 57 place count 403 transition count 349
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 58 place count 403 transition count 348
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 4 with 150 rules applied. Total rules applied 208 place count 328 transition count 273
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 214 place count 325 transition count 288
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 222 place count 325 transition count 280
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 224 place count 323 transition count 278
Applied a total of 224 rules in 123 ms. Remains 323 /439 variables (removed 116) and now considering 278/382 (removed 104) transitions.
// Phase 1: matrix 278 rows 323 cols
[2023-03-08 05:52:46] [INFO ] Computed 59 place invariants in 3 ms
[2023-03-08 05:52:46] [INFO ] Implicit Places using invariants in 216 ms returned []
[2023-03-08 05:52:46] [INFO ] Invariant cache hit.
[2023-03-08 05:52:46] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 05:52:47] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 623 ms to find 0 implicit places.
[2023-03-08 05:52:47] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-08 05:52:47] [INFO ] Invariant cache hit.
[2023-03-08 05:52:47] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 323/439 places, 278/382 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 899 ms. Remains : 323/439 places, 278/382 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-50b-LTLFireability-03 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 (NEQ s276 1) (OR (NEQ s206 1) (NEQ s232 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]]
Product exploration explored 100000 steps with 5597 reset in 290 ms.
Product exploration explored 100000 steps with 5576 reset in 284 ms.
Computed a total of 216 stabilizing places and 217 stable transitions
Computed a total of 216 stabilizing places and 217 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Finished random walk after 32 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=32 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 134 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 278/278 transitions.
Applied a total of 0 rules in 16 ms. Remains 323 /323 variables (removed 0) and now considering 278/278 (removed 0) transitions.
[2023-03-08 05:52:48] [INFO ] Invariant cache hit.
[2023-03-08 05:52:48] [INFO ] Implicit Places using invariants in 160 ms returned []
[2023-03-08 05:52:48] [INFO ] Invariant cache hit.
[2023-03-08 05:52:48] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 05:52:48] [INFO ] Implicit Places using invariants and state equation in 475 ms returned []
Implicit Place search using SMT with State Equation took 650 ms to find 0 implicit places.
[2023-03-08 05:52:48] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-08 05:52:48] [INFO ] Invariant cache hit.
[2023-03-08 05:52:49] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 813 ms. Remains : 323/323 places, 278/278 transitions.
Computed a total of 216 stabilizing places and 217 stable transitions
Computed a total of 216 stabilizing places and 217 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Finished random walk after 57 steps, including 2 resets, run visited all 1 properties in 3 ms. (steps per millisecond=19 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5623 reset in 225 ms.
Product exploration explored 100000 steps with 5598 reset in 269 ms.
Support contains 3 out of 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 278/278 transitions.
Applied a total of 0 rules in 10 ms. Remains 323 /323 variables (removed 0) and now considering 278/278 (removed 0) transitions.
[2023-03-08 05:52:50] [INFO ] Invariant cache hit.
[2023-03-08 05:52:50] [INFO ] Implicit Places using invariants in 173 ms returned []
[2023-03-08 05:52:50] [INFO ] Invariant cache hit.
[2023-03-08 05:52:50] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 05:52:50] [INFO ] Implicit Places using invariants and state equation in 464 ms returned []
Implicit Place search using SMT with State Equation took 652 ms to find 0 implicit places.
[2023-03-08 05:52:50] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 05:52:50] [INFO ] Invariant cache hit.
[2023-03-08 05:52:50] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 824 ms. Remains : 323/323 places, 278/278 transitions.
Treatment of property DES-PT-50b-LTLFireability-03 finished in 4676 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 1 out of 439 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 439/439 places, 382/382 transitions.
Graph (complete) has 1018 edges and 439 vertex of which 432 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 431 transition count 363
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 417 transition count 363
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 29 place count 417 transition count 351
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 53 place count 405 transition count 351
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 55 place count 403 transition count 349
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 403 transition count 349
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 59 place count 403 transition count 347
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 61 place count 402 transition count 346
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 62 place count 401 transition count 345
Iterating global reduction 4 with 1 rules applied. Total rules applied 63 place count 401 transition count 345
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 64 place count 401 transition count 344
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 0 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 5 with 156 rules applied. Total rules applied 220 place count 323 transition count 266
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 224 place count 321 transition count 268
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 226 place count 319 transition count 266
Applied a total of 226 rules in 108 ms. Remains 319 /439 variables (removed 120) and now considering 266/382 (removed 116) transitions.
// Phase 1: matrix 266 rows 319 cols
[2023-03-08 05:52:51] [INFO ] Computed 59 place invariants in 3 ms
[2023-03-08 05:52:51] [INFO ] Implicit Places using invariants in 323 ms returned []
[2023-03-08 05:52:51] [INFO ] Invariant cache hit.
[2023-03-08 05:52:51] [INFO ] Implicit Places using invariants and state equation in 375 ms returned []
Implicit Place search using SMT with State Equation took 700 ms to find 0 implicit places.
[2023-03-08 05:52:51] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:52:51] [INFO ] Invariant cache hit.
[2023-03-08 05:52:51] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 319/439 places, 266/382 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 931 ms. Remains : 319/439 places, 266/382 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-50b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s211 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 29 steps with 0 reset in 1 ms.
FORMULA DES-PT-50b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50b-LTLFireability-04 finished in 977 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(G(p0))))'
Support contains 3 out of 439 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 439/439 places, 382/382 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 435 transition count 378
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 435 transition count 378
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 435 transition count 377
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 433 transition count 375
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 433 transition count 375
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 15 place count 433 transition count 373
Applied a total of 15 rules in 18 ms. Remains 433 /439 variables (removed 6) and now considering 373/382 (removed 9) transitions.
// Phase 1: matrix 373 rows 433 cols
[2023-03-08 05:52:51] [INFO ] Computed 62 place invariants in 11 ms
[2023-03-08 05:52:52] [INFO ] Implicit Places using invariants in 178 ms returned []
[2023-03-08 05:52:52] [INFO ] Invariant cache hit.
[2023-03-08 05:52:52] [INFO ] Implicit Places using invariants and state equation in 503 ms returned []
Implicit Place search using SMT with State Equation took 684 ms to find 0 implicit places.
[2023-03-08 05:52:52] [INFO ] Invariant cache hit.
[2023-03-08 05:52:52] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 433/439 places, 373/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 874 ms. Remains : 433/439 places, 373/382 transitions.
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-50b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s275 1) (EQ s48 1) (EQ s289 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DES-PT-50b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50b-LTLFireability-05 finished in 997 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(F(p0)))'
Support contains 2 out of 439 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 439/439 places, 382/382 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 435 transition count 378
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 435 transition count 378
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 435 transition count 377
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 433 transition count 375
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 433 transition count 375
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 15 place count 433 transition count 373
Applied a total of 15 rules in 19 ms. Remains 433 /439 variables (removed 6) and now considering 373/382 (removed 9) transitions.
[2023-03-08 05:52:52] [INFO ] Invariant cache hit.
[2023-03-08 05:52:53] [INFO ] Implicit Places using invariants in 168 ms returned []
[2023-03-08 05:52:53] [INFO ] Invariant cache hit.
[2023-03-08 05:52:53] [INFO ] Implicit Places using invariants and state equation in 488 ms returned []
Implicit Place search using SMT with State Equation took 657 ms to find 0 implicit places.
[2023-03-08 05:52:53] [INFO ] Invariant cache hit.
[2023-03-08 05:52:53] [INFO ] Dead Transitions using invariants and state equation in 171 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 433/439 places, 373/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 848 ms. Remains : 433/439 places, 373/382 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-50b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s318 1) (EQ s344 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 129 steps with 0 reset in 2 ms.
FORMULA DES-PT-50b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50b-LTLFireability-06 finished in 919 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))))'
Support contains 3 out of 439 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 439/439 places, 382/382 transitions.
Graph (complete) has 1018 edges and 439 vertex of which 432 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 431 transition count 364
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 418 transition count 364
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 27 place count 418 transition count 350
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 55 place count 404 transition count 350
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 57 place count 402 transition count 348
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 402 transition count 348
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 61 place count 402 transition count 346
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 63 place count 401 transition count 345
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 64 place count 400 transition count 344
Iterating global reduction 4 with 1 rules applied. Total rules applied 65 place count 400 transition count 344
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 66 place count 400 transition count 343
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 5 with 150 rules applied. Total rules applied 216 place count 325 transition count 268
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 222 place count 322 transition count 276
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 224 place count 320 transition count 274
Applied a total of 224 rules in 54 ms. Remains 320 /439 variables (removed 119) and now considering 274/382 (removed 108) transitions.
// Phase 1: matrix 274 rows 320 cols
[2023-03-08 05:52:54] [INFO ] Computed 59 place invariants in 3 ms
[2023-03-08 05:52:54] [INFO ] Implicit Places using invariants in 159 ms returned []
[2023-03-08 05:52:54] [INFO ] Invariant cache hit.
[2023-03-08 05:52:54] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 05:52:54] [INFO ] Implicit Places using invariants and state equation in 470 ms returned []
Implicit Place search using SMT with State Equation took 636 ms to find 0 implicit places.
[2023-03-08 05:52:54] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 05:52:54] [INFO ] Invariant cache hit.
[2023-03-08 05:52:54] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 320/439 places, 274/382 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 823 ms. Remains : 320/439 places, 274/382 transitions.
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-50b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s57 0) (EQ s315 0)), p1:(OR (EQ s66 0) (EQ s315 0))], 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 5190 reset in 292 ms.
Product exploration explored 100000 steps with 5155 reset in 278 ms.
Computed a total of 217 stabilizing places and 218 stable transitions
Computed a total of 217 stabilizing places and 218 stable transitions
Detected a total of 217/320 stabilizing places and 218/274 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 361 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 515 resets, run finished after 189 ms. (steps per millisecond=52 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 97 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 110 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 924605 steps, run timeout after 3001 ms. (steps per millisecond=308 ) properties seen :{}
Probabilistic random walk after 924605 steps, saw 129543 distinct states, run finished after 3001 ms. (steps per millisecond=308 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-08 05:52:59] [INFO ] Invariant cache hit.
[2023-03-08 05:52:59] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 05:52:59] [INFO ] [Nat]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-08 05:52:59] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 44 ms returned sat
[2023-03-08 05:52:59] [INFO ] After 230ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-08 05:52:59] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 05:52:59] [INFO ] After 92ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2023-03-08 05:52:59] [INFO ] After 257ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 76 ms.
[2023-03-08 05:52:59] [INFO ] After 716ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 131 ms.
Support contains 3 out of 320 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 320/320 places, 274/274 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 320 transition count 273
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 320 transition count 272
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 319 transition count 272
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 319 transition count 272
Applied a total of 4 rules in 24 ms. Remains 319 /320 variables (removed 1) and now considering 272/274 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 319/320 places, 272/274 transitions.
Incomplete random walk after 10000 steps, including 497 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 91 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 109 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1121909 steps, run timeout after 3001 ms. (steps per millisecond=373 ) properties seen :{}
Probabilistic random walk after 1121909 steps, saw 156315 distinct states, run finished after 3001 ms. (steps per millisecond=373 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 272 rows 319 cols
[2023-03-08 05:53:03] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-08 05:53:03] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 05:53:03] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 05:53:03] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 139 ms returned sat
[2023-03-08 05:53:03] [INFO ] After 364ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 05:53:03] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 05:53:04] [INFO ] After 66ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-08 05:53:04] [INFO ] After 168ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 60 ms.
[2023-03-08 05:53:04] [INFO ] After 844ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 97 ms.
Support contains 3 out of 319 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 319/319 places, 272/272 transitions.
Applied a total of 0 rules in 6 ms. Remains 319 /319 variables (removed 0) and now considering 272/272 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 319/319 places, 272/272 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 319/319 places, 272/272 transitions.
Applied a total of 0 rules in 6 ms. Remains 319 /319 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2023-03-08 05:53:04] [INFO ] Invariant cache hit.
[2023-03-08 05:53:04] [INFO ] Implicit Places using invariants in 288 ms returned []
[2023-03-08 05:53:04] [INFO ] Invariant cache hit.
[2023-03-08 05:53:04] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 05:53:05] [INFO ] Implicit Places using invariants and state equation in 464 ms returned []
Implicit Place search using SMT with State Equation took 754 ms to find 0 implicit places.
[2023-03-08 05:53:05] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:53:05] [INFO ] Invariant cache hit.
[2023-03-08 05:53:05] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 904 ms. Remains : 319/319 places, 272/272 transitions.
Graph (complete) has 1132 edges and 319 vertex of which 318 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 318 transition count 272
Applied a total of 2 rules in 15 ms. Remains 318 /319 variables (removed 1) and now considering 272/272 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 272 rows 318 cols
[2023-03-08 05:53:05] [INFO ] Computed 59 place invariants in 5 ms
[2023-03-08 05:53:05] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 05:53:05] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 05:53:05] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 100 ms returned sat
[2023-03-08 05:53:05] [INFO ] After 459ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 05:53:06] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
[2023-03-08 05:53:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2023-03-08 05:53:06] [INFO ] After 625ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 76 ms.
[2023-03-08 05:53:06] [INFO ] After 912ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (OR (G p0) (G (NOT p0))))
Knowledge based reduction with 12 factoid took 363 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-50b-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-50b-LTLFireability-08 finished in 12699 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((!p0&&X((F(p1)||G(!p0))))))'
Support contains 2 out of 439 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 : 439/439 places, 382/382 transitions.
Graph (complete) has 1018 edges and 439 vertex of which 432 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 431 transition count 364
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 418 transition count 364
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 27 place count 418 transition count 351
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 53 place count 405 transition count 351
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 55 place count 403 transition count 349
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 403 transition count 349
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 59 place count 403 transition count 347
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 60 place count 402 transition count 347
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 61 place count 401 transition count 346
Iterating global reduction 4 with 1 rules applied. Total rules applied 62 place count 401 transition count 346
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 63 place count 401 transition count 345
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 5 with 148 rules applied. Total rules applied 211 place count 327 transition count 271
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 215 place count 325 transition count 273
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 217 place count 323 transition count 271
Applied a total of 217 rules in 52 ms. Remains 323 /439 variables (removed 116) and now considering 271/382 (removed 111) transitions.
// Phase 1: matrix 271 rows 323 cols
[2023-03-08 05:53:06] [INFO ] Computed 59 place invariants in 4 ms
[2023-03-08 05:53:06] [INFO ] Implicit Places using invariants in 163 ms returned []
[2023-03-08 05:53:06] [INFO ] Invariant cache hit.
[2023-03-08 05:53:06] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-08 05:53:07] [INFO ] Implicit Places using invariants and state equation in 449 ms returned []
Implicit Place search using SMT with State Equation took 614 ms to find 0 implicit places.
[2023-03-08 05:53:07] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 05:53:07] [INFO ] Invariant cache hit.
[2023-03-08 05:53:07] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 323/439 places, 271/382 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 798 ms. Remains : 323/439 places, 271/382 transitions.
Stuttering acceptance computed with spot in 31 ms :[true, p0]
Running random walk in product with property : DES-PT-50b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (EQ s113 1) (EQ s234 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4461 reset in 251 ms.
Product exploration explored 100000 steps with 4437 reset in 233 ms.
Computed a total of 218 stabilizing places and 215 stable transitions
Computed a total of 218 stabilizing places and 215 stable transitions
Detected a total of 218/323 stabilizing places and 215/271 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 154 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[true, p0]
Incomplete random walk after 10000 steps, including 444 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 82 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1595545 steps, run timeout after 3001 ms. (steps per millisecond=531 ) properties seen :{}
Probabilistic random walk after 1595545 steps, saw 210004 distinct states, run finished after 3001 ms. (steps per millisecond=531 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 05:53:11] [INFO ] Invariant cache hit.
[2023-03-08 05:53:11] [INFO ] [Real]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-08 05:53:11] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 17 ms returned sat
[2023-03-08 05:53:11] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:53:11] [INFO ] [Nat]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-08 05:53:11] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 88 ms returned sat
[2023-03-08 05:53:11] [INFO ] After 164ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:53:11] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-08 05:53:11] [INFO ] After 16ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 05:53:11] [INFO ] After 43ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-08 05:53:11] [INFO ] After 370ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 2 out of 323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 323/323 places, 271/271 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 323 transition count 269
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 322 transition count 268
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 321 transition count 274
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 321 transition count 273
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 320 transition count 273
Applied a total of 8 rules in 18 ms. Remains 320 /323 variables (removed 3) and now considering 273/271 (removed -2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 320/323 places, 273/271 transitions.
Incomplete random walk after 10000 steps, including 478 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 85 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1533030 steps, run timeout after 3001 ms. (steps per millisecond=510 ) properties seen :{}
Probabilistic random walk after 1533030 steps, saw 207536 distinct states, run finished after 3001 ms. (steps per millisecond=510 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 273 rows 320 cols
[2023-03-08 05:53:14] [INFO ] Computed 60 place invariants in 8 ms
[2023-03-08 05:53:14] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 05:53:14] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-08 05:53:14] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:53:14] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 05:53:14] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 128 ms returned sat
[2023-03-08 05:53:15] [INFO ] After 284ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:53:15] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 05:53:15] [INFO ] After 22ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 05:53:15] [INFO ] After 44ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-08 05:53:15] [INFO ] After 542ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 2 out of 320 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 320/320 places, 273/273 transitions.
Applied a total of 0 rules in 5 ms. Remains 320 /320 variables (removed 0) and now considering 273/273 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 320/320 places, 273/273 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 320/320 places, 273/273 transitions.
Applied a total of 0 rules in 5 ms. Remains 320 /320 variables (removed 0) and now considering 273/273 (removed 0) transitions.
[2023-03-08 05:53:15] [INFO ] Invariant cache hit.
[2023-03-08 05:53:15] [INFO ] Implicit Places using invariants in 162 ms returned []
[2023-03-08 05:53:15] [INFO ] Invariant cache hit.
[2023-03-08 05:53:15] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 05:53:15] [INFO ] Implicit Places using invariants and state equation in 497 ms returned []
Implicit Place search using SMT with State Equation took 674 ms to find 0 implicit places.
[2023-03-08 05:53:15] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 05:53:15] [INFO ] Invariant cache hit.
[2023-03-08 05:53:16] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 814 ms. Remains : 320/320 places, 273/273 transitions.
Graph (complete) has 1114 edges and 320 vertex of which 319 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 319 /320 variables (removed 1) and now considering 273/273 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 273 rows 319 cols
[2023-03-08 05:53:16] [INFO ] Computed 59 place invariants in 3 ms
[2023-03-08 05:53:16] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 05:53:16] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-08 05:53:16] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:53:16] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 05:53:16] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 36 ms returned sat
[2023-03-08 05:53:16] [INFO ] After 183ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:53:16] [INFO ] After 214ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-08 05:53:16] [INFO ] After 322ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 211 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[true, p0]
Stuttering acceptance computed with spot in 33 ms :[true, p0]
Support contains 2 out of 323 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 : 323/323 places, 271/271 transitions.
Applied a total of 0 rules in 12 ms. Remains 323 /323 variables (removed 0) and now considering 271/271 (removed 0) transitions.
// Phase 1: matrix 271 rows 323 cols
[2023-03-08 05:53:16] [INFO ] Computed 59 place invariants in 6 ms
[2023-03-08 05:53:17] [INFO ] Implicit Places using invariants in 174 ms returned []
[2023-03-08 05:53:17] [INFO ] Invariant cache hit.
[2023-03-08 05:53:17] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-08 05:53:17] [INFO ] Implicit Places using invariants and state equation in 449 ms returned []
Implicit Place search using SMT with State Equation took 632 ms to find 0 implicit places.
[2023-03-08 05:53:17] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 05:53:17] [INFO ] Invariant cache hit.
[2023-03-08 05:53:17] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 781 ms. Remains : 323/323 places, 271/271 transitions.
Computed a total of 218 stabilizing places and 215 stable transitions
Computed a total of 218 stabilizing places and 215 stable transitions
Detected a total of 218/323 stabilizing places and 215/271 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 188 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[true, p0]
Incomplete random walk after 10000 steps, including 418 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 81 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1534779 steps, run timeout after 3001 ms. (steps per millisecond=511 ) properties seen :{}
Probabilistic random walk after 1534779 steps, saw 201710 distinct states, run finished after 3002 ms. (steps per millisecond=511 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 05:53:20] [INFO ] Invariant cache hit.
[2023-03-08 05:53:20] [INFO ] [Real]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-08 05:53:20] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 21 ms returned sat
[2023-03-08 05:53:20] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:53:21] [INFO ] [Nat]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-08 05:53:21] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 90 ms returned sat
[2023-03-08 05:53:21] [INFO ] After 168ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:53:21] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-08 05:53:21] [INFO ] After 19ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 05:53:21] [INFO ] After 48ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-08 05:53:21] [INFO ] After 392ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 2 out of 323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 323/323 places, 271/271 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 323 transition count 269
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 322 transition count 268
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 321 transition count 274
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 321 transition count 273
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 320 transition count 273
Applied a total of 8 rules in 18 ms. Remains 320 /323 variables (removed 3) and now considering 273/271 (removed -2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 320/323 places, 273/271 transitions.
Incomplete random walk after 10000 steps, including 498 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1522444 steps, run timeout after 3001 ms. (steps per millisecond=507 ) properties seen :{}
Probabilistic random walk after 1522444 steps, saw 206071 distinct states, run finished after 3001 ms. (steps per millisecond=507 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 273 rows 320 cols
[2023-03-08 05:53:24] [INFO ] Computed 60 place invariants in 8 ms
[2023-03-08 05:53:24] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 05:53:24] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-08 05:53:24] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:53:24] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 05:53:24] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 112 ms returned sat
[2023-03-08 05:53:24] [INFO ] After 282ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:53:24] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 05:53:25] [INFO ] After 22ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 05:53:25] [INFO ] After 51ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-08 05:53:25] [INFO ] After 518ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 2 out of 320 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 320/320 places, 273/273 transitions.
Applied a total of 0 rules in 4 ms. Remains 320 /320 variables (removed 0) and now considering 273/273 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 320/320 places, 273/273 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 320/320 places, 273/273 transitions.
Applied a total of 0 rules in 6 ms. Remains 320 /320 variables (removed 0) and now considering 273/273 (removed 0) transitions.
[2023-03-08 05:53:25] [INFO ] Invariant cache hit.
[2023-03-08 05:53:25] [INFO ] Implicit Places using invariants in 143 ms returned []
[2023-03-08 05:53:25] [INFO ] Invariant cache hit.
[2023-03-08 05:53:25] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 05:53:25] [INFO ] Implicit Places using invariants and state equation in 414 ms returned []
Implicit Place search using SMT with State Equation took 558 ms to find 0 implicit places.
[2023-03-08 05:53:25] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:53:25] [INFO ] Invariant cache hit.
[2023-03-08 05:53:25] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 697 ms. Remains : 320/320 places, 273/273 transitions.
Graph (complete) has 1114 edges and 320 vertex of which 319 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 319 /320 variables (removed 1) and now considering 273/273 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 273 rows 319 cols
[2023-03-08 05:53:25] [INFO ] Computed 59 place invariants in 4 ms
[2023-03-08 05:53:25] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 05:53:25] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 15 ms returned sat
[2023-03-08 05:53:25] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:53:25] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 05:53:25] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 35 ms returned sat
[2023-03-08 05:53:26] [INFO ] After 184ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:53:26] [INFO ] After 210ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-08 05:53:26] [INFO ] After 306ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 189 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[true, p0]
Stuttering acceptance computed with spot in 37 ms :[true, p0]
Stuttering acceptance computed with spot in 40 ms :[true, p0]
Product exploration explored 100000 steps with 4465 reset in 209 ms.
Product exploration explored 100000 steps with 4468 reset in 229 ms.
Support contains 2 out of 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 271/271 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 323 transition count 270
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 322 transition count 269
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 321 transition count 275
Applied a total of 5 rules in 11 ms. Remains 321 /323 variables (removed 2) and now considering 275/271 (removed -4) transitions.
// Phase 1: matrix 275 rows 321 cols
[2023-03-08 05:53:26] [INFO ] Computed 59 place invariants in 9 ms
[2023-03-08 05:53:27] [INFO ] Implicit Places using invariants in 165 ms returned []
[2023-03-08 05:53:27] [INFO ] Invariant cache hit.
[2023-03-08 05:53:27] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 05:53:27] [INFO ] Implicit Places using invariants and state equation in 461 ms returned []
Implicit Place search using SMT with State Equation took 626 ms to find 0 implicit places.
[2023-03-08 05:53:27] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 05:53:27] [INFO ] Invariant cache hit.
[2023-03-08 05:53:27] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 321/323 places, 275/271 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 771 ms. Remains : 321/323 places, 275/271 transitions.
Treatment of property DES-PT-50b-LTLFireability-09 finished in 21192 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) U p1)&&X(F(p2))))'
Support contains 5 out of 439 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 439/439 places, 382/382 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 435 transition count 378
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 435 transition count 378
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 435 transition count 377
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 433 transition count 375
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 433 transition count 375
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 15 place count 433 transition count 373
Applied a total of 15 rules in 18 ms. Remains 433 /439 variables (removed 6) and now considering 373/382 (removed 9) transitions.
// Phase 1: matrix 373 rows 433 cols
[2023-03-08 05:53:27] [INFO ] Computed 62 place invariants in 8 ms
[2023-03-08 05:53:27] [INFO ] Implicit Places using invariants in 183 ms returned []
[2023-03-08 05:53:27] [INFO ] Invariant cache hit.
[2023-03-08 05:53:28] [INFO ] Implicit Places using invariants and state equation in 505 ms returned []
Implicit Place search using SMT with State Equation took 690 ms to find 0 implicit places.
[2023-03-08 05:53:28] [INFO ] Invariant cache hit.
[2023-03-08 05:53:28] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 433/439 places, 373/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 885 ms. Remains : 433/439 places, 373/382 transitions.
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : DES-PT-50b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s413 1) (EQ s418 1)), p0:(AND (EQ s242 1) (EQ s262 1)), p2:(EQ s241 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 210 steps with 1 reset in 0 ms.
FORMULA DES-PT-50b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50b-LTLFireability-10 finished in 1038 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 2 out of 439 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 439/439 places, 382/382 transitions.
Graph (complete) has 1018 edges and 439 vertex of which 432 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 431 transition count 363
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 417 transition count 363
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 29 place count 417 transition count 350
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 55 place count 404 transition count 350
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 57 place count 402 transition count 348
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 402 transition count 348
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 61 place count 402 transition count 346
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 63 place count 401 transition count 345
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 64 place count 400 transition count 344
Iterating global reduction 4 with 1 rules applied. Total rules applied 65 place count 400 transition count 344
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 66 place count 400 transition count 343
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 5 with 148 rules applied. Total rules applied 214 place count 326 transition count 269
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 220 place count 323 transition count 277
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 222 place count 321 transition count 275
Applied a total of 222 rules in 47 ms. Remains 321 /439 variables (removed 118) and now considering 275/382 (removed 107) transitions.
// Phase 1: matrix 275 rows 321 cols
[2023-03-08 05:53:28] [INFO ] Computed 59 place invariants in 6 ms
[2023-03-08 05:53:28] [INFO ] Implicit Places using invariants in 151 ms returned []
[2023-03-08 05:53:28] [INFO ] Invariant cache hit.
[2023-03-08 05:53:29] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 05:53:29] [INFO ] Implicit Places using invariants and state equation in 368 ms returned []
Implicit Place search using SMT with State Equation took 521 ms to find 0 implicit places.
[2023-03-08 05:53:29] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:53:29] [INFO ] Invariant cache hit.
[2023-03-08 05:53:29] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 321/439 places, 275/382 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 703 ms. Remains : 321/439 places, 275/382 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-50b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s108 1) (EQ s232 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 10 steps with 0 reset in 0 ms.
FORMULA DES-PT-50b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50b-LTLFireability-11 finished in 741 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(G((p0 U (G(F((p2&&X((p2 U (!p3||G(p2)))))))&&p1)))))'
Support contains 6 out of 439 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 439/439 places, 382/382 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 436 transition count 379
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 436 transition count 379
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 436 transition count 378
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 434 transition count 376
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 434 transition count 376
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 13 place count 434 transition count 374
Applied a total of 13 rules in 21 ms. Remains 434 /439 variables (removed 5) and now considering 374/382 (removed 8) transitions.
// Phase 1: matrix 374 rows 434 cols
[2023-03-08 05:53:29] [INFO ] Computed 62 place invariants in 13 ms
[2023-03-08 05:53:29] [INFO ] Implicit Places using invariants in 179 ms returned []
[2023-03-08 05:53:29] [INFO ] Invariant cache hit.
[2023-03-08 05:53:30] [INFO ] Implicit Places using invariants and state equation in 473 ms returned []
Implicit Place search using SMT with State Equation took 653 ms to find 0 implicit places.
[2023-03-08 05:53:30] [INFO ] Invariant cache hit.
[2023-03-08 05:53:30] [INFO ] Dead Transitions using invariants and state equation in 171 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 434/439 places, 374/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 846 ms. Remains : 434/439 places, 374/382 transitions.
Stuttering acceptance computed with spot in 269 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p2), (OR (NOT p2) (NOT p1)), (AND (NOT p2) p3)]
Running random walk in product with property : DES-PT-50b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 5}, { cond=(AND p1 p2), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}, { cond=p2, acceptance={0} source=3 dest: 6}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}, { cond=p2, acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 3}, { cond=p1, acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 5}, { cond=(AND p1 p2), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p2) p3), acceptance={0} source=6 dest: 3}, { cond=(AND p2 p3), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(AND (EQ s98 1) (EQ s426 1)), p0:(EQ s251 1), p2:(NEQ s209 1), p3:(AND (EQ s174 1) (EQ s222 1))], 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-50b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50b-LTLFireability-12 finished in 1137 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||X((!p1 U (p2||G(!p1))))))))'
Support contains 3 out of 439 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 439/439 places, 382/382 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 435 transition count 378
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 435 transition count 378
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 435 transition count 377
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 433 transition count 375
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 433 transition count 375
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 15 place count 433 transition count 373
Applied a total of 15 rules in 22 ms. Remains 433 /439 variables (removed 6) and now considering 373/382 (removed 9) transitions.
// Phase 1: matrix 373 rows 433 cols
[2023-03-08 05:53:30] [INFO ] Computed 62 place invariants in 10 ms
[2023-03-08 05:53:30] [INFO ] Implicit Places using invariants in 188 ms returned []
[2023-03-08 05:53:30] [INFO ] Invariant cache hit.
[2023-03-08 05:53:31] [INFO ] Implicit Places using invariants and state equation in 513 ms returned []
Implicit Place search using SMT with State Equation took 703 ms to find 0 implicit places.
[2023-03-08 05:53:31] [INFO ] Invariant cache hit.
[2023-03-08 05:53:31] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 433/439 places, 373/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 901 ms. Remains : 433/439 places, 373/382 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : DES-PT-50b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p2), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 0}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1))), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(AND (EQ s36 1) (EQ s289 1) (OR (EQ s30 0) (EQ s289 0))), p2:(AND (NOT (AND (EQ s36 1) (EQ s289 1))) (NOT (AND (EQ s30 1) (EQ s289 1)))), p1:(AND (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 893 reset in 217 ms.
Product exploration explored 100000 steps with 891 reset in 218 ms.
Computed a total of 256 stabilizing places and 248 stable transitions
Graph (complete) has 1006 edges and 433 vertex of which 427 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Computed a total of 256 stabilizing places and 248 stable transitions
Detected a total of 256/433 stabilizing places and 248/373 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 p2))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 680 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter sensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 87 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 699778 steps, run timeout after 3001 ms. (steps per millisecond=233 ) properties seen :{}
Probabilistic random walk after 699778 steps, saw 117261 distinct states, run finished after 3001 ms. (steps per millisecond=233 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-08 05:53:36] [INFO ] Invariant cache hit.
[2023-03-08 05:53:36] [INFO ] [Real]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 05:53:36] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 29 ms returned sat
[2023-03-08 05:53:36] [INFO ] After 134ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:4
[2023-03-08 05:53:36] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 05:53:36] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 31 ms returned sat
[2023-03-08 05:53:36] [INFO ] After 343ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :4
[2023-03-08 05:53:36] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2023-03-08 05:53:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2023-03-08 05:53:37] [INFO ] After 585ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :4
Attempting to minimize the solution found.
Minimization took 126 ms.
[2023-03-08 05:53:37] [INFO ] After 855ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :4
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 222 ms.
Support contains 3 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 373/373 transitions.
Graph (complete) has 1006 edges and 433 vertex of which 427 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 427 transition count 351
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 37 place count 410 transition count 351
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 37 place count 410 transition count 340
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 59 place count 399 transition count 340
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 213 place count 322 transition count 263
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 217 place count 320 transition count 265
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 218 place count 320 transition count 264
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 219 place count 319 transition count 264
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 220 place count 319 transition count 264
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 221 place count 318 transition count 263
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 222 place count 317 transition count 263
Applied a total of 222 rules in 36 ms. Remains 317 /433 variables (removed 116) and now considering 263/373 (removed 110) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 317/433 places, 263/373 transitions.
Incomplete random walk after 10000 steps, including 486 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 98 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 89 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 94 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 967147 steps, run timeout after 3001 ms. (steps per millisecond=322 ) properties seen :{}
Probabilistic random walk after 967147 steps, saw 135234 distinct states, run finished after 3002 ms. (steps per millisecond=322 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 263 rows 317 cols
[2023-03-08 05:53:40] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-08 05:53:40] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 05:53:40] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-08 05:53:40] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 05:53:40] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 05:53:40] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 31 ms returned sat
[2023-03-08 05:53:41] [INFO ] After 459ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-08 05:53:41] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2023-03-08 05:53:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2023-03-08 05:53:41] [INFO ] After 617ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 90 ms.
[2023-03-08 05:53:41] [INFO ] After 918ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 86 ms.
Support contains 3 out of 317 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 317/317 places, 263/263 transitions.
Applied a total of 0 rules in 5 ms. Remains 317 /317 variables (removed 0) and now considering 263/263 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 317/317 places, 263/263 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 317/317 places, 263/263 transitions.
Applied a total of 0 rules in 4 ms. Remains 317 /317 variables (removed 0) and now considering 263/263 (removed 0) transitions.
[2023-03-08 05:53:41] [INFO ] Invariant cache hit.
[2023-03-08 05:53:42] [INFO ] Implicit Places using invariants in 146 ms returned []
[2023-03-08 05:53:42] [INFO ] Invariant cache hit.
[2023-03-08 05:53:42] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
[2023-03-08 05:53:42] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:53:42] [INFO ] Invariant cache hit.
[2023-03-08 05:53:42] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 588 ms. Remains : 317/317 places, 263/263 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 317 transition count 263
Applied a total of 1 rules in 8 ms. Remains 317 /317 variables (removed 0) and now considering 263/263 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 263 rows 317 cols
[2023-03-08 05:53:42] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-08 05:53:42] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 05:53:42] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-08 05:53:42] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 05:53:42] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 05:53:42] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 32 ms returned sat
[2023-03-08 05:53:43] [INFO ] After 324ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-08 05:53:43] [INFO ] After 447ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 98 ms.
[2023-03-08 05:53:43] [INFO ] After 745ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 p2))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p0 p1 (NOT p2)))), (G (NOT (AND p0 p2)))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 515 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 32 ms :[(AND p1 (NOT p2))]
Support contains 3 out of 433 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 433/433 places, 373/373 transitions.
Graph (complete) has 1006 edges and 433 vertex of which 427 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 426 transition count 354
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 411 transition count 354
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 31 place count 411 transition count 343
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 53 place count 400 transition count 343
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 207 place count 323 transition count 266
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 211 place count 321 transition count 268
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 213 place count 319 transition count 266
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 214 place count 318 transition count 266
Applied a total of 214 rules in 26 ms. Remains 318 /433 variables (removed 115) and now considering 266/373 (removed 107) transitions.
// Phase 1: matrix 266 rows 318 cols
[2023-03-08 05:53:43] [INFO ] Computed 58 place invariants in 8 ms
[2023-03-08 05:53:44] [INFO ] Implicit Places using invariants in 153 ms returned []
[2023-03-08 05:53:44] [INFO ] Invariant cache hit.
[2023-03-08 05:53:44] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 492 ms to find 0 implicit places.
[2023-03-08 05:53:44] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:53:44] [INFO ] Invariant cache hit.
[2023-03-08 05:53:44] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 318/433 places, 266/373 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 650 ms. Remains : 318/433 places, 266/373 transitions.
Computed a total of 215 stabilizing places and 210 stable transitions
Computed a total of 215 stabilizing places and 210 stable transitions
Detected a total of 215/318 stabilizing places and 210/266 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p2), (X (OR (NOT p1) p2)), (X (NOT (AND p1 (NOT p2)))), (X (X (OR (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 251 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 539 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 104 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 109 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1234199 steps, run timeout after 3001 ms. (steps per millisecond=411 ) properties seen :{}
Probabilistic random walk after 1234199 steps, saw 171151 distinct states, run finished after 3001 ms. (steps per millisecond=411 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-08 05:53:48] [INFO ] Invariant cache hit.
[2023-03-08 05:53:48] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 05:53:48] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 13 ms returned sat
[2023-03-08 05:53:48] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 05:53:48] [INFO ] [Nat]Absence check using 33 positive place invariants in 3 ms returned sat
[2023-03-08 05:53:48] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 54 ms returned sat
[2023-03-08 05:53:48] [INFO ] After 312ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 05:53:48] [INFO ] After 375ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-08 05:53:48] [INFO ] After 574ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 21 ms.
Support contains 2 out of 318 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 318/318 places, 266/266 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 318 transition count 265
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 318 transition count 264
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 317 transition count 264
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 317 transition count 264
Applied a total of 4 rules in 14 ms. Remains 317 /318 variables (removed 1) and now considering 264/266 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 317/318 places, 264/266 transitions.
Incomplete random walk after 10000 steps, including 535 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 107 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 100 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1264879 steps, run timeout after 3001 ms. (steps per millisecond=421 ) properties seen :{}
Probabilistic random walk after 1264879 steps, saw 175123 distinct states, run finished after 3001 ms. (steps per millisecond=421 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 264 rows 317 cols
[2023-03-08 05:53:51] [INFO ] Computed 59 place invariants in 3 ms
[2023-03-08 05:53:51] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 05:53:51] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 15 ms returned sat
[2023-03-08 05:53:51] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 05:53:51] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 05:53:51] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 38 ms returned sat
[2023-03-08 05:53:52] [INFO ] After 272ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 05:53:52] [INFO ] After 321ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-08 05:53:52] [INFO ] After 490ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 28 ms.
Support contains 2 out of 317 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 317/317 places, 264/264 transitions.
Applied a total of 0 rules in 5 ms. Remains 317 /317 variables (removed 0) and now considering 264/264 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 317/317 places, 264/264 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 317/317 places, 264/264 transitions.
Applied a total of 0 rules in 4 ms. Remains 317 /317 variables (removed 0) and now considering 264/264 (removed 0) transitions.
[2023-03-08 05:53:52] [INFO ] Invariant cache hit.
[2023-03-08 05:53:52] [INFO ] Implicit Places using invariants in 152 ms returned []
[2023-03-08 05:53:52] [INFO ] Invariant cache hit.
[2023-03-08 05:53:52] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 505 ms to find 0 implicit places.
[2023-03-08 05:53:52] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:53:52] [INFO ] Invariant cache hit.
[2023-03-08 05:53:53] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 653 ms. Remains : 317/317 places, 264/264 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 317 transition count 264
Applied a total of 1 rules in 9 ms. Remains 317 /317 variables (removed 0) and now considering 264/264 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 264 rows 317 cols
[2023-03-08 05:53:53] [INFO ] Computed 59 place invariants in 3 ms
[2023-03-08 05:53:53] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 05:53:53] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-08 05:53:53] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 05:53:53] [INFO ] [Nat]Absence check using 35 positive place invariants in 7 ms returned sat
[2023-03-08 05:53:53] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 38 ms returned sat
[2023-03-08 05:53:53] [INFO ] After 269ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 05:53:53] [INFO ] After 315ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-08 05:53:53] [INFO ] After 487ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p1) p2), (X (OR (NOT p1) p2)), (X (NOT (AND p1 (NOT p2)))), (X (X (OR (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 198 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 41 ms :[(AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 35 ms :[(AND p1 (NOT p2))]
Product exploration explored 100000 steps with 5405 reset in 196 ms.
Product exploration explored 100000 steps with 5418 reset in 216 ms.
Support contains 3 out of 318 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 318/318 places, 266/266 transitions.
Applied a total of 0 rules in 5 ms. Remains 318 /318 variables (removed 0) and now considering 266/266 (removed 0) transitions.
// Phase 1: matrix 266 rows 318 cols
[2023-03-08 05:53:54] [INFO ] Computed 58 place invariants in 6 ms
[2023-03-08 05:53:54] [INFO ] Implicit Places using invariants in 150 ms returned []
[2023-03-08 05:53:54] [INFO ] Invariant cache hit.
[2023-03-08 05:53:54] [INFO ] Implicit Places using invariants and state equation in 344 ms returned []
Implicit Place search using SMT with State Equation took 495 ms to find 0 implicit places.
[2023-03-08 05:53:54] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 05:53:54] [INFO ] Invariant cache hit.
[2023-03-08 05:53:54] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 631 ms. Remains : 318/318 places, 266/266 transitions.
Treatment of property DES-PT-50b-LTLFireability-13 finished in 24351 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((G(p0)&&F(p1))))'
Support contains 2 out of 439 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 439/439 places, 382/382 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 436 transition count 379
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 436 transition count 379
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 436 transition count 378
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 435 transition count 377
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 435 transition count 377
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 435 transition count 376
Applied a total of 10 rules in 16 ms. Remains 435 /439 variables (removed 4) and now considering 376/382 (removed 6) transitions.
// Phase 1: matrix 376 rows 435 cols
[2023-03-08 05:53:55] [INFO ] Computed 62 place invariants in 10 ms
[2023-03-08 05:53:55] [INFO ] Implicit Places using invariants in 177 ms returned []
[2023-03-08 05:53:55] [INFO ] Invariant cache hit.
[2023-03-08 05:53:55] [INFO ] Implicit Places using invariants and state equation in 496 ms returned []
Implicit Place search using SMT with State Equation took 674 ms to find 0 implicit places.
[2023-03-08 05:53:55] [INFO ] Invariant cache hit.
[2023-03-08 05:53:55] [INFO ] Dead Transitions using invariants and state equation in 170 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 435/439 places, 376/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 860 ms. Remains : 435/439 places, 376/382 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-50b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s299 0), p1:(EQ s216 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 12 steps with 0 reset in 0 ms.
FORMULA DES-PT-50b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50b-LTLFireability-15 finished in 969 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)))'
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((!p0&&X((F(p1)||G(!p0))))))'
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||X((!p1 U (p2||G(!p1))))))))'
Found a Lengthening insensitive property : DES-PT-50b-LTLFireability-13
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1)]
Support contains 3 out of 439 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 439/439 places, 382/382 transitions.
Graph (complete) has 1018 edges and 439 vertex of which 432 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 431 transition count 363
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 417 transition count 363
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 29 place count 417 transition count 351
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 53 place count 405 transition count 351
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 55 place count 403 transition count 349
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 403 transition count 349
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 59 place count 403 transition count 347
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 61 place count 402 transition count 346
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 62 place count 401 transition count 345
Iterating global reduction 4 with 1 rules applied. Total rules applied 63 place count 401 transition count 345
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 64 place count 401 transition count 344
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 5 with 152 rules applied. Total rules applied 216 place count 325 transition count 268
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 222 place count 322 transition count 276
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 224 place count 320 transition count 274
Applied a total of 224 rules in 47 ms. Remains 320 /439 variables (removed 119) and now considering 274/382 (removed 108) transitions.
// Phase 1: matrix 274 rows 320 cols
[2023-03-08 05:53:56] [INFO ] Computed 59 place invariants in 2 ms
[2023-03-08 05:53:56] [INFO ] Implicit Places using invariants in 162 ms returned []
[2023-03-08 05:53:56] [INFO ] Invariant cache hit.
[2023-03-08 05:53:56] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 05:53:56] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 618 ms to find 0 implicit places.
[2023-03-08 05:53:56] [INFO ] Invariant cache hit.
[2023-03-08 05:53:57] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 320/439 places, 274/382 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 789 ms. Remains : 320/439 places, 274/382 transitions.
Running random walk in product with property : DES-PT-50b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p2), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 0}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1))), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(AND (EQ s31 1) (EQ s233 1) (OR (EQ s25 0) (EQ s233 0))), p2:(AND (NOT (AND (EQ s31 1) (EQ s233 1))) (NOT (AND (EQ s25 1) (EQ s233 1)))), p1:(AND (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 5432 reset in 237 ms.
Product exploration explored 100000 steps with 5436 reset in 264 ms.
Computed a total of 217 stabilizing places and 218 stable transitions
Computed a total of 217 stabilizing places and 218 stable transitions
Detected a total of 217/320 stabilizing places and 218/274 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 p2))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 792 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter sensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 571 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 115 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 101 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 807488 steps, run timeout after 3001 ms. (steps per millisecond=269 ) properties seen :{}
Probabilistic random walk after 807488 steps, saw 113760 distinct states, run finished after 3001 ms. (steps per millisecond=269 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-08 05:54:01] [INFO ] Invariant cache hit.
[2023-03-08 05:54:01] [INFO ] [Real]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-08 05:54:01] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 05:54:01] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:4
[2023-03-08 05:54:01] [INFO ] [Nat]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-08 05:54:02] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 85 ms returned sat
[2023-03-08 05:54:02] [INFO ] After 300ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :4
[2023-03-08 05:54:02] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 05:54:02] [INFO ] After 98ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :2 sat :4
[2023-03-08 05:54:02] [INFO ] After 222ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :4
Attempting to minimize the solution found.
Minimization took 99 ms.
[2023-03-08 05:54:02] [INFO ] After 956ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :4
Fused 6 Parikh solutions to 2 different solutions.
Finished Parikh walk after 1322 steps, including 2 resets, run visited all 2 properties in 10 ms. (steps per millisecond=132 )
Parikh walk visited 4 properties in 22 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 p2))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p0 p1 (NOT p2)))), (G (NOT (AND p0 p2)))]
False Knowledge obtained : [(F (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) (NOT p2))))), (F p0), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))))]
Knowledge based reduction with 16 factoid took 711 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 26 ms :[(AND p1 (NOT p2))]
Support contains 3 out of 320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 320/320 places, 274/274 transitions.
Applied a total of 0 rules in 11 ms. Remains 320 /320 variables (removed 0) and now considering 274/274 (removed 0) transitions.
[2023-03-08 05:54:03] [INFO ] Invariant cache hit.
[2023-03-08 05:54:03] [INFO ] Implicit Places using invariants in 172 ms returned []
[2023-03-08 05:54:03] [INFO ] Invariant cache hit.
[2023-03-08 05:54:03] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 05:54:04] [INFO ] Implicit Places using invariants and state equation in 466 ms returned []
Implicit Place search using SMT with State Equation took 639 ms to find 0 implicit places.
[2023-03-08 05:54:04] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 05:54:04] [INFO ] Invariant cache hit.
[2023-03-08 05:54:04] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 778 ms. Remains : 320/320 places, 274/274 transitions.
Computed a total of 217 stabilizing places and 218 stable transitions
Computed a total of 217 stabilizing places and 218 stable transitions
Detected a total of 217/320 stabilizing places and 218/274 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p2), (X (OR (NOT p1) p2)), (X (NOT (AND p1 (NOT p2)))), (X (X (OR (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 180 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 23 ms :[(AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 549 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 100 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 110 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1248650 steps, run timeout after 3001 ms. (steps per millisecond=416 ) properties seen :{}
Probabilistic random walk after 1248650 steps, saw 173121 distinct states, run finished after 3002 ms. (steps per millisecond=415 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-08 05:54:07] [INFO ] Invariant cache hit.
[2023-03-08 05:54:07] [INFO ] [Real]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-08 05:54:07] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 13 ms returned sat
[2023-03-08 05:54:07] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 05:54:07] [INFO ] [Nat]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-08 05:54:08] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 115 ms returned sat
[2023-03-08 05:54:08] [INFO ] After 282ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 05:54:08] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 05:54:08] [INFO ] After 50ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 05:54:08] [INFO ] After 105ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 49 ms.
[2023-03-08 05:54:08] [INFO ] After 621ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 1367 steps, including 2 resets, run visited all 2 properties in 14 ms. (steps per millisecond=97 )
Parikh walk visited 2 properties in 13 ms.
Knowledge obtained : [(AND (NOT p1) p2), (X (OR (NOT p1) p2)), (X (NOT (AND p1 (NOT p2)))), (X (X (OR (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) p2))), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 7 factoid took 363 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 22 ms :[(AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 26 ms :[(AND p1 (NOT p2))]
Product exploration explored 100000 steps with 5432 reset in 195 ms.
Product exploration explored 100000 steps with 5487 reset in 215 ms.
Support contains 3 out of 320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 320/320 places, 274/274 transitions.
Applied a total of 0 rules in 5 ms. Remains 320 /320 variables (removed 0) and now considering 274/274 (removed 0) transitions.
[2023-03-08 05:54:09] [INFO ] Invariant cache hit.
[2023-03-08 05:54:09] [INFO ] Implicit Places using invariants in 147 ms returned []
[2023-03-08 05:54:09] [INFO ] Invariant cache hit.
[2023-03-08 05:54:09] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 05:54:10] [INFO ] Implicit Places using invariants and state equation in 454 ms returned []
Implicit Place search using SMT with State Equation took 602 ms to find 0 implicit places.
[2023-03-08 05:54:10] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 05:54:10] [INFO ] Invariant cache hit.
[2023-03-08 05:54:10] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 740 ms. Remains : 320/320 places, 274/274 transitions.
Treatment of property DES-PT-50b-LTLFireability-13 finished in 13970 ms.
[2023-03-08 05:54:10] [INFO ] Flatten gal took : 22 ms
[2023-03-08 05:54:10] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-08 05:54:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 439 places, 382 transitions and 1339 arcs took 3 ms.
Total runtime 103973 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DES-PT-50b
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLFireability

FORMULA DES-PT-50b-LTLFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678254941445

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:544
lola: rewrite Frontend/Parser/formula_rewrite.k:352
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 DES-PT-50b-LTLFireability-03
lola: time limit : 900 sec
lola: memory limit: 32 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 14 (type FNDP) for 3 DES-PT-50b-LTLFireability-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 15 (type EQUN) for 3 DES-PT-50b-LTLFireability-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 17 (type SRCH) for 3 DES-PT-50b-LTLFireability-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 17 (type SRCH) for DES-PT-50b-LTLFireability-09
lola: result : unknown
lola: time used : 0.000000
lola: memory pages used : 1
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
sara: try reading problem file /home/mcc/execution/374/LTLFireability-15.sara.
sara: place or transition ordering is non-deterministic

lola: FINISHED task # 15 (type EQUN) for DES-PT-50b-LTLFireability-09
lola: result : true
lola: CANCELED task # 14 (type FNDP) for DES-PT-50b-LTLFireability-09 (obsolete)
lola: FINISHED task # 14 (type FNDP) for DES-PT-50b-LTLFireability-09
lola: result : unknown
lola: fired transitions : 1053967
lola: tried executions : 33919
lola: time used : 1.000000
lola: memory pages used : 0
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-50b-LTLFireability-09: CONJ false state equation

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50b-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
DES-PT-50b-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/1800 14/32 DES-PT-50b-LTLFireability-03 1703054 m, 340610 m/sec, 2230529 t fired, .

Time elapsed: 5 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-50b-LTLFireability-09: CONJ false state equation

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50b-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
DES-PT-50b-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/1800 26/32 DES-PT-50b-LTLFireability-03 3389099 m, 337209 m/sec, 4408052 t fired, .

Time elapsed: 10 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 1 (type EXCL) for DES-PT-50b-LTLFireability-03 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-50b-LTLFireability-09: CONJ false state equation

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50b-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
DES-PT-50b-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 15 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: LAUNCH task # 11 (type EXCL) for 10 DES-PT-50b-LTLFireability-13
lola: time limit : 3585 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-50b-LTLFireability-09: CONJ false state equation

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50b-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
DES-PT-50b-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 5/3585 3/32 DES-PT-50b-LTLFireability-13 396490 m, 79298 m/sec, 2070467 t fired, .

Time elapsed: 20 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-50b-LTLFireability-09: CONJ false state equation

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50b-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
DES-PT-50b-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 10/3585 6/32 DES-PT-50b-LTLFireability-13 766083 m, 73918 m/sec, 4115318 t fired, .

Time elapsed: 25 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-50b-LTLFireability-09: CONJ false state equation

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50b-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
DES-PT-50b-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 15/3585 8/32 DES-PT-50b-LTLFireability-13 1119728 m, 70729 m/sec, 6132631 t fired, .

Time elapsed: 30 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-50b-LTLFireability-09: CONJ false state equation

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50b-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
DES-PT-50b-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 20/3585 10/32 DES-PT-50b-LTLFireability-13 1454829 m, 67020 m/sec, 8167138 t fired, .

Time elapsed: 35 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-50b-LTLFireability-09: CONJ false state equation

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50b-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
DES-PT-50b-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 25/3585 12/32 DES-PT-50b-LTLFireability-13 1768768 m, 62787 m/sec, 10212014 t fired, .

Time elapsed: 40 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-50b-LTLFireability-09: CONJ false state equation

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50b-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
DES-PT-50b-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 30/3585 14/32 DES-PT-50b-LTLFireability-13 2078369 m, 61920 m/sec, 12232719 t fired, .

Time elapsed: 45 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-50b-LTLFireability-09: CONJ false state equation

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50b-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
DES-PT-50b-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 35/3585 16/32 DES-PT-50b-LTLFireability-13 2373085 m, 58943 m/sec, 14235666 t fired, .

Time elapsed: 50 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-50b-LTLFireability-09: CONJ false state equation

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50b-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
DES-PT-50b-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 40/3585 19/32 DES-PT-50b-LTLFireability-13 2699551 m, 65293 m/sec, 16269835 t fired, .

Time elapsed: 55 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-50b-LTLFireability-09: CONJ false state equation

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50b-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
DES-PT-50b-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 45/3585 21/32 DES-PT-50b-LTLFireability-13 3008927 m, 61875 m/sec, 18287416 t fired, .

Time elapsed: 60 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-50b-LTLFireability-09: CONJ false state equation

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50b-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
DES-PT-50b-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 50/3585 23/32 DES-PT-50b-LTLFireability-13 3322325 m, 62679 m/sec, 20307377 t fired, .

Time elapsed: 65 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-50b-LTLFireability-09: CONJ false state equation

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50b-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
DES-PT-50b-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 55/3585 25/32 DES-PT-50b-LTLFireability-13 3626726 m, 60880 m/sec, 22319431 t fired, .

Time elapsed: 70 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-50b-LTLFireability-09: CONJ false state equation

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50b-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
DES-PT-50b-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 60/3585 27/32 DES-PT-50b-LTLFireability-13 3938012 m, 62257 m/sec, 24343845 t fired, .

Time elapsed: 75 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-50b-LTLFireability-09: CONJ false state equation

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50b-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
DES-PT-50b-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 65/3585 29/32 DES-PT-50b-LTLFireability-13 4255019 m, 63401 m/sec, 26353727 t fired, .

Time elapsed: 80 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-50b-LTLFireability-09: CONJ false state equation

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50b-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
DES-PT-50b-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 70/3585 31/32 DES-PT-50b-LTLFireability-13 4586227 m, 66241 m/sec, 28430129 t fired, .

Time elapsed: 85 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 11 (type EXCL) for DES-PT-50b-LTLFireability-13 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-50b-LTLFireability-09: CONJ false state equation

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50b-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
DES-PT-50b-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 90 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: Portfolio finished: no open tasks 3

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-50b-LTLFireability-03: LTL unknown AGGR
DES-PT-50b-LTLFireability-09: CONJ false state equation
DES-PT-50b-LTLFireability-13: LTL unknown AGGR


Time elapsed: 90 secs. Pages in use: 32

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-50b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is DES-PT-50b, 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 r103-tall-167814478400484"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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