Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 8.6K Feb 26 15:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 15:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 15:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 15:43 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.7K Feb 25 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Feb 26 15:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 15:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 26 15:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K 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 139K 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-60b-LTLFireability-00
FORMULA_NAME DES-PT-60b-LTLFireability-01
FORMULA_NAME DES-PT-60b-LTLFireability-02
FORMULA_NAME DES-PT-60b-LTLFireability-03
FORMULA_NAME DES-PT-60b-LTLFireability-04
FORMULA_NAME DES-PT-60b-LTLFireability-05
FORMULA_NAME DES-PT-60b-LTLFireability-06
FORMULA_NAME DES-PT-60b-LTLFireability-07
FORMULA_NAME DES-PT-60b-LTLFireability-08
FORMULA_NAME DES-PT-60b-LTLFireability-09
FORMULA_NAME DES-PT-60b-LTLFireability-10
FORMULA_NAME DES-PT-60b-LTLFireability-11
FORMULA_NAME DES-PT-60b-LTLFireability-12
FORMULA_NAME DES-PT-60b-LTLFireability-13
FORMULA_NAME DES-PT-60b-LTLFireability-14
FORMULA_NAME DES-PT-60b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678315059024

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-60b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-08 22:37:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 22:37:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 22:37:40] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2023-03-08 22:37:40] [INFO ] Transformed 519 places.
[2023-03-08 22:37:40] [INFO ] Transformed 470 transitions.
[2023-03-08 22:37:40] [INFO ] Found NUPN structural information;
[2023-03-08 22:37:40] [INFO ] Parsed PT model containing 519 places and 470 transitions and 1623 arcs in 147 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 1 formulas.
FORMULA DES-PT-60b-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 519 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 519/519 places, 470/470 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 516 transition count 470
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 27 place count 492 transition count 446
Iterating global reduction 1 with 24 rules applied. Total rules applied 51 place count 492 transition count 446
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 66 place count 477 transition count 431
Iterating global reduction 1 with 15 rules applied. Total rules applied 81 place count 477 transition count 431
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 92 place count 477 transition count 420
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 93 place count 476 transition count 419
Iterating global reduction 2 with 1 rules applied. Total rules applied 94 place count 476 transition count 419
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 95 place count 476 transition count 418
Applied a total of 95 rules in 138 ms. Remains 476 /519 variables (removed 43) and now considering 418/470 (removed 52) transitions.
// Phase 1: matrix 418 rows 476 cols
[2023-03-08 22:37:41] [INFO ] Computed 62 place invariants in 46 ms
[2023-03-08 22:37:41] [INFO ] Implicit Places using invariants in 444 ms returned []
[2023-03-08 22:37:41] [INFO ] Invariant cache hit.
[2023-03-08 22:37:42] [INFO ] Implicit Places using invariants and state equation in 561 ms returned []
Implicit Place search using SMT with State Equation took 1035 ms to find 0 implicit places.
[2023-03-08 22:37:42] [INFO ] Invariant cache hit.
[2023-03-08 22:37:42] [INFO ] Dead Transitions using invariants and state equation in 234 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 476/519 places, 418/470 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1410 ms. Remains : 476/519 places, 418/470 transitions.
Support contains 43 out of 476 places after structural reductions.
[2023-03-08 22:37:42] [INFO ] Flatten gal took : 71 ms
[2023-03-08 22:37:42] [INFO ] Flatten gal took : 31 ms
[2023-03-08 22:37:42] [INFO ] Input system was already deterministic with 418 transitions.
Incomplete random walk after 10000 steps, including 90 resets, run finished after 566 ms. (steps per millisecond=17 ) properties (out of 30) seen :17
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2023-03-08 22:37:44] [INFO ] Invariant cache hit.
[2023-03-08 22:37:44] [INFO ] [Real]Absence check using 33 positive place invariants in 9 ms returned sat
[2023-03-08 22:37:44] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 43 ms returned sat
[2023-03-08 22:37:44] [INFO ] After 378ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-08 22:37:44] [INFO ] [Nat]Absence check using 33 positive place invariants in 8 ms returned sat
[2023-03-08 22:37:44] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 46 ms returned sat
[2023-03-08 22:37:45] [INFO ] After 835ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-08 22:37:45] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 5 ms to minimize.
[2023-03-08 22:37:46] [INFO ] Deduced a trap composed of 33 places in 130 ms of which 1 ms to minimize.
[2023-03-08 22:37:46] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2023-03-08 22:37:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 403 ms
[2023-03-08 22:37:46] [INFO ] Deduced a trap composed of 16 places in 130 ms of which 1 ms to minimize.
[2023-03-08 22:37:46] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 1 ms to minimize.
[2023-03-08 22:37:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 342 ms
[2023-03-08 22:37:46] [INFO ] Deduced a trap composed of 18 places in 107 ms of which 0 ms to minimize.
[2023-03-08 22:37:47] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 0 ms to minimize.
[2023-03-08 22:37:47] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2023-03-08 22:37:47] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 0 ms to minimize.
[2023-03-08 22:37:47] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 0 ms to minimize.
[2023-03-08 22:37:47] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 566 ms
[2023-03-08 22:37:47] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 0 ms to minimize.
[2023-03-08 22:37:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 151 ms
[2023-03-08 22:37:48] [INFO ] After 3226ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 635 ms.
[2023-03-08 22:37:48] [INFO ] After 4241ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Fused 12 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 2056 ms.
Support contains 18 out of 476 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 418/418 transitions.
Graph (complete) has 1134 edges and 476 vertex of which 470 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 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 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 470 transition count 401
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 28 place count 458 transition count 400
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 29 place count 457 transition count 400
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 29 place count 457 transition count 389
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 51 place count 446 transition count 389
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 53 place count 444 transition count 387
Iterating global reduction 3 with 2 rules applied. Total rules applied 55 place count 444 transition count 387
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 56 place count 444 transition count 386
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 56 place count 444 transition count 385
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 58 place count 443 transition count 385
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 59 place count 442 transition count 384
Iterating global reduction 4 with 1 rules applied. Total rules applied 60 place count 442 transition count 384
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 61 place count 442 transition count 383
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 1 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 5 with 146 rules applied. Total rules applied 207 place count 369 transition count 310
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 211 place count 367 transition count 312
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 212 place count 367 transition count 311
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 213 place count 366 transition count 311
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 214 place count 365 transition count 310
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 215 place count 364 transition count 310
Applied a total of 215 rules in 189 ms. Remains 364 /476 variables (removed 112) and now considering 310/418 (removed 108) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 190 ms. Remains : 364/476 places, 310/418 transitions.
Incomplete random walk after 10000 steps, including 369 resets, run finished after 346 ms. (steps per millisecond=28 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 68 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 81 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 77 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 79 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 79 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 75 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 459727 steps, run timeout after 3001 ms. (steps per millisecond=153 ) properties seen :{}
Probabilistic random walk after 459727 steps, saw 74122 distinct states, run finished after 3003 ms. (steps per millisecond=153 ) properties seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 310 rows 364 cols
[2023-03-08 22:37:55] [INFO ] Computed 60 place invariants in 19 ms
[2023-03-08 22:37:55] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 22:37:55] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 15 ms returned sat
[2023-03-08 22:37:55] [INFO ] After 194ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-08 22:37:55] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 22:37:55] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 111 ms returned sat
[2023-03-08 22:37:56] [INFO ] After 1147ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-08 22:37:56] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-08 22:37:57] [INFO ] After 607ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2023-03-08 22:37:57] [INFO ] Deduced a trap composed of 18 places in 118 ms of which 1 ms to minimize.
[2023-03-08 22:37:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2023-03-08 22:37:57] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 1 ms to minimize.
[2023-03-08 22:37:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 144 ms
[2023-03-08 22:37:58] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 1 ms to minimize.
[2023-03-08 22:37:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2023-03-08 22:37:58] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 1 ms to minimize.
[2023-03-08 22:37:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2023-03-08 22:37:58] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2023-03-08 22:37:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2023-03-08 22:37:59] [INFO ] After 2194ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 723 ms.
[2023-03-08 22:37:59] [INFO ] After 4448ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Fused 12 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 832 ms.
Support contains 18 out of 364 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 364/364 places, 310/310 transitions.
Applied a total of 0 rules in 23 ms. Remains 364 /364 variables (removed 0) and now considering 310/310 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 364/364 places, 310/310 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 364/364 places, 310/310 transitions.
Applied a total of 0 rules in 19 ms. Remains 364 /364 variables (removed 0) and now considering 310/310 (removed 0) transitions.
[2023-03-08 22:38:00] [INFO ] Invariant cache hit.
[2023-03-08 22:38:00] [INFO ] Implicit Places using invariants in 181 ms returned []
[2023-03-08 22:38:00] [INFO ] Invariant cache hit.
[2023-03-08 22:38:01] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-08 22:38:01] [INFO ] Implicit Places using invariants and state equation in 425 ms returned []
Implicit Place search using SMT with State Equation took 615 ms to find 0 implicit places.
[2023-03-08 22:38:01] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-08 22:38:01] [INFO ] Invariant cache hit.
[2023-03-08 22:38:01] [INFO ] Dead Transitions using invariants and state equation in 171 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 826 ms. Remains : 364/364 places, 310/310 transitions.
Applied a total of 0 rules in 12 ms. Remains 364 /364 variables (removed 0) and now considering 310/310 (removed 0) transitions.
Running SMT prover for 12 properties.
[2023-03-08 22:38:01] [INFO ] Invariant cache hit.
[2023-03-08 22:38:01] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 22:38:01] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-08 22:38:01] [INFO ] After 238ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-08 22:38:01] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2023-03-08 22:38:02] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 149 ms returned sat
[2023-03-08 22:38:02] [INFO ] After 542ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-08 22:38:02] [INFO ] Deduced a trap composed of 17 places in 146 ms of which 0 ms to minimize.
[2023-03-08 22:38:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2023-03-08 22:38:03] [INFO ] After 1189ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 364 ms.
[2023-03-08 22:38:03] [INFO ] After 2086ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
FORMULA DES-PT-60b-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA DES-PT-60b-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 296 stabilizing places and 288 stable transitions
Graph (complete) has 1134 edges and 476 vertex of which 470 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.26 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)&&G(p1))))'
Support contains 4 out of 476 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 476/476 places, 418/418 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 474 transition count 416
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 474 transition count 416
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 474 transition count 415
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 473 transition count 414
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 473 transition count 414
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 473 transition count 413
Applied a total of 8 rules in 24 ms. Remains 473 /476 variables (removed 3) and now considering 413/418 (removed 5) transitions.
// Phase 1: matrix 413 rows 473 cols
[2023-03-08 22:38:04] [INFO ] Computed 62 place invariants in 14 ms
[2023-03-08 22:38:04] [INFO ] Implicit Places using invariants in 245 ms returned []
[2023-03-08 22:38:04] [INFO ] Invariant cache hit.
[2023-03-08 22:38:05] [INFO ] Implicit Places using invariants and state equation in 678 ms returned []
Implicit Place search using SMT with State Equation took 928 ms to find 0 implicit places.
[2023-03-08 22:38:05] [INFO ] Invariant cache hit.
[2023-03-08 22:38:05] [INFO ] Dead Transitions using invariants and state equation in 229 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 473/476 places, 413/418 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1183 ms. Remains : 473/476 places, 413/418 transitions.
Stuttering acceptance computed with spot in 279 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-60b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), 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 p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(AND (EQ s53 1) (EQ s329 1)), p0:(AND (EQ s339 1) (EQ s441 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DES-PT-60b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60b-LTLFireability-00 finished in 1520 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 476 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 476/476 places, 418/418 transitions.
Graph (complete) has 1134 edges and 476 vertex of which 470 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 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 469 transition count 399
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 454 transition count 399
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 454 transition count 388
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 53 place count 443 transition count 388
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 55 place count 441 transition count 386
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 441 transition count 386
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 58 place count 441 transition count 385
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 58 place count 441 transition count 384
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 60 place count 440 transition count 384
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 61 place count 439 transition count 383
Iterating global reduction 3 with 1 rules applied. Total rules applied 62 place count 439 transition count 383
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 63 place count 439 transition count 382
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 4 with 148 rules applied. Total rules applied 211 place count 365 transition count 308
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 4 with 4 rules applied. Total rules applied 215 place count 363 transition count 310
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 217 place count 361 transition count 308
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 218 place count 360 transition count 308
Applied a total of 218 rules in 122 ms. Remains 360 /476 variables (removed 116) and now considering 308/418 (removed 110) transitions.
// Phase 1: matrix 308 rows 360 cols
[2023-03-08 22:38:05] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-08 22:38:05] [INFO ] Implicit Places using invariants in 229 ms returned []
[2023-03-08 22:38:05] [INFO ] Invariant cache hit.
[2023-03-08 22:38:06] [INFO ] Implicit Places using invariants and state equation in 468 ms returned []
Implicit Place search using SMT with State Equation took 699 ms to find 0 implicit places.
[2023-03-08 22:38:06] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-08 22:38:06] [INFO ] Invariant cache hit.
[2023-03-08 22:38:06] [INFO ] Dead Transitions using invariants and state equation in 288 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 360/476 places, 308/418 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1142 ms. Remains : 360/476 places, 308/418 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-60b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s308 1) (EQ s326 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 15 steps with 0 reset in 1 ms.
FORMULA DES-PT-60b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60b-LTLFireability-01 finished in 1191 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(!p0) U (p1 U p2)))))'
Support contains 5 out of 476 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 476/476 places, 418/418 transitions.
Graph (complete) has 1134 edges and 476 vertex of which 470 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 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 469 transition count 399
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 454 transition count 399
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 31 place count 454 transition count 390
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 49 place count 445 transition count 390
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 444 transition count 389
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 444 transition count 389
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 52 place count 444 transition count 388
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 52 place count 444 transition count 387
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 54 place count 443 transition count 387
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 1 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 3 with 152 rules applied. Total rules applied 206 place count 367 transition count 311
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 210 place count 365 transition count 316
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 212 place count 363 transition count 314
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 213 place count 362 transition count 314
Applied a total of 213 rules in 70 ms. Remains 362 /476 variables (removed 114) and now considering 314/418 (removed 104) transitions.
// Phase 1: matrix 314 rows 362 cols
[2023-03-08 22:38:06] [INFO ] Computed 58 place invariants in 4 ms
[2023-03-08 22:38:07] [INFO ] Implicit Places using invariants in 201 ms returned []
[2023-03-08 22:38:07] [INFO ] Invariant cache hit.
[2023-03-08 22:38:07] [INFO ] Implicit Places using invariants and state equation in 465 ms returned []
Implicit Place search using SMT with State Equation took 668 ms to find 0 implicit places.
[2023-03-08 22:38:07] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 22:38:07] [INFO ] Invariant cache hit.
[2023-03-08 22:38:07] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 362/476 places, 314/418 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 911 ms. Remains : 362/476 places, 314/418 transitions.
Stuttering acceptance computed with spot in 165 ms :[(NOT p2), (NOT p2), (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Running random walk in product with property : DES-PT-60b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND p2 p0) (AND p1 p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s279 1) (EQ s283 1)), p1:(EQ s243 1), p0:(AND (EQ s4 1) (EQ s273 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 1 ms.
FORMULA DES-PT-60b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60b-LTLFireability-03 finished in 1099 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((F(p0) U p1)||X(X((F(G(p0))&&p2))))))'
Support contains 6 out of 476 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 476/476 places, 418/418 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 474 transition count 416
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 474 transition count 416
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 474 transition count 415
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 473 transition count 414
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 473 transition count 414
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 473 transition count 413
Applied a total of 8 rules in 27 ms. Remains 473 /476 variables (removed 3) and now considering 413/418 (removed 5) transitions.
// Phase 1: matrix 413 rows 473 cols
[2023-03-08 22:38:07] [INFO ] Computed 62 place invariants in 13 ms
[2023-03-08 22:38:08] [INFO ] Implicit Places using invariants in 240 ms returned []
[2023-03-08 22:38:08] [INFO ] Invariant cache hit.
[2023-03-08 22:38:08] [INFO ] Implicit Places using invariants and state equation in 636 ms returned []
Implicit Place search using SMT with State Equation took 879 ms to find 0 implicit places.
[2023-03-08 22:38:08] [INFO ] Invariant cache hit.
[2023-03-08 22:38:09] [INFO ] Dead Transitions using invariants and state equation in 244 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 473/476 places, 413/418 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1153 ms. Remains : 473/476 places, 413/418 transitions.
Stuttering acceptance computed with spot in 195 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-60b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s37 1) (EQ s329 1)), p2:(AND (EQ s178 1) (EQ s322 1)), p0:(AND (EQ s113 1) (EQ s465 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 115 steps with 0 reset in 3 ms.
FORMULA DES-PT-60b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60b-LTLFireability-05 finished in 1385 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 3 out of 476 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 476/476 places, 418/418 transitions.
Graph (complete) has 1134 edges and 476 vertex of which 470 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 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 469 transition count 399
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 454 transition count 399
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 454 transition count 388
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 443 transition count 388
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 55 place count 441 transition count 386
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 441 transition count 386
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 58 place count 441 transition count 385
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 58 place count 441 transition count 384
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 60 place count 440 transition count 384
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 61 place count 439 transition count 383
Iterating global reduction 3 with 1 rules applied. Total rules applied 62 place count 439 transition count 383
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 63 place count 439 transition count 382
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 213 place count 364 transition count 307
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 4 with 4 rules applied. Total rules applied 217 place count 362 transition count 309
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 219 place count 360 transition count 307
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 220 place count 359 transition count 307
Applied a total of 220 rules in 78 ms. Remains 359 /476 variables (removed 117) and now considering 307/418 (removed 111) transitions.
// Phase 1: matrix 307 rows 359 cols
[2023-03-08 22:38:09] [INFO ] Computed 58 place invariants in 4 ms
[2023-03-08 22:38:09] [INFO ] Implicit Places using invariants in 210 ms returned []
[2023-03-08 22:38:09] [INFO ] Invariant cache hit.
[2023-03-08 22:38:10] [INFO ] Implicit Places using invariants and state equation in 532 ms returned []
Implicit Place search using SMT with State Equation took 745 ms to find 0 implicit places.
[2023-03-08 22:38:10] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 22:38:10] [INFO ] Invariant cache hit.
[2023-03-08 22:38:10] [INFO ] Dead Transitions using invariants and state equation in 172 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 359/476 places, 307/418 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1002 ms. Remains : 359/476 places, 307/418 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-60b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s167 1) (EQ s270 1) (OR (EQ s125 0) (EQ s270 0)))], 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 26 steps with 0 reset in 1 ms.
FORMULA DES-PT-60b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60b-LTLFireability-06 finished in 1075 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((F(p1)&&p0))))'
Support contains 4 out of 476 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 476/476 places, 418/418 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 474 transition count 416
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 474 transition count 416
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 474 transition count 415
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 473 transition count 414
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 473 transition count 414
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 473 transition count 413
Applied a total of 8 rules in 25 ms. Remains 473 /476 variables (removed 3) and now considering 413/418 (removed 5) transitions.
// Phase 1: matrix 413 rows 473 cols
[2023-03-08 22:38:10] [INFO ] Computed 62 place invariants in 11 ms
[2023-03-08 22:38:10] [INFO ] Implicit Places using invariants in 241 ms returned []
[2023-03-08 22:38:10] [INFO ] Invariant cache hit.
[2023-03-08 22:38:11] [INFO ] Implicit Places using invariants and state equation in 683 ms returned []
Implicit Place search using SMT with State Equation took 926 ms to find 0 implicit places.
[2023-03-08 22:38:11] [INFO ] Invariant cache hit.
[2023-03-08 22:38:11] [INFO ] Dead Transitions using invariants and state equation in 218 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 473/476 places, 413/418 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1170 ms. Remains : 473/476 places, 413/418 transitions.
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : DES-PT-60b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s305 1) (EQ s307 1) (EQ s312 0)), p1:(EQ s462 0)], nbAcceptance=1, 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-60b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60b-LTLFireability-07 finished in 1345 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 476 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 476/476 places, 418/418 transitions.
Graph (complete) has 1134 edges and 476 vertex of which 470 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 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 469 transition count 403
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 458 transition count 402
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 457 transition count 402
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 25 place count 457 transition count 391
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 47 place count 446 transition count 391
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 49 place count 444 transition count 389
Iterating global reduction 3 with 2 rules applied. Total rules applied 51 place count 444 transition count 389
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 52 place count 444 transition count 388
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 52 place count 444 transition count 387
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 54 place count 443 transition count 387
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 55 place count 442 transition count 386
Iterating global reduction 4 with 1 rules applied. Total rules applied 56 place count 442 transition count 386
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 57 place count 442 transition count 385
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 209 place count 366 transition count 309
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 213 place count 364 transition count 311
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 215 place count 362 transition count 309
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 216 place count 361 transition count 309
Applied a total of 216 rules in 98 ms. Remains 361 /476 variables (removed 115) and now considering 309/418 (removed 109) transitions.
// Phase 1: matrix 309 rows 361 cols
[2023-03-08 22:38:11] [INFO ] Computed 58 place invariants in 4 ms
[2023-03-08 22:38:11] [INFO ] Implicit Places using invariants in 176 ms returned []
[2023-03-08 22:38:11] [INFO ] Invariant cache hit.
[2023-03-08 22:38:12] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-08 22:38:12] [INFO ] Implicit Places using invariants and state equation in 526 ms returned []
Implicit Place search using SMT with State Equation took 704 ms to find 0 implicit places.
[2023-03-08 22:38:12] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 22:38:12] [INFO ] Invariant cache hit.
[2023-03-08 22:38:12] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 361/476 places, 309/418 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 978 ms. Remains : 361/476 places, 309/418 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-60b-LTLFireability-09 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:(OR (EQ s223 0) (EQ s244 0) (EQ s268 0))], 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 4819 reset in 322 ms.
Product exploration explored 100000 steps with 4745 reset in 345 ms.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 187 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 93 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 475 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 107 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1285551 steps, run timeout after 3001 ms. (steps per millisecond=428 ) properties seen :{}
Probabilistic random walk after 1285551 steps, saw 176754 distinct states, run finished after 3001 ms. (steps per millisecond=428 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 22:38:16] [INFO ] Invariant cache hit.
[2023-03-08 22:38:16] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 22:38:16] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 22:38:16] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 115 ms returned sat
[2023-03-08 22:38:17] [INFO ] After 450ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 22:38:17] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-08 22:38:17] [INFO ] After 31ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 22:38:17] [INFO ] After 59ms 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 22:38:17] [INFO ] After 730ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 3 out of 361 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 361/361 places, 309/309 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 361 transition count 308
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 361 transition count 307
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 360 transition count 307
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 360 transition count 307
Applied a total of 4 rules in 21 ms. Remains 360 /361 variables (removed 1) and now considering 307/309 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 360/361 places, 307/309 transitions.
Incomplete random walk after 10000 steps, including 474 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1243371 steps, run timeout after 3001 ms. (steps per millisecond=414 ) properties seen :{}
Probabilistic random walk after 1243371 steps, saw 170049 distinct states, run finished after 3001 ms. (steps per millisecond=414 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 307 rows 360 cols
[2023-03-08 22:38:20] [INFO ] Computed 59 place invariants in 11 ms
[2023-03-08 22:38:20] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 22:38:20] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 22:38:20] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 142 ms returned sat
[2023-03-08 22:38:21] [INFO ] After 537ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 22:38:21] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-08 22:38:21] [INFO ] After 32ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 22:38:21] [INFO ] After 68ms 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 22:38:21] [INFO ] After 886ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 3 out of 360 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 307/307 transitions.
Applied a total of 0 rules in 13 ms. Remains 360 /360 variables (removed 0) and now considering 307/307 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 360/360 places, 307/307 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 307/307 transitions.
Applied a total of 0 rules in 7 ms. Remains 360 /360 variables (removed 0) and now considering 307/307 (removed 0) transitions.
[2023-03-08 22:38:21] [INFO ] Invariant cache hit.
[2023-03-08 22:38:21] [INFO ] Implicit Places using invariants in 194 ms returned []
[2023-03-08 22:38:21] [INFO ] Invariant cache hit.
[2023-03-08 22:38:21] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-08 22:38:22] [INFO ] Implicit Places using invariants and state equation in 494 ms returned []
Implicit Place search using SMT with State Equation took 689 ms to find 0 implicit places.
[2023-03-08 22:38:22] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 22:38:22] [INFO ] Invariant cache hit.
[2023-03-08 22:38:22] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 879 ms. Remains : 360/360 places, 307/307 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 360 transition count 307
Applied a total of 1 rules in 15 ms. Remains 360 /360 variables (removed 0) and now considering 307/307 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 307 rows 360 cols
[2023-03-08 22:38:22] [INFO ] Computed 59 place invariants in 5 ms
[2023-03-08 22:38:22] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 22:38:22] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 22:38:22] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 141 ms returned sat
[2023-03-08 22:38:23] [INFO ] After 432ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 22:38:23] [INFO ] After 488ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-08 22:38:23] [INFO ] After 755ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 119 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 126 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 361/361 places, 309/309 transitions.
Applied a total of 0 rules in 11 ms. Remains 361 /361 variables (removed 0) and now considering 309/309 (removed 0) transitions.
// Phase 1: matrix 309 rows 361 cols
[2023-03-08 22:38:23] [INFO ] Computed 58 place invariants in 7 ms
[2023-03-08 22:38:23] [INFO ] Implicit Places using invariants in 194 ms returned []
[2023-03-08 22:38:23] [INFO ] Invariant cache hit.
[2023-03-08 22:38:24] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-08 22:38:24] [INFO ] Implicit Places using invariants and state equation in 496 ms returned []
Implicit Place search using SMT with State Equation took 692 ms to find 0 implicit places.
[2023-03-08 22:38:24] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 22:38:24] [INFO ] Invariant cache hit.
[2023-03-08 22:38:24] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 871 ms. Remains : 361/361 places, 309/309 transitions.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 112 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 65 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 470 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 107 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1316028 steps, run timeout after 3001 ms. (steps per millisecond=438 ) properties seen :{}
Probabilistic random walk after 1316028 steps, saw 181253 distinct states, run finished after 3001 ms. (steps per millisecond=438 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 22:38:27] [INFO ] Invariant cache hit.
[2023-03-08 22:38:27] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 22:38:27] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 22:38:27] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 120 ms returned sat
[2023-03-08 22:38:28] [INFO ] After 451ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 22:38:28] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-08 22:38:28] [INFO ] After 28ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 22:38:28] [INFO ] After 69ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-03-08 22:38:28] [INFO ] After 752ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 3 out of 361 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 361/361 places, 309/309 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 361 transition count 308
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 361 transition count 307
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 360 transition count 307
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 360 transition count 307
Applied a total of 4 rules in 22 ms. Remains 360 /361 variables (removed 1) and now considering 307/309 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 360/361 places, 307/309 transitions.
Incomplete random walk after 10000 steps, including 449 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1318240 steps, run timeout after 3001 ms. (steps per millisecond=439 ) properties seen :{}
Probabilistic random walk after 1318240 steps, saw 181483 distinct states, run finished after 3001 ms. (steps per millisecond=439 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 307 rows 360 cols
[2023-03-08 22:38:31] [INFO ] Computed 59 place invariants in 11 ms
[2023-03-08 22:38:31] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 22:38:31] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 22:38:31] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 141 ms returned sat
[2023-03-08 22:38:32] [INFO ] After 526ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 22:38:32] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-08 22:38:32] [INFO ] After 33ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 22:38:32] [INFO ] After 61ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-08 22:38:32] [INFO ] After 864ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 3 out of 360 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 307/307 transitions.
Applied a total of 0 rules in 7 ms. Remains 360 /360 variables (removed 0) and now considering 307/307 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 360/360 places, 307/307 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 307/307 transitions.
Applied a total of 0 rules in 5 ms. Remains 360 /360 variables (removed 0) and now considering 307/307 (removed 0) transitions.
[2023-03-08 22:38:32] [INFO ] Invariant cache hit.
[2023-03-08 22:38:32] [INFO ] Implicit Places using invariants in 194 ms returned []
[2023-03-08 22:38:32] [INFO ] Invariant cache hit.
[2023-03-08 22:38:33] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-08 22:38:33] [INFO ] Implicit Places using invariants and state equation in 496 ms returned []
Implicit Place search using SMT with State Equation took 695 ms to find 0 implicit places.
[2023-03-08 22:38:33] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 22:38:33] [INFO ] Invariant cache hit.
[2023-03-08 22:38:33] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 866 ms. Remains : 360/360 places, 307/307 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 360 transition count 307
Applied a total of 1 rules in 13 ms. Remains 360 /360 variables (removed 0) and now considering 307/307 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 307 rows 360 cols
[2023-03-08 22:38:33] [INFO ] Computed 59 place invariants in 6 ms
[2023-03-08 22:38:33] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 22:38:33] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 22:38:33] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 149 ms returned sat
[2023-03-08 22:38:34] [INFO ] After 450ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 22:38:34] [INFO ] After 510ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-08 22:38:34] [INFO ] After 785ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 109 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 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4768 reset in 228 ms.
Product exploration explored 100000 steps with 4738 reset in 256 ms.
Support contains 3 out of 361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 361/361 places, 309/309 transitions.
Applied a total of 0 rules in 7 ms. Remains 361 /361 variables (removed 0) and now considering 309/309 (removed 0) transitions.
// Phase 1: matrix 309 rows 361 cols
[2023-03-08 22:38:35] [INFO ] Computed 58 place invariants in 5 ms
[2023-03-08 22:38:35] [INFO ] Implicit Places using invariants in 188 ms returned []
[2023-03-08 22:38:35] [INFO ] Invariant cache hit.
[2023-03-08 22:38:35] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-08 22:38:35] [INFO ] Implicit Places using invariants and state equation in 487 ms returned []
Implicit Place search using SMT with State Equation took 677 ms to find 0 implicit places.
[2023-03-08 22:38:35] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 22:38:35] [INFO ] Invariant cache hit.
[2023-03-08 22:38:36] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 847 ms. Remains : 361/361 places, 309/309 transitions.
Treatment of property DES-PT-60b-LTLFireability-09 finished in 24404 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)))'
Support contains 2 out of 476 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 476/476 places, 418/418 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 474 transition count 416
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 474 transition count 416
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 474 transition count 415
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 473 transition count 414
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 473 transition count 414
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 473 transition count 413
Applied a total of 8 rules in 17 ms. Remains 473 /476 variables (removed 3) and now considering 413/418 (removed 5) transitions.
// Phase 1: matrix 413 rows 473 cols
[2023-03-08 22:38:36] [INFO ] Computed 62 place invariants in 6 ms
[2023-03-08 22:38:36] [INFO ] Implicit Places using invariants in 208 ms returned []
[2023-03-08 22:38:36] [INFO ] Invariant cache hit.
[2023-03-08 22:38:36] [INFO ] Implicit Places using invariants and state equation in 615 ms returned []
Implicit Place search using SMT with State Equation took 824 ms to find 0 implicit places.
[2023-03-08 22:38:36] [INFO ] Invariant cache hit.
[2023-03-08 22:38:37] [INFO ] Dead Transitions using invariants and state equation in 219 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 473/476 places, 413/418 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1061 ms. Remains : 473/476 places, 413/418 transitions.
Stuttering acceptance computed with spot in 417 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-60b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s356 1) (EQ s381 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-60b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60b-LTLFireability-10 finished in 1491 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 476 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 476/476 places, 418/418 transitions.
Graph (complete) has 1134 edges and 476 vertex of which 470 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 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 469 transition count 399
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 454 transition count 399
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 454 transition count 388
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 53 place count 443 transition count 388
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 55 place count 441 transition count 386
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 441 transition count 386
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 58 place count 441 transition count 385
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 58 place count 441 transition count 384
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 60 place count 440 transition count 384
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 61 place count 439 transition count 383
Iterating global reduction 3 with 1 rules applied. Total rules applied 62 place count 439 transition count 383
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 63 place count 439 transition count 382
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 1 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 4 with 150 rules applied. Total rules applied 213 place count 364 transition count 307
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 4 with 4 rules applied. Total rules applied 217 place count 362 transition count 309
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 219 place count 360 transition count 307
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 220 place count 359 transition count 307
Applied a total of 220 rules in 57 ms. Remains 359 /476 variables (removed 117) and now considering 307/418 (removed 111) transitions.
// Phase 1: matrix 307 rows 359 cols
[2023-03-08 22:38:37] [INFO ] Computed 58 place invariants in 9 ms
[2023-03-08 22:38:37] [INFO ] Implicit Places using invariants in 183 ms returned []
[2023-03-08 22:38:37] [INFO ] Invariant cache hit.
[2023-03-08 22:38:38] [INFO ] Implicit Places using invariants and state equation in 537 ms returned []
Implicit Place search using SMT with State Equation took 722 ms to find 0 implicit places.
[2023-03-08 22:38:38] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 22:38:38] [INFO ] Invariant cache hit.
[2023-03-08 22:38:38] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 359/476 places, 307/418 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 944 ms. Remains : 359/476 places, 307/418 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-60b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s159 1) (EQ s270 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 12 steps with 0 reset in 1 ms.
FORMULA DES-PT-60b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60b-LTLFireability-11 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' '!(F(G((F(!p0) U p1))))'
Support contains 4 out of 476 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 476/476 places, 418/418 transitions.
Graph (complete) has 1134 edges and 476 vertex of which 470 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 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 469 transition count 400
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 455 transition count 400
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 29 place count 455 transition count 390
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 49 place count 445 transition count 390
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 51 place count 443 transition count 388
Iterating global reduction 2 with 2 rules applied. Total rules applied 53 place count 443 transition count 388
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 54 place count 443 transition count 387
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 54 place count 443 transition count 386
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 56 place count 442 transition count 386
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 57 place count 441 transition count 385
Iterating global reduction 3 with 1 rules applied. Total rules applied 58 place count 441 transition count 385
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 59 place count 441 transition count 384
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 4 with 152 rules applied. Total rules applied 211 place count 365 transition count 308
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 4 with 4 rules applied. Total rules applied 215 place count 363 transition count 310
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 217 place count 361 transition count 308
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 218 place count 360 transition count 308
Applied a total of 218 rules in 58 ms. Remains 360 /476 variables (removed 116) and now considering 308/418 (removed 110) transitions.
// Phase 1: matrix 308 rows 360 cols
[2023-03-08 22:38:38] [INFO ] Computed 58 place invariants in 10 ms
[2023-03-08 22:38:38] [INFO ] Implicit Places using invariants in 194 ms returned []
[2023-03-08 22:38:38] [INFO ] Invariant cache hit.
[2023-03-08 22:38:39] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-08 22:38:39] [INFO ] Implicit Places using invariants and state equation in 528 ms returned []
Implicit Place search using SMT with State Equation took 724 ms to find 0 implicit places.
[2023-03-08 22:38:39] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 22:38:39] [INFO ] Invariant cache hit.
[2023-03-08 22:38:39] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 360/476 places, 308/418 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 949 ms. Remains : 360/476 places, 308/418 transitions.
Stuttering acceptance computed with spot in 1201 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p0)]
Running random walk in product with property : DES-PT-60b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s200 1) (EQ s244 1)), p0:(AND (EQ s279 1) (EQ s281 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 1 ms.
FORMULA DES-PT-60b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60b-LTLFireability-12 finished in 2171 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)||G(p2))))'
Support contains 3 out of 476 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 476/476 places, 418/418 transitions.
Graph (complete) has 1134 edges and 476 vertex of which 470 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 469 transition count 399
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 454 transition count 399
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 454 transition count 388
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 443 transition count 388
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 55 place count 441 transition count 386
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 441 transition count 386
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 58 place count 441 transition count 385
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 58 place count 441 transition count 384
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 60 place count 440 transition count 384
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 61 place count 439 transition count 383
Iterating global reduction 3 with 1 rules applied. Total rules applied 62 place count 439 transition count 383
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 63 place count 439 transition count 382
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 4 with 148 rules applied. Total rules applied 211 place count 365 transition count 308
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 4 with 4 rules applied. Total rules applied 215 place count 363 transition count 310
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 217 place count 361 transition count 308
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 218 place count 360 transition count 308
Applied a total of 218 rules in 44 ms. Remains 360 /476 variables (removed 116) and now considering 308/418 (removed 110) transitions.
// Phase 1: matrix 308 rows 360 cols
[2023-03-08 22:38:40] [INFO ] Computed 58 place invariants in 8 ms
[2023-03-08 22:38:40] [INFO ] Implicit Places using invariants in 209 ms returned []
[2023-03-08 22:38:40] [INFO ] Invariant cache hit.
[2023-03-08 22:38:41] [INFO ] Implicit Places using invariants and state equation in 482 ms returned []
Implicit Place search using SMT with State Equation took 692 ms to find 0 implicit places.
[2023-03-08 22:38:41] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 22:38:41] [INFO ] Invariant cache hit.
[2023-03-08 22:38:41] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 360/476 places, 308/418 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 904 ms. Remains : 360/476 places, 308/418 transitions.
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : DES-PT-60b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={2} source=0 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 2} source=0 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1, 2} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1, 2} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s309 1), p1:(NEQ s279 1), p2:(EQ s312 0)], nbAcceptance=3, 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 5394 reset in 345 ms.
Product exploration explored 100000 steps with 5427 reset in 442 ms.
Computed a total of 254 stabilizing places and 249 stable transitions
Computed a total of 254 stabilizing places and 249 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p0) p1 p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p1 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 655 ms. Reduced automaton from 1 states, 8 edges and 3 AP (stutter insensitive) to 1 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Finished random walk after 5047 steps, including 252 resets, run visited all 8 properties in 58 ms. (steps per millisecond=87 )
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p0) p1 p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p1 p2))))]
False Knowledge obtained : [(F (AND p0 p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) p2)), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND p0 p1 p2)), (F (AND p0 (NOT p1) p2)), (F (NOT (AND (NOT p0) p1 p2))), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 17 factoid took 1094 ms. Reduced automaton from 1 states, 8 edges and 3 AP (stutter insensitive) to 1 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 3 out of 360 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 360/360 places, 308/308 transitions.
Applied a total of 0 rules in 9 ms. Remains 360 /360 variables (removed 0) and now considering 308/308 (removed 0) transitions.
[2023-03-08 22:38:44] [INFO ] Invariant cache hit.
[2023-03-08 22:38:44] [INFO ] Implicit Places using invariants in 188 ms returned []
[2023-03-08 22:38:44] [INFO ] Invariant cache hit.
[2023-03-08 22:38:45] [INFO ] Implicit Places using invariants and state equation in 475 ms returned []
Implicit Place search using SMT with State Equation took 664 ms to find 0 implicit places.
[2023-03-08 22:38:45] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 22:38:45] [INFO ] Invariant cache hit.
[2023-03-08 22:38:45] [INFO ] Dead Transitions using invariants and state equation in 153 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 834 ms. Remains : 360/360 places, 308/308 transitions.
Computed a total of 254 stabilizing places and 249 stable transitions
Computed a total of 254 stabilizing places and 249 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p0) p1 p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p1 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 594 ms. Reduced automaton from 1 states, 8 edges and 3 AP (stutter insensitive) to 1 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 523 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) seen :7
Finished Best-First random walk after 8959 steps, including 96 resets, run visited all 1 properties in 12 ms. (steps per millisecond=746 )
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p0) p1 p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p1 p2))))]
False Knowledge obtained : [(F (AND p0 p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) p2)), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND p0 p1 p2)), (F (AND p0 (NOT p1) p2)), (F (NOT (AND (NOT p0) p1 p2))), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 17 factoid took 743 ms. Reduced automaton from 1 states, 8 edges and 3 AP (stutter insensitive) to 1 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 5401 reset in 286 ms.
Product exploration explored 100000 steps with 5457 reset in 312 ms.
Support contains 3 out of 360 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 360/360 places, 308/308 transitions.
Applied a total of 0 rules in 9 ms. Remains 360 /360 variables (removed 0) and now considering 308/308 (removed 0) transitions.
[2023-03-08 22:38:47] [INFO ] Invariant cache hit.
[2023-03-08 22:38:47] [INFO ] Implicit Places using invariants in 189 ms returned []
[2023-03-08 22:38:47] [INFO ] Invariant cache hit.
[2023-03-08 22:38:48] [INFO ] Implicit Places using invariants and state equation in 464 ms returned []
Implicit Place search using SMT with State Equation took 655 ms to find 0 implicit places.
[2023-03-08 22:38:48] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 22:38:48] [INFO ] Invariant cache hit.
[2023-03-08 22:38:48] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 828 ms. Remains : 360/360 places, 308/308 transitions.
Treatment of property DES-PT-60b-LTLFireability-13 finished in 7569 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(X(!p1))) U X((G(p2) U p3))))'
Support contains 5 out of 476 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 476/476 places, 418/418 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 474 transition count 416
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 474 transition count 416
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 474 transition count 415
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 473 transition count 414
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 473 transition count 414
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 473 transition count 413
Applied a total of 8 rules in 18 ms. Remains 473 /476 variables (removed 3) and now considering 413/418 (removed 5) transitions.
// Phase 1: matrix 413 rows 473 cols
[2023-03-08 22:38:48] [INFO ] Computed 62 place invariants in 11 ms
[2023-03-08 22:38:48] [INFO ] Implicit Places using invariants in 233 ms returned []
[2023-03-08 22:38:48] [INFO ] Invariant cache hit.
[2023-03-08 22:38:49] [INFO ] Implicit Places using invariants and state equation in 610 ms returned []
Implicit Place search using SMT with State Equation took 847 ms to find 0 implicit places.
[2023-03-08 22:38:49] [INFO ] Invariant cache hit.
[2023-03-08 22:38:49] [INFO ] Dead Transitions using invariants and state equation in 191 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 473/476 places, 413/418 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1056 ms. Remains : 473/476 places, 413/418 transitions.
Stuttering acceptance computed with spot in 2134 ms :[(NOT p3), (AND p1 (NOT p3)), (NOT p3), (OR (AND p1 (NOT p2) (NOT p3)) (AND p0 p1 (NOT p3))), p1, (AND (NOT p3) p2 p1), (AND (NOT p2) p1), true, p1, (AND p1 (NOT p2)), p1, (OR (AND p1 (NOT p2) (NOT p3)) (AND p0 p1 (NOT p3))), (AND p1 (NOT p2)), (NOT p2), (NOT p3)]
Running random walk in product with property : DES-PT-60b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p3) p2), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p3) p2), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=2 dest: 1}, { cond=(NOT p3), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p3)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=3 dest: 8}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=3 dest: 9}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={} source=3 dest: 10}, { cond=(AND p0 (NOT p3) p2), acceptance={} source=3 dest: 11}, { cond=(AND p0 (NOT p3) p2), acceptance={} source=3 dest: 12}], [{ cond=p1, acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p3) p2 p1), acceptance={} source=5 dest: 14}], [{ cond=(AND (NOT p2) p1), acceptance={} source=6 dest: 7}, { cond=(AND p2 p1), acceptance={} source=6 dest: 13}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=p1, acceptance={} source=8 dest: 4}], [{ cond=(AND (NOT p2) p1), acceptance={} source=9 dest: 4}, { cond=(AND p2 p1), acceptance={} source=9 dest: 6}], [{ cond=(AND (NOT p0) p1), acceptance={} source=10 dest: 8}, { cond=(AND p0 p1), acceptance={0} source=10 dest: 10}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2) p1), acceptance={} source=11 dest: 8}, { cond=(AND (NOT p0) (NOT p3) p2 p1), acceptance={} source=11 dest: 9}, { cond=(AND p0 (NOT p3) (NOT p2) p1), acceptance={} source=11 dest: 10}, { cond=(AND p0 (NOT p3) p2 p1), acceptance={0} source=11 dest: 11}, { cond=(AND p0 (NOT p3) p2 p1), acceptance={} source=11 dest: 12}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=12 dest: 8}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=12 dest: 9}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=12 dest: 10}, { cond=(AND p0 p2 p1), acceptance={} source=12 dest: 12}], [{ cond=(NOT p2), acceptance={} source=13 dest: 7}, { cond=p2, acceptance={} source=13 dest: 13}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=14 dest: 7}, { cond=(AND (NOT p3) p2), acceptance={} source=14 dest: 13}, { cond=(AND (NOT p3) p2), acceptance={0} source=14 dest: 14}]], initial=0, aps=[p0:(EQ s375 1), p3:(EQ s296 1), p2:(AND (EQ s15 1) (EQ s329 1)), p1:(OR (AND (EQ s27 1) (EQ s329 1)) (NOT (AND (EQ s15 1) (EQ s329 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DES-PT-60b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60b-LTLFireability-14 finished in 3224 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)))'
Support contains 1 out of 476 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 476/476 places, 418/418 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 474 transition count 416
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 474 transition count 416
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 474 transition count 415
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 473 transition count 414
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 473 transition count 414
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 473 transition count 413
Applied a total of 8 rules in 24 ms. Remains 473 /476 variables (removed 3) and now considering 413/418 (removed 5) transitions.
[2023-03-08 22:38:51] [INFO ] Invariant cache hit.
[2023-03-08 22:38:51] [INFO ] Implicit Places using invariants in 209 ms returned []
[2023-03-08 22:38:51] [INFO ] Invariant cache hit.
[2023-03-08 22:38:52] [INFO ] Implicit Places using invariants and state equation in 634 ms returned []
Implicit Place search using SMT with State Equation took 858 ms to find 0 implicit places.
[2023-03-08 22:38:52] [INFO ] Invariant cache hit.
[2023-03-08 22:38:52] [INFO ] Dead Transitions using invariants and state equation in 204 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 473/476 places, 413/418 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1088 ms. Remains : 473/476 places, 413/418 transitions.
Stuttering acceptance computed with spot in 66 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-60b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s315 0)], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 96 steps with 0 reset in 0 ms.
FORMULA DES-PT-60b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60b-LTLFireability-15 finished in 1168 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' '!(F((G(p0)||G(p1)||G(p2))))'
[2023-03-08 22:38:52] [INFO ] Flatten gal took : 26 ms
[2023-03-08 22:38:52] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-08 22:38:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 476 places, 418 transitions and 1491 arcs took 4 ms.
Total runtime 72433 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1430/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1430/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : DES-PT-60b-LTLFireability-09
Could not compute solution for formula : DES-PT-60b-LTLFireability-13

BK_STOP 1678315136154

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

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

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

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is DES-PT-60b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r105-tall-167814481300500"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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