Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 280K
-rw-r--r-- 1 mcc users 5.2K Apr 29 15:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K Apr 29 15:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Apr 29 15:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 29 15:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 07:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 07:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 9 07:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 9 07:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 69K May 10 09:33 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-02b-LTLFireability-00
FORMULA_NAME DES-PT-02b-LTLFireability-01
FORMULA_NAME DES-PT-02b-LTLFireability-02
FORMULA_NAME DES-PT-02b-LTLFireability-03
FORMULA_NAME DES-PT-02b-LTLFireability-04
FORMULA_NAME DES-PT-02b-LTLFireability-05
FORMULA_NAME DES-PT-02b-LTLFireability-06
FORMULA_NAME DES-PT-02b-LTLFireability-07
FORMULA_NAME DES-PT-02b-LTLFireability-08
FORMULA_NAME DES-PT-02b-LTLFireability-09
FORMULA_NAME DES-PT-02b-LTLFireability-10
FORMULA_NAME DES-PT-02b-LTLFireability-11
FORMULA_NAME DES-PT-02b-LTLFireability-12
FORMULA_NAME DES-PT-02b-LTLFireability-13
FORMULA_NAME DES-PT-02b-LTLFireability-14
FORMULA_NAME DES-PT-02b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652717229299

Running Version 202205111006
[2022-05-16 16:07:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 16:07:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 16:07:11] [INFO ] Load time of PNML (sax parser for PT used): 157 ms
[2022-05-16 16:07:11] [INFO ] Transformed 288 places.
[2022-05-16 16:07:11] [INFO ] Transformed 239 transitions.
[2022-05-16 16:07:11] [INFO ] Found NUPN structural information;
[2022-05-16 16:07:11] [INFO ] Parsed PT model containing 288 places and 239 transitions in 360 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA DES-PT-02b-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-02b-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-02b-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-02b-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 288 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 288/288 places, 239/239 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 285 transition count 239
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 24 place count 264 transition count 218
Iterating global reduction 1 with 21 rules applied. Total rules applied 45 place count 264 transition count 218
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 56 place count 253 transition count 207
Iterating global reduction 1 with 11 rules applied. Total rules applied 67 place count 253 transition count 207
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 76 place count 253 transition count 198
Applied a total of 76 rules in 118 ms. Remains 253 /288 variables (removed 35) and now considering 198/239 (removed 41) transitions.
// Phase 1: matrix 198 rows 253 cols
[2022-05-16 16:07:11] [INFO ] Computed 62 place invariants in 41 ms
[2022-05-16 16:07:12] [INFO ] Implicit Places using invariants in 450 ms returned []
// Phase 1: matrix 198 rows 253 cols
[2022-05-16 16:07:12] [INFO ] Computed 62 place invariants in 12 ms
[2022-05-16 16:07:12] [INFO ] Implicit Places using invariants and state equation in 543 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1053 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 252/288 places, 198/239 transitions.
Applied a total of 0 rules in 7 ms. Remains 252 /252 variables (removed 0) and now considering 198/198 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 252/288 places, 198/239 transitions.
Support contains 29 out of 252 places after structural reductions.
[2022-05-16 16:07:13] [INFO ] Flatten gal took : 121 ms
[2022-05-16 16:07:13] [INFO ] Flatten gal took : 64 ms
[2022-05-16 16:07:13] [INFO ] Input system was already deterministic with 198 transitions.
Support contains 28 out of 252 places (down from 29) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 87 resets, run finished after 323 ms. (steps per millisecond=30 ) properties (out of 27) seen :26
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 198 rows 252 cols
[2022-05-16 16:07:13] [INFO ] Computed 61 place invariants in 8 ms
[2022-05-16 16:07:13] [INFO ] [Real]Absence check using 33 positive place invariants in 15 ms returned sat
[2022-05-16 16:07:14] [INFO ] [Real]Absence check using 33 positive and 28 generalized place invariants in 23 ms returned sat
[2022-05-16 16:07:14] [INFO ] After 154ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-16 16:07:14] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 9 ms to minimize.
[2022-05-16 16:07:14] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2022-05-16 16:07:14] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 2 ms to minimize.
[2022-05-16 16:07:14] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 2 ms to minimize.
[2022-05-16 16:07:14] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2022-05-16 16:07:14] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 414 ms
[2022-05-16 16:07:14] [INFO ] After 590ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 16:07:14] [INFO ] After 747ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 16:07:14] [INFO ] [Nat]Absence check using 33 positive place invariants in 26 ms returned sat
[2022-05-16 16:07:14] [INFO ] [Nat]Absence check using 33 positive and 28 generalized place invariants in 23 ms returned sat
[2022-05-16 16:07:14] [INFO ] After 158ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 16:07:15] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 0 ms to minimize.
[2022-05-16 16:07:15] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 0 ms to minimize.
[2022-05-16 16:07:15] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2022-05-16 16:07:15] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2022-05-16 16:07:15] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:07:15] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2022-05-16 16:07:15] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 513 ms
[2022-05-16 16:07:15] [INFO ] After 697ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2022-05-16 16:07:15] [INFO ] After 860ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 2 out of 252 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 252/252 places, 198/198 transitions.
Graph (complete) has 456 edges and 252 vertex of which 246 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.5 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 246 transition count 175
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 37 place count 229 transition count 175
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 37 place count 229 transition count 165
Deduced a syphon composed of 10 places in 5 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 57 place count 219 transition count 165
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 62 place count 214 transition count 160
Iterating global reduction 2 with 5 rules applied. Total rules applied 67 place count 214 transition count 160
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 214 transition count 159
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 72 place count 210 transition count 155
Iterating global reduction 3 with 4 rules applied. Total rules applied 76 place count 210 transition count 155
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 80 place count 210 transition count 151
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 82 place count 209 transition count 150
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 82 place count 209 transition count 149
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 84 place count 208 transition count 149
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 5 with 154 rules applied. Total rules applied 238 place count 131 transition count 72
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 242 place count 129 transition count 74
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 243 place count 129 transition count 73
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 244 place count 128 transition count 73
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 245 place count 128 transition count 73
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 246 place count 127 transition count 72
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 247 place count 126 transition count 72
Applied a total of 247 rules in 119 ms. Remains 126 /252 variables (removed 126) and now considering 72/198 (removed 126) transitions.
Finished structural reductions, in 1 iterations. Remains : 126/252 places, 72/198 transitions.
Incomplete random walk after 10000 steps, including 508 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1373349 steps, run timeout after 3001 ms. (steps per millisecond=457 ) properties seen :{}
Probabilistic random walk after 1373349 steps, saw 202693 distinct states, run finished after 3002 ms. (steps per millisecond=457 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 72 rows 126 cols
[2022-05-16 16:07:18] [INFO ] Computed 60 place invariants in 3 ms
[2022-05-16 16:07:18] [INFO ] [Real]Absence check using 36 positive place invariants in 12 ms returned sat
[2022-05-16 16:07:18] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 10 ms returned sat
[2022-05-16 16:07:18] [INFO ] After 59ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-16 16:07:18] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:07:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2022-05-16 16:07:18] [INFO ] After 134ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 16:07:18] [INFO ] After 207ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 16:07:19] [INFO ] [Nat]Absence check using 36 positive place invariants in 10 ms returned sat
[2022-05-16 16:07:19] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 10 ms returned sat
[2022-05-16 16:07:19] [INFO ] After 102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 16:07:19] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2022-05-16 16:07:19] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2022-05-16 16:07:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 97 ms
[2022-05-16 16:07:19] [INFO ] After 212ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2022-05-16 16:07:19] [INFO ] After 302ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 126 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 126/126 places, 72/72 transitions.
Applied a total of 0 rules in 12 ms. Remains 126 /126 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 126/126 places, 72/72 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 126/126 places, 72/72 transitions.
Applied a total of 0 rules in 7 ms. Remains 126 /126 variables (removed 0) and now considering 72/72 (removed 0) transitions.
// Phase 1: matrix 72 rows 126 cols
[2022-05-16 16:07:19] [INFO ] Computed 60 place invariants in 1 ms
[2022-05-16 16:07:19] [INFO ] Implicit Places using invariants in 143 ms returned []
// Phase 1: matrix 72 rows 126 cols
[2022-05-16 16:07:19] [INFO ] Computed 60 place invariants in 1 ms
[2022-05-16 16:07:19] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
[2022-05-16 16:07:19] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 72 rows 126 cols
[2022-05-16 16:07:19] [INFO ] Computed 60 place invariants in 2 ms
[2022-05-16 16:07:19] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 126/126 places, 72/72 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 126 transition count 72
Applied a total of 1 rules in 16 ms. Remains 126 /126 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 72 rows 126 cols
[2022-05-16 16:07:19] [INFO ] Computed 60 place invariants in 1 ms
[2022-05-16 16:07:19] [INFO ] [Real]Absence check using 36 positive place invariants in 8 ms returned sat
[2022-05-16 16:07:19] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 10 ms returned sat
[2022-05-16 16:07:19] [INFO ] After 60ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-16 16:07:19] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2022-05-16 16:07:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2022-05-16 16:07:19] [INFO ] After 134ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 16:07:19] [INFO ] After 195ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 16:07:20] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2022-05-16 16:07:20] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 8 ms returned sat
[2022-05-16 16:07:20] [INFO ] After 92ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 16:07:20] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:07:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2022-05-16 16:07:20] [INFO ] After 161ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2022-05-16 16:07:20] [INFO ] After 227ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-16 16:07:20] [INFO ] Flatten gal took : 19 ms
[2022-05-16 16:07:20] [INFO ] Flatten gal took : 12 ms
[2022-05-16 16:07:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17285285400593195294.gal : 17 ms
[2022-05-16 16:07:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16860739495935118371.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms14985232051207651809;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17285285400593195294.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16860739495935118371.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality16860739495935118371.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 24
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24 after 42
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :42 after 144
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :144 after 1160
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1160 after 11524
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :28540 after 49554
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :49554 after 175912
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :175912 after 6.4794e+07
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :6.4794e+07 after 3.52383e+08
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :3.52383e+08 after 6.15484e+08
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :6.15484e+08 after 8.4469e+08
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :8.4469e+08 after 1.93741e+09
Reachability property AtomicPropp8 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 16385 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,7.04264e+09,6.27879,144740,2,160992,20,697164,6,0,575,605133,0
Total reachable state count : 7042640592

Verifying 1 reachability properties.
Reachability property AtomicPropp8 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp8,3024,6.30971,144740,2,348,20,697164,7,0,581,605133,0
FORMULA DES-PT-02b-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 66 stabilizing places and 59 stable transitions
Graph (complete) has 456 edges and 252 vertex of which 246 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.10 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(X(X(G((F(G(X(p0)))&&p1))))))))'
Support contains 2 out of 252 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 252/252 places, 198/198 transitions.
Graph (complete) has 456 edges and 252 vertex of which 246 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions removed 4 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 245 transition count 178
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 230 transition count 178
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 230 transition count 167
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 219 transition count 167
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 58 place count 214 transition count 162
Iterating global reduction 2 with 5 rules applied. Total rules applied 63 place count 214 transition count 162
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 214 transition count 161
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 68 place count 210 transition count 157
Iterating global reduction 3 with 4 rules applied. Total rules applied 72 place count 210 transition count 157
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 76 place count 210 transition count 153
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 78 place count 209 transition count 152
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 78 place count 209 transition count 151
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 80 place count 208 transition count 151
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 232 place count 132 transition count 75
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 234 place count 131 transition count 75
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 236 place count 129 transition count 73
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 237 place count 128 transition count 73
Applied a total of 237 rules in 62 ms. Remains 128 /252 variables (removed 124) and now considering 73/198 (removed 125) transitions.
// Phase 1: matrix 73 rows 128 cols
[2022-05-16 16:07:27] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-16 16:07:27] [INFO ] Implicit Places using invariants in 207 ms returned []
// Phase 1: matrix 73 rows 128 cols
[2022-05-16 16:07:27] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-16 16:07:27] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 429 ms to find 0 implicit places.
[2022-05-16 16:07:27] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 73 rows 128 cols
[2022-05-16 16:07:27] [INFO ] Computed 58 place invariants in 6 ms
[2022-05-16 16:07:27] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 128/252 places, 73/198 transitions.
Finished structural reductions, in 1 iterations. Remains : 128/252 places, 73/198 transitions.
Stuttering acceptance computed with spot in 314 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DES-PT-02b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s12 0), p0:(EQ s25 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4985 reset in 476 ms.
Product exploration explored 100000 steps with 4951 reset in 364 ms.
Computed a total of 23 stabilizing places and 18 stable transitions
Computed a total of 23 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 6 factoid took 273 ms. Reduced automaton from 2 states, 5 edges and 2 AP to 2 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 73 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Finished random walk after 54 steps, including 3 resets, run visited all 3 properties in 3 ms. (steps per millisecond=18 )
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT p0)), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 6 factoid took 343 ms. Reduced automaton from 2 states, 5 edges and 2 AP to 2 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 72 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 73/73 transitions.
Applied a total of 0 rules in 5 ms. Remains 128 /128 variables (removed 0) and now considering 73/73 (removed 0) transitions.
// Phase 1: matrix 73 rows 128 cols
[2022-05-16 16:07:29] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-16 16:07:29] [INFO ] Implicit Places using invariants in 184 ms returned []
// Phase 1: matrix 73 rows 128 cols
[2022-05-16 16:07:29] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-16 16:07:30] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 428 ms to find 0 implicit places.
[2022-05-16 16:07:30] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 73 rows 128 cols
[2022-05-16 16:07:30] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-16 16:07:30] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 128/128 places, 73/73 transitions.
Computed a total of 23 stabilizing places and 18 stable transitions
Computed a total of 23 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 6 factoid took 280 ms. Reduced automaton from 2 states, 5 edges and 2 AP to 2 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 73 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Finished random walk after 15 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=15 )
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT p0)), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 6 factoid took 347 ms. Reduced automaton from 2 states, 5 edges and 2 AP to 2 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 73 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 4981 reset in 238 ms.
Product exploration explored 100000 steps with 4985 reset in 281 ms.
Built C files in :
/tmp/ltsmin8778532159229979021
[2022-05-16 16:07:31] [INFO ] Computing symmetric may disable matrix : 73 transitions.
[2022-05-16 16:07:31] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 16:07:31] [INFO ] Computing symmetric may enable matrix : 73 transitions.
[2022-05-16 16:07:31] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 16:07:31] [INFO ] Computing Do-Not-Accords matrix : 73 transitions.
[2022-05-16 16:07:31] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 16:07:31] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8778532159229979021
Running compilation step : cd /tmp/ltsmin8778532159229979021;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 444 ms.
Running link step : cd /tmp/ltsmin8778532159229979021;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin8778532159229979021;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3367735830779098253.hoa' '--buchi-type=spotba'
LTSmin run took 818 ms.
FORMULA DES-PT-02b-LTLFireability-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-02b-LTLFireability-00 finished in 6097 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))||X(F(p1))))'
Support contains 5 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 198/198 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 248 transition count 194
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 248 transition count 194
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 248 transition count 193
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 246 transition count 191
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 246 transition count 191
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 15 place count 246 transition count 189
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 245 transition count 188
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 245 transition count 188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 245 transition count 187
Applied a total of 18 rules in 18 ms. Remains 245 /252 variables (removed 7) and now considering 187/198 (removed 11) transitions.
// Phase 1: matrix 187 rows 245 cols
[2022-05-16 16:07:33] [INFO ] Computed 61 place invariants in 3 ms
[2022-05-16 16:07:33] [INFO ] Implicit Places using invariants in 168 ms returned []
// Phase 1: matrix 187 rows 245 cols
[2022-05-16 16:07:33] [INFO ] Computed 61 place invariants in 9 ms
[2022-05-16 16:07:33] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 531 ms to find 0 implicit places.
// Phase 1: matrix 187 rows 245 cols
[2022-05-16 16:07:33] [INFO ] Computed 61 place invariants in 2 ms
[2022-05-16 16:07:33] [INFO ] Dead Transitions using invariants and state equation in 254 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 245/252 places, 187/198 transitions.
Finished structural reductions, in 1 iterations. Remains : 245/252 places, 187/198 transitions.
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : DES-PT-02b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s229 1), p0:(OR (AND (OR (EQ s28 0) (EQ s80 0)) (EQ s3 0)) (AND (EQ s70 0) (EQ s3 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 302 ms.
Product exploration explored 100000 steps with 33333 reset in 283 ms.
Computed a total of 66 stabilizing places and 59 stable transitions
Graph (complete) has 439 edges and 245 vertex of which 239 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.5 ms
Computed a total of 66 stabilizing places and 59 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p1) (NOT p0)))))
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 4 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA DES-PT-02b-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-02b-LTLFireability-02 finished in 1648 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 3 out of 252 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 252/252 places, 198/198 transitions.
Graph (complete) has 456 edges and 252 vertex of which 246 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions removed 4 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 245 transition count 178
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 230 transition count 178
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 31 place count 230 transition count 168
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 51 place count 220 transition count 168
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 56 place count 215 transition count 163
Iterating global reduction 2 with 5 rules applied. Total rules applied 61 place count 215 transition count 163
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 215 transition count 162
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 66 place count 211 transition count 158
Iterating global reduction 3 with 4 rules applied. Total rules applied 70 place count 211 transition count 158
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 74 place count 211 transition count 154
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 76 place count 210 transition count 153
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 76 place count 210 transition count 152
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 78 place count 209 transition count 152
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 230 place count 133 transition count 76
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 234 place count 131 transition count 78
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 236 place count 129 transition count 76
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 237 place count 128 transition count 76
Applied a total of 237 rules in 51 ms. Remains 128 /252 variables (removed 124) and now considering 76/198 (removed 122) transitions.
// Phase 1: matrix 76 rows 128 cols
[2022-05-16 16:07:34] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-16 16:07:34] [INFO ] Implicit Places using invariants in 153 ms returned []
// Phase 1: matrix 76 rows 128 cols
[2022-05-16 16:07:35] [INFO ] Computed 58 place invariants in 8 ms
[2022-05-16 16:07:35] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
[2022-05-16 16:07:35] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 76 rows 128 cols
[2022-05-16 16:07:35] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-16 16:07:35] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 128/252 places, 76/198 transitions.
Finished structural reductions, in 1 iterations. Remains : 128/252 places, 76/198 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : DES-PT-02b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s1 1) (EQ s40 1)), p0:(EQ s107 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 1 ms.
FORMULA DES-PT-02b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-02b-LTLFireability-04 finished in 603 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(G(p0)))||(!G(p0) U G((F(p0)&&p1))))))'
Support contains 2 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 198/198 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 247 transition count 193
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 247 transition count 193
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 247 transition count 192
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 244 transition count 189
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 244 transition count 189
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 19 place count 244 transition count 187
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 243 transition count 186
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 243 transition count 186
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 243 transition count 185
Applied a total of 22 rules in 15 ms. Remains 243 /252 variables (removed 9) and now considering 185/198 (removed 13) transitions.
// Phase 1: matrix 185 rows 243 cols
[2022-05-16 16:07:35] [INFO ] Computed 61 place invariants in 1 ms
[2022-05-16 16:07:35] [INFO ] Implicit Places using invariants in 167 ms returned []
// Phase 1: matrix 185 rows 243 cols
[2022-05-16 16:07:35] [INFO ] Computed 61 place invariants in 2 ms
[2022-05-16 16:07:35] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 512 ms to find 0 implicit places.
// Phase 1: matrix 185 rows 243 cols
[2022-05-16 16:07:35] [INFO ] Computed 61 place invariants in 2 ms
[2022-05-16 16:07:36] [INFO ] Dead Transitions using invariants and state equation in 228 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 243/252 places, 185/198 transitions.
Finished structural reductions, in 1 iterations. Remains : 243/252 places, 185/198 transitions.
Stuttering acceptance computed with spot in 267 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (OR (NOT p0) (NOT p1)), p0]
Running random walk in product with property : DES-PT-02b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 3}, { cond=p1, acceptance={} source=5 dest: 5}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 6}], [{ cond=p0, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(EQ s28 1), p0:(EQ s46 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 11051 steps with 219 reset in 24 ms.
FORMULA DES-PT-02b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-02b-LTLFireability-05 finished in 1070 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((!(!(G(F(p0))||p1) U !X(p2))&&p3))))'
Support contains 3 out of 252 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 198/198 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 246 transition count 192
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 246 transition count 192
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 246 transition count 191
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 16 place count 243 transition count 188
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 243 transition count 188
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 21 place count 243 transition count 186
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 242 transition count 185
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 242 transition count 185
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 242 transition count 184
Applied a total of 24 rules in 16 ms. Remains 242 /252 variables (removed 10) and now considering 184/198 (removed 14) transitions.
// Phase 1: matrix 184 rows 242 cols
[2022-05-16 16:07:36] [INFO ] Computed 61 place invariants in 2 ms
[2022-05-16 16:07:36] [INFO ] Implicit Places using invariants in 205 ms returned []
// Phase 1: matrix 184 rows 242 cols
[2022-05-16 16:07:36] [INFO ] Computed 61 place invariants in 2 ms
[2022-05-16 16:07:37] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 555 ms to find 0 implicit places.
// Phase 1: matrix 184 rows 242 cols
[2022-05-16 16:07:37] [INFO ] Computed 61 place invariants in 1 ms
[2022-05-16 16:07:37] [INFO ] Dead Transitions using invariants and state equation in 215 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 242/252 places, 184/198 transitions.
Finished structural reductions, in 1 iterations. Remains : 242/252 places, 184/198 transitions.
Stuttering acceptance computed with spot in 131 ms :[true, (OR (NOT p2) (NOT p3)), (OR (NOT p3) (NOT p2)), (OR (NOT p2) (NOT p3))]
Running random walk in product with property : DES-PT-02b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p3), acceptance={} source=2 dest: 0}, { cond=p3, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p3) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p3 p2), acceptance={} source=3 dest: 3}]], initial=1, aps=[p3:(EQ s61 0), p2:(AND (EQ s28 1) (EQ s79 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 2 steps with 0 reset in 1 ms.
FORMULA DES-PT-02b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-02b-LTLFireability-07 finished in 944 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||G((p1||G(p2)))))'
Support contains 3 out of 252 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 252/252 places, 198/198 transitions.
Graph (complete) has 456 edges and 252 vertex of which 246 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 245 transition count 180
Reduce places removed 13 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 232 transition count 179
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 29 place count 231 transition count 179
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 29 place count 231 transition count 169
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 49 place count 221 transition count 169
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 53 place count 217 transition count 165
Iterating global reduction 3 with 4 rules applied. Total rules applied 57 place count 217 transition count 165
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 58 place count 217 transition count 164
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 61 place count 214 transition count 161
Iterating global reduction 4 with 3 rules applied. Total rules applied 64 place count 214 transition count 161
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 67 place count 214 transition count 158
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 69 place count 213 transition count 157
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 6 with 150 rules applied. Total rules applied 219 place count 138 transition count 82
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 227 place count 134 transition count 91
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 229 place count 132 transition count 89
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 230 place count 131 transition count 89
Applied a total of 230 rules in 46 ms. Remains 131 /252 variables (removed 121) and now considering 89/198 (removed 109) transitions.
// Phase 1: matrix 89 rows 131 cols
[2022-05-16 16:07:37] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-16 16:07:37] [INFO ] Implicit Places using invariants in 148 ms returned []
// Phase 1: matrix 89 rows 131 cols
[2022-05-16 16:07:37] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-16 16:07:37] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
[2022-05-16 16:07:37] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 89 rows 131 cols
[2022-05-16 16:07:37] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-16 16:07:38] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 131/252 places, 89/198 transitions.
Finished structural reductions, in 1 iterations. Remains : 131/252 places, 89/198 transitions.
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DES-PT-02b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s17 1), p2:(EQ s26 1), p0:(EQ s38 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 1 ms.
FORMULA DES-PT-02b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-02b-LTLFireability-10 finished in 729 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(F((F(p0)&&p0))))))'
Support contains 1 out of 252 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 252/252 places, 198/198 transitions.
Graph (complete) has 456 edges and 252 vertex of which 246 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions removed 4 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 245 transition count 178
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 230 transition count 178
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 230 transition count 167
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 219 transition count 167
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 58 place count 214 transition count 162
Iterating global reduction 2 with 5 rules applied. Total rules applied 63 place count 214 transition count 162
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 214 transition count 161
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 68 place count 210 transition count 157
Iterating global reduction 3 with 4 rules applied. Total rules applied 72 place count 210 transition count 157
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 76 place count 210 transition count 153
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 78 place count 209 transition count 152
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 78 place count 209 transition count 151
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 80 place count 208 transition count 151
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 5 with 150 rules applied. Total rules applied 230 place count 133 transition count 76
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 234 place count 131 transition count 78
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 236 place count 129 transition count 76
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 237 place count 128 transition count 76
Applied a total of 237 rules in 52 ms. Remains 128 /252 variables (removed 124) and now considering 76/198 (removed 122) transitions.
// Phase 1: matrix 76 rows 128 cols
[2022-05-16 16:07:38] [INFO ] Computed 58 place invariants in 0 ms
[2022-05-16 16:07:38] [INFO ] Implicit Places using invariants in 148 ms returned []
// Phase 1: matrix 76 rows 128 cols
[2022-05-16 16:07:38] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-16 16:07:38] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
[2022-05-16 16:07:38] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 76 rows 128 cols
[2022-05-16 16:07:38] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-16 16:07:38] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 128/252 places, 76/198 transitions.
Finished structural reductions, in 1 iterations. Remains : 128/252 places, 76/198 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-02b-LTLFireability-11 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:(EQ s49 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 60 steps with 5 reset in 1 ms.
FORMULA DES-PT-02b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-02b-LTLFireability-11 finished in 650 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!F(p0) U (F(G(X(G(p0))))||p1)))'
Support contains 2 out of 252 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 252/252 places, 198/198 transitions.
Graph (complete) has 456 edges and 252 vertex of which 246 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 245 transition count 181
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 233 transition count 180
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 27 place count 232 transition count 180
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 27 place count 232 transition count 169
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 49 place count 221 transition count 169
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 54 place count 216 transition count 164
Iterating global reduction 3 with 5 rules applied. Total rules applied 59 place count 216 transition count 164
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 60 place count 216 transition count 163
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 64 place count 212 transition count 159
Iterating global reduction 4 with 4 rules applied. Total rules applied 68 place count 212 transition count 159
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 72 place count 212 transition count 155
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 74 place count 211 transition count 154
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 74 place count 211 transition count 153
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 76 place count 210 transition count 153
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 6 with 154 rules applied. Total rules applied 230 place count 133 transition count 76
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 232 place count 132 transition count 76
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 234 place count 130 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 235 place count 129 transition count 74
Applied a total of 235 rules in 35 ms. Remains 129 /252 variables (removed 123) and now considering 74/198 (removed 124) transitions.
// Phase 1: matrix 74 rows 129 cols
[2022-05-16 16:07:38] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-16 16:07:38] [INFO ] Implicit Places using invariants in 129 ms returned []
// Phase 1: matrix 74 rows 129 cols
[2022-05-16 16:07:38] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-16 16:07:39] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
[2022-05-16 16:07:39] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 74 rows 129 cols
[2022-05-16 16:07:39] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-16 16:07:39] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 129/252 places, 74/198 transitions.
Finished structural reductions, in 1 iterations. Remains : 129/252 places, 74/198 transitions.
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), false]
Running random walk in product with property : DES-PT-02b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s36 1), p0:(EQ s12 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 23 steps with 0 reset in 0 ms.
FORMULA DES-PT-02b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-02b-LTLFireability-12 finished in 645 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F((F(!p0) U p1)))&&X(!(p0 U p2))))'
Support contains 4 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 198/198 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 248 transition count 194
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 248 transition count 194
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 245 transition count 191
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 245 transition count 191
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 17 place count 245 transition count 188
Applied a total of 17 rules in 10 ms. Remains 245 /252 variables (removed 7) and now considering 188/198 (removed 10) transitions.
// Phase 1: matrix 188 rows 245 cols
[2022-05-16 16:07:39] [INFO ] Computed 61 place invariants in 2 ms
[2022-05-16 16:07:39] [INFO ] Implicit Places using invariants in 202 ms returned []
// Phase 1: matrix 188 rows 245 cols
[2022-05-16 16:07:39] [INFO ] Computed 61 place invariants in 1 ms
[2022-05-16 16:07:40] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 576 ms to find 0 implicit places.
// Phase 1: matrix 188 rows 245 cols
[2022-05-16 16:07:40] [INFO ] Computed 61 place invariants in 2 ms
[2022-05-16 16:07:40] [INFO ] Dead Transitions using invariants and state equation in 219 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 245/252 places, 188/198 transitions.
Finished structural reductions, in 1 iterations. Remains : 245/252 places, 188/198 transitions.
Stuttering acceptance computed with spot in 187 ms :[p2, (NOT p1), (OR (NOT p1) p2), true, (OR (NOT p1) p2)]
Running random walk in product with property : DES-PT-02b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 (NOT p2) p1), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=p2, acceptance={0} source=4 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=2, aps=[p0:(AND (EQ s32 1) (EQ s90 1)), p2:(EQ s229 1), p1:(NEQ s214 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 381 ms.
Product exploration explored 100000 steps with 50000 reset in 411 ms.
Computed a total of 66 stabilizing places and 59 stable transitions
Graph (complete) has 440 edges and 245 vertex of which 240 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Computed a total of 66 stabilizing places and 59 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2) p1)))), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p0) (NOT p2) p1)
Knowledge based reduction with 12 factoid took 339 ms. Reduced automaton from 5 states, 9 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA DES-PT-02b-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-02b-LTLFireability-13 finished in 2152 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&p1&&(F(p2)||(G(p2)&&p0)))))'
Support contains 3 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 198/198 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 246 transition count 192
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 246 transition count 192
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 246 transition count 191
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 17 place count 242 transition count 187
Iterating global reduction 1 with 4 rules applied. Total rules applied 21 place count 242 transition count 187
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 24 place count 242 transition count 184
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 241 transition count 183
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 241 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 27 place count 241 transition count 182
Applied a total of 27 rules in 24 ms. Remains 241 /252 variables (removed 11) and now considering 182/198 (removed 16) transitions.
// Phase 1: matrix 182 rows 241 cols
[2022-05-16 16:07:41] [INFO ] Computed 61 place invariants in 1 ms
[2022-05-16 16:07:41] [INFO ] Implicit Places using invariants in 177 ms returned []
// Phase 1: matrix 182 rows 241 cols
[2022-05-16 16:07:41] [INFO ] Computed 61 place invariants in 2 ms
[2022-05-16 16:07:42] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 517 ms to find 0 implicit places.
// Phase 1: matrix 182 rows 241 cols
[2022-05-16 16:07:42] [INFO ] Computed 61 place invariants in 2 ms
[2022-05-16 16:07:42] [INFO ] Dead Transitions using invariants and state equation in 228 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 241/252 places, 182/198 transitions.
Finished structural reductions, in 1 iterations. Remains : 241/252 places, 182/198 transitions.
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), true]
Running random walk in product with property : DES-PT-02b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(AND p0 p2), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 4}], [{ cond=(AND p1 p0 p2), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(OR (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(EQ s118 1), p2:(EQ s202 1), p1:(EQ s236 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-02b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-02b-LTLFireability-14 finished in 958 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F(p0))))'
Support contains 1 out of 252 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 252/252 places, 198/198 transitions.
Graph (complete) has 456 edges and 252 vertex of which 246 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions removed 4 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 245 transition count 178
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 230 transition count 178
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 31 place count 230 transition count 168
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 51 place count 220 transition count 168
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 55 place count 216 transition count 164
Iterating global reduction 2 with 4 rules applied. Total rules applied 59 place count 216 transition count 164
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 60 place count 216 transition count 163
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 63 place count 213 transition count 160
Iterating global reduction 3 with 3 rules applied. Total rules applied 66 place count 213 transition count 160
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 68 place count 213 transition count 158
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 68 place count 213 transition count 157
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 70 place count 212 transition count 157
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 0 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 4 with 158 rules applied. Total rules applied 228 place count 133 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 229 place count 133 transition count 77
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 5 with 4 rules applied. Total rules applied 233 place count 131 transition count 82
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 235 place count 129 transition count 80
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 236 place count 128 transition count 80
Applied a total of 236 rules in 36 ms. Remains 128 /252 variables (removed 124) and now considering 80/198 (removed 118) transitions.
// Phase 1: matrix 80 rows 128 cols
[2022-05-16 16:07:42] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-16 16:07:42] [INFO ] Implicit Places using invariants in 128 ms returned []
// Phase 1: matrix 80 rows 128 cols
[2022-05-16 16:07:42] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-16 16:07:42] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
[2022-05-16 16:07:42] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 80 rows 128 cols
[2022-05-16 16:07:42] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-16 16:07:43] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 128/252 places, 80/198 transitions.
Finished structural reductions, in 1 iterations. Remains : 128/252 places, 80/198 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-02b-LTLFireability-15 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:(EQ s14 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 6370 reset in 255 ms.
Product exploration explored 100000 steps with 6319 reset in 299 ms.
Computed a total of 23 stabilizing places and 18 stable transitions
Computed a total of 23 stabilizing places and 18 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 to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 132 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 80/80 transitions.
Applied a total of 0 rules in 2 ms. Remains 128 /128 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 128 cols
[2022-05-16 16:07:44] [INFO ] Computed 58 place invariants in 0 ms
[2022-05-16 16:07:44] [INFO ] Implicit Places using invariants in 180 ms returned []
// Phase 1: matrix 80 rows 128 cols
[2022-05-16 16:07:44] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-16 16:07:44] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 424 ms to find 0 implicit places.
[2022-05-16 16:07:44] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 80 rows 128 cols
[2022-05-16 16:07:44] [INFO ] Computed 58 place invariants in 5 ms
[2022-05-16 16:07:44] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 128/128 places, 80/80 transitions.
Computed a total of 23 stabilizing places and 18 stable transitions
Computed a total of 23 stabilizing places and 18 stable transitions
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 to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Finished random walk after 65 steps, including 4 resets, run visited all 1 properties in 1 ms. (steps per millisecond=65 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 128 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 6406 reset in 256 ms.
Product exploration explored 100000 steps with 6373 reset in 278 ms.
Built C files in :
/tmp/ltsmin11847513358922904701
[2022-05-16 16:07:45] [INFO ] Computing symmetric may disable matrix : 80 transitions.
[2022-05-16 16:07:45] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 16:07:45] [INFO ] Computing symmetric may enable matrix : 80 transitions.
[2022-05-16 16:07:45] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 16:07:45] [INFO ] Computing Do-Not-Accords matrix : 80 transitions.
[2022-05-16 16:07:45] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 16:07:45] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11847513358922904701
Running compilation step : cd /tmp/ltsmin11847513358922904701;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 303 ms.
Running link step : cd /tmp/ltsmin11847513358922904701;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin11847513358922904701;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9608904079380424808.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 80/80 transitions.
Applied a total of 0 rules in 4 ms. Remains 128 /128 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 128 cols
[2022-05-16 16:08:00] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-16 16:08:01] [INFO ] Implicit Places using invariants in 152 ms returned []
// Phase 1: matrix 80 rows 128 cols
[2022-05-16 16:08:01] [INFO ] Computed 58 place invariants in 7 ms
[2022-05-16 16:08:01] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
[2022-05-16 16:08:01] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 80 rows 128 cols
[2022-05-16 16:08:01] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-16 16:08:01] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 128/128 places, 80/80 transitions.
Built C files in :
/tmp/ltsmin11836831811611008538
[2022-05-16 16:08:01] [INFO ] Computing symmetric may disable matrix : 80 transitions.
[2022-05-16 16:08:01] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 16:08:01] [INFO ] Computing symmetric may enable matrix : 80 transitions.
[2022-05-16 16:08:01] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 16:08:01] [INFO ] Computing Do-Not-Accords matrix : 80 transitions.
[2022-05-16 16:08:01] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 16:08:01] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11836831811611008538
Running compilation step : cd /tmp/ltsmin11836831811611008538;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 295 ms.
Running link step : cd /tmp/ltsmin11836831811611008538;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin11836831811611008538;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1420944038303487116.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 16:08:16] [INFO ] Flatten gal took : 13 ms
[2022-05-16 16:08:16] [INFO ] Flatten gal took : 12 ms
[2022-05-16 16:08:16] [INFO ] Time to serialize gal into /tmp/LTL15911028764898450351.gal : 3 ms
[2022-05-16 16:08:16] [INFO ] Time to serialize properties into /tmp/LTL9469299906942410275.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15911028764898450351.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9469299906942410275.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1591102...267
Read 1 LTL properties
Checking formula 0 : !((G(X(F("(p41==0)")))))
Formula 0 simplified : !GXF"(p41==0)"
Detected timeout of ITS tools.
[2022-05-16 16:08:31] [INFO ] Flatten gal took : 12 ms
[2022-05-16 16:08:31] [INFO ] Applying decomposition
[2022-05-16 16:08:31] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph11509959320138631727.txt' '-o' '/tmp/graph11509959320138631727.bin' '-w' '/tmp/graph11509959320138631727.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11509959320138631727.bin' '-l' '-1' '-v' '-w' '/tmp/graph11509959320138631727.weights' '-q' '0' '-e' '0.001'
[2022-05-16 16:08:31] [INFO ] Decomposing Gal with order
[2022-05-16 16:08:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 16:08:31] [INFO ] Removed a total of 53 redundant transitions.
[2022-05-16 16:08:31] [INFO ] Flatten gal took : 69 ms
[2022-05-16 16:08:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 29 labels/synchronizations in 11 ms.
[2022-05-16 16:08:31] [INFO ] Time to serialize gal into /tmp/LTL12146955895059666653.gal : 5 ms
[2022-05-16 16:08:31] [INFO ] Time to serialize properties into /tmp/LTL3625093654466489014.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12146955895059666653.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3625093654466489014.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1214695...246
Read 1 LTL properties
Checking formula 0 : !((G(X(F("(i0.u1.p41==0)")))))
Formula 0 simplified : !GXF"(i0.u1.p41==0)"
Reverse transition relation is NOT exact ! Due to transitions t7_t49_t40, t9_t35, t10_t35, t159_t35, t158_t26, t107_t108_t197_t134_t132_t133_t122_t126, i0....423
Computing Next relation with stutter on 118833 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10343119524007887215
[2022-05-16 16:08:46] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10343119524007887215
Running compilation step : cd /tmp/ltsmin10343119524007887215;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 278 ms.
Running link step : cd /tmp/ltsmin10343119524007887215;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin10343119524007887215;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X(<>((LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-02b-LTLFireability-15 finished in 79519 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F(p0))))'
[2022-05-16 16:09:02] [INFO ] Flatten gal took : 17 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17813606560775544143
[2022-05-16 16:09:02] [INFO ] Computing symmetric may disable matrix : 198 transitions.
[2022-05-16 16:09:02] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 16:09:02] [INFO ] Computing symmetric may enable matrix : 198 transitions.
[2022-05-16 16:09:02] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 16:09:02] [INFO ] Applying decomposition
[2022-05-16 16:09:02] [INFO ] Computing Do-Not-Accords matrix : 198 transitions.
[2022-05-16 16:09:02] [INFO ] Flatten gal took : 13 ms
[2022-05-16 16:09:02] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 16:09:02] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17813606560775544143
Running compilation step : cd /tmp/ltsmin17813606560775544143;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2584245819188020691.txt' '-o' '/tmp/graph2584245819188020691.bin' '-w' '/tmp/graph2584245819188020691.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2584245819188020691.bin' '-l' '-1' '-v' '-w' '/tmp/graph2584245819188020691.weights' '-q' '0' '-e' '0.001'
[2022-05-16 16:09:02] [INFO ] Decomposing Gal with order
[2022-05-16 16:09:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 16:09:02] [INFO ] Removed a total of 23 redundant transitions.
[2022-05-16 16:09:02] [INFO ] Flatten gal took : 33 ms
[2022-05-16 16:09:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 6 ms.
[2022-05-16 16:09:02] [INFO ] Time to serialize gal into /tmp/LTLFireability361962294588755317.gal : 8 ms
[2022-05-16 16:09:02] [INFO ] Time to serialize properties into /tmp/LTLFireability2066915654604864448.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability361962294588755317.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2066915654604864448.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...266
Read 1 LTL properties
Checking formula 0 : !((G(X(F("(i1.i2.u12.p41==0)")))))
Formula 0 simplified : !GXF"(i1.i2.u12.p41==0)"
Compilation finished in 644 ms.
Running link step : cd /tmp/ltsmin17813606560775544143;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin17813606560775544143;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X(<>((LTLAPp0==true))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t0, t53, t57, t88, t128, t145, t158, t159, t192, i0.t133, i0.u9.t131, i0.u10.t132, i1.t144, i...833
Computing Next relation with stutter on 339888 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 7/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: LTL layer: formula: [](X(<>((LTLAPp0==true))))
pins2lts-mc-linux64( 4/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: "[](X(<>((LTLAPp0==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.013: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.017: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.070: DFS-FIFO for weak LTL, using special progress label 200
pins2lts-mc-linux64( 0/ 8), 0.070: There are 201 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.070: State length is 253, there are 201 groups
pins2lts-mc-linux64( 0/ 8), 0.070: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.070: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.070: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.070: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.101: ~1 levels ~960 states ~4168 transitions
pins2lts-mc-linux64( 0/ 8), 0.130: ~1 levels ~1920 states ~8792 transitions
pins2lts-mc-linux64( 0/ 8), 0.197: ~1 levels ~3840 states ~18728 transitions
pins2lts-mc-linux64( 0/ 8), 0.299: ~1 levels ~7680 states ~39456 transitions
pins2lts-mc-linux64( 0/ 8), 0.542: ~1 levels ~15360 states ~86480 transitions
pins2lts-mc-linux64( 0/ 8), 1.038: ~1 levels ~30720 states ~196824 transitions
pins2lts-mc-linux64( 0/ 8), 1.823: ~1 levels ~61440 states ~433288 transitions
pins2lts-mc-linux64( 0/ 8), 3.330: ~1 levels ~122880 states ~929248 transitions
pins2lts-mc-linux64( 3/ 8), 5.222: ~66 levels ~245760 states ~1154808 transitions
pins2lts-mc-linux64( 3/ 8), 7.527: ~66 levels ~491520 states ~1850224 transitions
pins2lts-mc-linux64( 3/ 8), 11.150: ~66 levels ~983040 states ~3409840 transitions
pins2lts-mc-linux64( 3/ 8), 17.498: ~66 levels ~1966080 states ~6689152 transitions
pins2lts-mc-linux64( 4/ 8), 31.347: ~63 levels ~3932160 states ~14876136 transitions
pins2lts-mc-linux64( 1/ 8), 58.226: ~76 levels ~7864320 states ~30163488 transitions
pins2lts-mc-linux64( 1/ 8), 113.265: ~76 levels ~15728640 states ~60974496 transitions
pins2lts-mc-linux64( 1/ 8), 224.938: ~76 levels ~31457280 states ~125671552 transitions
pins2lts-mc-linux64( 1/ 8), 448.325: ~76 levels ~62914560 states ~253704824 transitions
pins2lts-mc-linux64( 1/ 8), 907.522: ~76 levels ~125829120 states ~517608080 transitions
pins2lts-mc-linux64( 2/ 8), 1055.517: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1055.584:
pins2lts-mc-linux64( 0/ 8), 1055.584: mean standard work distribution: 3.9% (states) 3.1% (transitions)
pins2lts-mc-linux64( 0/ 8), 1055.584:
pins2lts-mc-linux64( 0/ 8), 1055.584: Explored 132082476 states 603523027 transitions, fanout: 4.569
pins2lts-mc-linux64( 0/ 8), 1055.584: Total exploration time 1055.500 sec (1055.450 sec minimum, 1055.471 sec on average)
pins2lts-mc-linux64( 0/ 8), 1055.584: States per second: 125137, Transitions per second: 571789
pins2lts-mc-linux64( 0/ 8), 1055.584:
pins2lts-mc-linux64( 0/ 8), 1055.584: Progress states detected: 4097408
pins2lts-mc-linux64( 0/ 8), 1055.584: Redundant explorations: -1.5907
pins2lts-mc-linux64( 0/ 8), 1055.584:
pins2lts-mc-linux64( 0/ 8), 1055.584: Queue width: 8B, total height: 3801220, memory: 29.00MB
pins2lts-mc-linux64( 0/ 8), 1055.584: Tree memory: 1038.5MB, 8.1 B/state, compr.: 0.8%
pins2lts-mc-linux64( 0/ 8), 1055.584: Tree fill ratio (roots/leafs): 99.0%/5.0%
pins2lts-mc-linux64( 0/ 8), 1055.584: Stored 199 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1055.584: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1055.584: Est. total memory use: 1067.5MB (~1053.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17813606560775544143;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X(<>((LTLAPp0==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17813606560775544143;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X(<>((LTLAPp0==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-16 16:29:39] [INFO ] Applying decomposition
[2022-05-16 16:29:39] [INFO ] Flatten gal took : 12 ms
[2022-05-16 16:29:39] [INFO ] Decomposing Gal with order
[2022-05-16 16:29:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 16:29:39] [INFO ] Removed a total of 17 redundant transitions.
[2022-05-16 16:29:39] [INFO ] Flatten gal took : 31 ms
[2022-05-16 16:29:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 83 labels/synchronizations in 21 ms.
[2022-05-16 16:29:39] [INFO ] Time to serialize gal into /tmp/LTLFireability7185335883894632143.gal : 6 ms
[2022-05-16 16:29:39] [INFO ] Time to serialize properties into /tmp/LTLFireability12957583227610767705.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability7185335883894632143.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12957583227610767705.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 1 LTL properties
Checking formula 0 : !((G(X(F("(i1.i0.i0.i0.i0.i0.u17.p41==0)")))))
Formula 0 simplified : !GXF"(i1.i0.i0.i0.i0.i0.u17.p41==0)"
Reverse transition relation is NOT exact ! Due to transitions t145, i0.t0, i1.i0.i0.i0.u19.t111, i1.i0.i0.i0.i0.u18.t114, i1.i0.i0.i0.i0.u18.t116, i1.i0.i0...1816
Detected timeout of ITS tools.
[2022-05-16 16:50:24] [INFO ] Flatten gal took : 2361 ms
[2022-05-16 16:50:25] [INFO ] Input system was already deterministic with 198 transitions.
[2022-05-16 16:50:26] [INFO ] Transformed 252 places.
[2022-05-16 16:50:26] [INFO ] Transformed 198 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-16 16:50:26] [INFO ] Time to serialize gal into /tmp/LTLFireability6653664917140794247.gal : 16 ms
[2022-05-16 16:50:26] [INFO ] Time to serialize properties into /tmp/LTLFireability3628771534568028481.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6653664917140794247.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3628771534568028481.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...333
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(X(F("(p41==0)")))))
Formula 0 simplified : !GXF"(p41==0)"
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t9, t10, t17, t24, t26, t35, t38, t49, t51, t52, t53, t54, t55, t56, t57, t58, t59, t...455
Computing Next relation with stutter on 339888 deadlock states

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DES-PT-02b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is DES-PT-02b, 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 r042-smll-165252095700428"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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