Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r219-smll-171649598200223.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is IBMB2S565S3960-PT-none, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r219-smll-171649598200223
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 572K
-rw-r--r-- 1 mcc users 10K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.2K Apr 22 14:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K May 19 07:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 19 18:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 03:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 86K Apr 12 03:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 12 03:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 12 03:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 127K May 18 16:42 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 IBMB2S565S3960-PT-none-LTLFireability-00
FORMULA_NAME IBMB2S565S3960-PT-none-LTLFireability-01
FORMULA_NAME IBMB2S565S3960-PT-none-LTLFireability-02
FORMULA_NAME IBMB2S565S3960-PT-none-LTLFireability-03
FORMULA_NAME IBMB2S565S3960-PT-none-LTLFireability-04
FORMULA_NAME IBMB2S565S3960-PT-none-LTLFireability-05
FORMULA_NAME IBMB2S565S3960-PT-none-LTLFireability-06
FORMULA_NAME IBMB2S565S3960-PT-none-LTLFireability-07
FORMULA_NAME IBMB2S565S3960-PT-none-LTLFireability-08
FORMULA_NAME IBMB2S565S3960-PT-none-LTLFireability-09
FORMULA_NAME IBMB2S565S3960-PT-none-LTLFireability-10
FORMULA_NAME IBMB2S565S3960-PT-none-LTLFireability-11
FORMULA_NAME IBMB2S565S3960-PT-none-LTLFireability-12
FORMULA_NAME IBMB2S565S3960-PT-none-LTLFireability-13
FORMULA_NAME IBMB2S565S3960-PT-none-LTLFireability-14
FORMULA_NAME IBMB2S565S3960-PT-none-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716715695776

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=IBMB2S565S3960-PT-none
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-26 09:28:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-26 09:28:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 09:28:19] [INFO ] Load time of PNML (sax parser for PT used): 115 ms
[2024-05-26 09:28:19] [INFO ] Transformed 273 places.
[2024-05-26 09:28:19] [INFO ] Transformed 179 transitions.
[2024-05-26 09:28:19] [INFO ] Parsed PT model containing 273 places and 179 transitions and 572 arcs in 270 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBMB2S565S3960-PT-none-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBMB2S565S3960-PT-none-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBMB2S565S3960-PT-none-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 179/179 transitions.
Ensure Unique test removed 82 places
Reduce places removed 92 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 93 rules applied. Total rules applied 93 place count 181 transition count 178
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 110 place count 164 transition count 161
Iterating global reduction 1 with 17 rules applied. Total rules applied 127 place count 164 transition count 161
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 129 place count 162 transition count 159
Iterating global reduction 1 with 2 rules applied. Total rules applied 131 place count 162 transition count 159
Applied a total of 131 rules in 91 ms. Remains 162 /273 variables (removed 111) and now considering 159/179 (removed 20) transitions.
// Phase 1: matrix 159 rows 162 cols
[2024-05-26 09:28:20] [INFO ] Computed 15 invariants in 21 ms
[2024-05-26 09:28:20] [INFO ] Implicit Places using invariants in 372 ms returned [129]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 435 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 161/273 places, 159/179 transitions.
Applied a total of 0 rules in 24 ms. Remains 161 /161 variables (removed 0) and now considering 159/159 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 551 ms. Remains : 161/273 places, 159/179 transitions.
Support contains 42 out of 161 places after structural reductions.
[2024-05-26 09:28:20] [INFO ] Flatten gal took : 76 ms
[2024-05-26 09:28:20] [INFO ] Flatten gal took : 28 ms
[2024-05-26 09:28:20] [INFO ] Input system was already deterministic with 159 transitions.
Support contains 40 out of 161 places (down from 42) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 42 resets, run finished after 797 ms. (steps per millisecond=12 ) properties (out of 28) seen :17
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 11) seen :7
Running SMT prover for 4 properties.
// Phase 1: matrix 159 rows 161 cols
[2024-05-26 09:28:22] [INFO ] Computed 14 invariants in 4 ms
[2024-05-26 09:28:22] [INFO ] [Real]Absence check using 0 positive and 14 generalized place invariants in 6 ms returned sat
[2024-05-26 09:28:22] [INFO ] After 308ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-26 09:28:22] [INFO ] [Nat]Absence check using 0 positive and 14 generalized place invariants in 6 ms returned sat
[2024-05-26 09:28:22] [INFO ] After 218ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-26 09:28:23] [INFO ] After 364ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 83 ms.
[2024-05-26 09:28:23] [INFO ] After 578ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Finished Parikh walk after 126 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=63 )
Parikh walk visited 4 properties in 39 ms.
Computed a total of 67 stabilizing places and 69 stable transitions
Graph (complete) has 198 edges and 161 vertex of which 108 are kept as prefixes of interest. Removing 53 places using SCC suffix rule.10 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||G(p1)||F(p2))))'
Support contains 5 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 159/159 transitions.
Ensure Unique test removed 7 places
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 154 transition count 159
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 13 place count 148 transition count 153
Iterating global reduction 1 with 6 rules applied. Total rules applied 19 place count 148 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 148 transition count 152
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 147 transition count 151
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 147 transition count 151
Applied a total of 22 rules in 32 ms. Remains 147 /161 variables (removed 14) and now considering 151/159 (removed 8) transitions.
// Phase 1: matrix 151 rows 147 cols
[2024-05-26 09:28:23] [INFO ] Computed 7 invariants in 4 ms
[2024-05-26 09:28:24] [INFO ] Implicit Places using invariants in 111 ms returned [136]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 113 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 146/161 places, 151/159 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 145 transition count 150
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 145 transition count 150
Applied a total of 2 rules in 12 ms. Remains 145 /146 variables (removed 1) and now considering 150/151 (removed 1) transitions.
// Phase 1: matrix 150 rows 145 cols
[2024-05-26 09:28:24] [INFO ] Computed 6 invariants in 3 ms
[2024-05-26 09:28:24] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-26 09:28:24] [INFO ] Invariant cache hit.
[2024-05-26 09:28:24] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 145/161 places, 150/159 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 473 ms. Remains : 145/161 places, 150/159 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 628 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=4 dest: 3}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (LT s76 1) (LT s77 1)), p2:(OR (LT s8 1) (LT s9 1)), p0:(GEQ s42 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 474 reset in 582 ms.
Product exploration explored 100000 steps with 480 reset in 329 ms.
Computed a total of 61 stabilizing places and 65 stable transitions
Graph (complete) has 172 edges and 145 vertex of which 98 are kept as prefixes of interest. Removing 47 places using SCC suffix rule.6 ms
Computed a total of 61 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 124 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
Incomplete random walk after 10005 steps, including 44 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-26 09:28:26] [INFO ] Invariant cache hit.
[2024-05-26 09:28:26] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 13 ms returned sat
[2024-05-26 09:28:26] [INFO ] After 137ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2024-05-26 09:28:26] [INFO ] After 169ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-26 09:28:26] [INFO ] After 291ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-26 09:28:26] [INFO ] [Nat]Absence check using 0 positive and 6 generalized place invariants in 4 ms returned sat
[2024-05-26 09:28:27] [INFO ] After 149ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-26 09:28:27] [INFO ] After 257ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 52 ms.
[2024-05-26 09:28:27] [INFO ] After 419ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Finished Parikh walk after 978 steps, including 1 resets, run visited all 4 properties in 20 ms. (steps per millisecond=48 )
Parikh walk visited 4 properties in 24 ms.
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X p2))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2) p1)), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (AND p0 (NOT p2) (NOT p1))), (F (NOT p2)), (F (AND (NOT p2) (NOT p1))), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p2) p1)), (F (AND p0 (NOT p2) p1))]
Knowledge based reduction with 7 factoid took 563 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 269 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
Stuttering acceptance computed with spot in 267 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
Support contains 5 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 150/150 transitions.
Applied a total of 0 rules in 5 ms. Remains 145 /145 variables (removed 0) and now considering 150/150 (removed 0) transitions.
[2024-05-26 09:28:28] [INFO ] Invariant cache hit.
[2024-05-26 09:28:28] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-26 09:28:28] [INFO ] Invariant cache hit.
[2024-05-26 09:28:28] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
[2024-05-26 09:28:28] [INFO ] Invariant cache hit.
[2024-05-26 09:28:28] [INFO ] Dead Transitions using invariants and state equation in 188 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 483 ms. Remains : 145/145 places, 150/150 transitions.
Computed a total of 61 stabilizing places and 65 stable transitions
Graph (complete) has 172 edges and 145 vertex of which 98 are kept as prefixes of interest. Removing 47 places using SCC suffix rule.10 ms
Computed a total of 61 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 184 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 346 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 40 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-26 09:28:29] [INFO ] Invariant cache hit.
[2024-05-26 09:28:29] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 4 ms returned sat
[2024-05-26 09:28:30] [INFO ] After 129ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2024-05-26 09:28:30] [INFO ] After 161ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-26 09:28:30] [INFO ] After 258ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-26 09:28:30] [INFO ] [Nat]Absence check using 0 positive and 6 generalized place invariants in 3 ms returned sat
[2024-05-26 09:28:30] [INFO ] After 143ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-26 09:28:30] [INFO ] After 251ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 51 ms.
[2024-05-26 09:28:30] [INFO ] After 402ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Finished Parikh walk after 928 steps, including 1 resets, run visited all 4 properties in 28 ms. (steps per millisecond=33 )
Parikh walk visited 4 properties in 27 ms.
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X p2))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2) p1)), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (AND p0 (NOT p2) (NOT p1))), (F (NOT p2)), (F (AND (NOT p2) (NOT p1))), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p2) p1)), (F (AND p0 (NOT p2) p1))]
Knowledge based reduction with 7 factoid took 549 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 263 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
Stuttering acceptance computed with spot in 259 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
Stuttering acceptance computed with spot in 268 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
Product exploration explored 100000 steps with 477 reset in 235 ms.
Product exploration explored 100000 steps with 482 reset in 343 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
Support contains 5 out of 145 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 145/145 places, 150/150 transitions.
Graph (trivial) has 126 edges and 145 vertex of which 18 / 145 are part of one of the 1 SCC in 3 ms
Free SCC test removed 17 places
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Graph (complete) has 153 edges and 128 vertex of which 97 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.1 ms
Discarding 31 places :
Also discarding 27 output transitions
Drop transitions removed 27 transitions
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 38 rules applied. Total rules applied 40 place count 97 transition count 104
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 15 Pre rules applied. Total rules applied 40 place count 97 transition count 105
Deduced a syphon composed of 53 places in 1 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 55 place count 97 transition count 105
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 78 place count 74 transition count 82
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 101 place count 74 transition count 82
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 44 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 115 place count 74 transition count 84
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 131 place count 58 transition count 68
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 147 place count 58 transition count 68
Performed 9 Post agglomeration using F-continuation condition with reduction of 17 identical transitions.
Deduced a syphon composed of 37 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 156 place count 58 transition count 100
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 161 place count 58 transition count 95
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 174 place count 45 transition count 67
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 2 with 13 rules applied. Total rules applied 187 place count 45 transition count 67
Deduced a syphon composed of 24 places in 0 ms
Applied a total of 187 rules in 39 ms. Remains 45 /145 variables (removed 100) and now considering 67/150 (removed 83) transitions.
[2024-05-26 09:28:33] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 67 rows 45 cols
[2024-05-26 09:28:33] [INFO ] Computed 3 invariants in 1 ms
[2024-05-26 09:28:33] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/145 places, 67/150 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 119 ms. Remains : 45/145 places, 67/150 transitions.
Built C files in :
/tmp/ltsmin8616545292034501841
[2024-05-26 09:28:33] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8616545292034501841
Running compilation step : cd /tmp/ltsmin8616545292034501841;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 477 ms.
Running link step : cd /tmp/ltsmin8616545292034501841;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin8616545292034501841;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17479461053373576140.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 150/150 transitions.
Applied a total of 0 rules in 2 ms. Remains 145 /145 variables (removed 0) and now considering 150/150 (removed 0) transitions.
// Phase 1: matrix 150 rows 145 cols
[2024-05-26 09:28:48] [INFO ] Computed 6 invariants in 2 ms
[2024-05-26 09:28:48] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-26 09:28:48] [INFO ] Invariant cache hit.
[2024-05-26 09:28:48] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
[2024-05-26 09:28:48] [INFO ] Invariant cache hit.
[2024-05-26 09:28:48] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 292 ms. Remains : 145/145 places, 150/150 transitions.
Built C files in :
/tmp/ltsmin10888484638039990862
[2024-05-26 09:28:48] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10888484638039990862
Running compilation step : cd /tmp/ltsmin10888484638039990862;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 395 ms.
Running link step : cd /tmp/ltsmin10888484638039990862;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin10888484638039990862;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9373382066767604324.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-26 09:29:03] [INFO ] Flatten gal took : 12 ms
[2024-05-26 09:29:03] [INFO ] Flatten gal took : 12 ms
[2024-05-26 09:29:03] [INFO ] Time to serialize gal into /tmp/LTL11999846197758364656.gal : 5 ms
[2024-05-26 09:29:03] [INFO ] Time to serialize properties into /tmp/LTL7172938989070529623.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11999846197758364656.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7686212571936599735.hoa' '-atoms' '/tmp/LTL7172938989070529623.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL7172938989070529623.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7686212571936599735.hoa
Detected timeout of ITS tools.
[2024-05-26 09:29:18] [INFO ] Flatten gal took : 9 ms
[2024-05-26 09:29:18] [INFO ] Flatten gal took : 9 ms
[2024-05-26 09:29:18] [INFO ] Time to serialize gal into /tmp/LTL17881793320591705639.gal : 3 ms
[2024-05-26 09:29:18] [INFO ] Time to serialize properties into /tmp/LTL17378487310877260360.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17881793320591705639.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17378487310877260360.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(((X("(callToTask.s00003964.inputCriterion.s00001053.used>=1)"))||(G("((callToTask.s00003979.output.s00001054<1)||(callToTask.s000...289
Formula 0 simplified : F(X!"(callToTask.s00003964.inputCriterion.s00001053.used>=1)" & F!"((callToTask.s00003979.output.s00001054<1)||(callToTask.s00003979...277
Detected timeout of ITS tools.
[2024-05-26 09:29:33] [INFO ] Flatten gal took : 8 ms
[2024-05-26 09:29:33] [INFO ] Applying decomposition
[2024-05-26 09:29:33] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph12809590190415420039.txt' '-o' '/tmp/graph12809590190415420039.bin' '-w' '/tmp/graph12809590190415420039.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12809590190415420039.bin' '-l' '-1' '-v' '-w' '/tmp/graph12809590190415420039.weights' '-q' '0' '-e' '0.001'
[2024-05-26 09:29:33] [INFO ] Decomposing Gal with order
[2024-05-26 09:29:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 09:29:34] [INFO ] Removed a total of 13 redundant transitions.
[2024-05-26 09:29:34] [INFO ] Flatten gal took : 56 ms
[2024-05-26 09:29:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-26 09:29:34] [INFO ] Time to serialize gal into /tmp/LTL2705361564710626423.gal : 5 ms
[2024-05-26 09:29:34] [INFO ] Time to serialize properties into /tmp/LTL18153958133408081032.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2705361564710626423.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18153958133408081032.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(((X("(i0.u21.callToTask.s00003964.inputCriterion.s00001053.used>=1)"))||(G("((i7.u36.callToTask.s00003979.output.s00001054<1)||(i...328
Formula 0 simplified : F(X!"(i0.u21.callToTask.s00003964.inputCriterion.s00001053.used>=1)" & F!"((i7.u36.callToTask.s00003979.output.s00001054<1)||(i7.u36...316
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13315413958148951314
[2024-05-26 09:29:49] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13315413958148951314
Running compilation step : cd /tmp/ltsmin13315413958148951314;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 316 ms.
Running link step : cd /tmp/ltsmin13315413958148951314;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin13315413958148951314;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X((LTLAPp0==true))||[]((LTLAPp1==true))||<>((LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-00 finished in 100444 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((F((G(p0)&&X(!p1)))&&G(!p2))||G((F(G(p0))&&F(!p1))))))'
Support contains 4 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 159/159 transitions.
Ensure Unique test removed 8 places
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 153 transition count 159
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 14 place count 147 transition count 153
Iterating global reduction 1 with 6 rules applied. Total rules applied 20 place count 147 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 21 place count 147 transition count 152
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 23 place count 145 transition count 150
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 145 transition count 150
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 144 transition count 149
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 144 transition count 149
Applied a total of 27 rules in 12 ms. Remains 144 /161 variables (removed 17) and now considering 149/159 (removed 10) transitions.
// Phase 1: matrix 149 rows 144 cols
[2024-05-26 09:30:04] [INFO ] Computed 6 invariants in 1 ms
[2024-05-26 09:30:04] [INFO ] Implicit Places using invariants in 57 ms returned [133]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 58 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 143/161 places, 149/159 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 142 transition count 148
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 142 transition count 148
Applied a total of 2 rules in 8 ms. Remains 142 /143 variables (removed 1) and now considering 148/149 (removed 1) transitions.
// Phase 1: matrix 148 rows 142 cols
[2024-05-26 09:30:04] [INFO ] Computed 5 invariants in 1 ms
[2024-05-26 09:30:04] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-26 09:30:04] [INFO ] Invariant cache hit.
[2024-05-26 09:30:04] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 142/161 places, 148/159 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 250 ms. Remains : 142/161 places, 148/159 transitions.
Stuttering acceptance computed with spot in 365 ms :[(OR (NOT p0) p1), (NOT p0), p1, (OR (AND (NOT p0) p2) (AND p1 p2)), p1, (AND (NOT p0) p1), (AND p1 p0)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}, { cond=p1, acceptance={} source=0 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 5}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=0 dest: 6}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 4}, { cond=p0, acceptance={} source=2 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=p2, acceptance={} source=3 dest: 0}, { cond=(NOT p2), acceptance={} source=3 dest: 3}, { cond=(AND p1 p2), acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}], [{ cond=(AND p0 p1), acceptance={} source=6 dest: 4}]], initial=0, aps=[p2:(OR (GEQ s55 1) (GEQ s90 1)), p0:(LT s55 1), p1:(AND (GEQ s52 1) (GEQ s53 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]]
Product exploration explored 100000 steps with 633 reset in 334 ms.
Product exploration explored 100000 steps with 648 reset in 392 ms.
Computed a total of 62 stabilizing places and 65 stable transitions
Graph (complete) has 166 edges and 142 vertex of which 98 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.4 ms
Computed a total of 62 stabilizing places and 65 stable transitions
Detected a total of 62/142 stabilizing places and 65/148 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (OR (NOT p0) (NOT p2))), (X (NOT (AND p1 p2))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (AND p0 (NOT p1) (NOT p2))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (OR (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 p2)))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1))), (X (X (AND p0 (NOT p1) (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 24 factoid took 883 ms. Reduced automaton from 7 states, 21 edges and 3 AP (stutter sensitive) to 7 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 405 ms :[(OR (NOT p0) p1), (NOT p0), p1, (OR (AND (NOT p0) p2) (AND p1 p2)), p1, (AND (NOT p0) p1), (AND p1 p0)]
Incomplete random walk after 10001 steps, including 43 resets, run finished after 203 ms. (steps per millisecond=49 ) properties (out of 11) seen :8
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2024-05-26 09:30:07] [INFO ] Invariant cache hit.
[2024-05-26 09:30:07] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (OR (NOT p0) (NOT p2))), (X (NOT (AND p1 p2))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (AND p0 (NOT p1) (NOT p2))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (OR (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 p2)))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1))), (X (X (AND p0 (NOT p1) (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p2)))), (F p1), (F (NOT p0)), (F (NOT (AND p0 (NOT p2) (NOT p1)))), (F p2), (F (NOT (OR (NOT p0) (NOT p2)))), (F (AND p2 p1)), (F (AND p0 p1)), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 25 factoid took 4549 ms. Reduced automaton from 7 states, 21 edges and 3 AP (stutter sensitive) to 5 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p0) p1), (NOT p0), (OR (AND (NOT p0) p2) (AND p1 p2)), p1, (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p0) p1), (NOT p0), (OR (AND (NOT p0) p2) (AND p1 p2)), p1, (AND p1 (NOT p2))]
Support contains 4 out of 142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 142/142 places, 148/148 transitions.
Applied a total of 0 rules in 3 ms. Remains 142 /142 variables (removed 0) and now considering 148/148 (removed 0) transitions.
[2024-05-26 09:30:12] [INFO ] Invariant cache hit.
[2024-05-26 09:30:12] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-26 09:30:12] [INFO ] Invariant cache hit.
[2024-05-26 09:30:12] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
[2024-05-26 09:30:12] [INFO ] Invariant cache hit.
[2024-05-26 09:30:12] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 314 ms. Remains : 142/142 places, 148/148 transitions.
Computed a total of 62 stabilizing places and 65 stable transitions
Graph (complete) has 166 edges and 142 vertex of which 98 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.2 ms
Computed a total of 62 stabilizing places and 65 stable transitions
Detected a total of 62/142 stabilizing places and 65/148 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT p2)), (X (OR (NOT p0) (NOT p2))), (X (NOT (AND p2 p1))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) p1))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (OR (NOT p0) (NOT p2)))), (X (X (NOT (AND p2 p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 290 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 5 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[(OR (NOT p0) p1), (NOT p0), (OR (AND (NOT p0) p2) (AND p1 p2)), p1, (AND p1 (NOT p2))]
Incomplete random walk after 10004 steps, including 44 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 7) seen :5
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-26 09:30:13] [INFO ] Invariant cache hit.
[2024-05-26 09:30:13] [INFO ] [Real]Absence check using 0 positive and 5 generalized place invariants in 3 ms returned sat
[2024-05-26 09:30:13] [INFO ] After 84ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-26 09:30:13] [INFO ] After 101ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2024-05-26 09:30:13] [INFO ] After 161ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 09:30:13] [INFO ] [Nat]Absence check using 0 positive and 5 generalized place invariants in 2 ms returned sat
[2024-05-26 09:30:13] [INFO ] After 73ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-26 09:30:13] [INFO ] After 89ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2024-05-26 09:30:13] [INFO ] After 147ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 82 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=82 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT p2)), (X (OR (NOT p0) (NOT p2))), (X (NOT (AND p2 p1))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) p1))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (OR (NOT p0) (NOT p2)))), (X (X (NOT (AND p2 p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND (NOT p2) (NOT p1)))), (F (AND (NOT p2) p1)), (F (AND p2 p1)), (F p2), (F p1), (F (NOT (OR (NOT p0) (NOT p2))))]
Knowledge based reduction with 16 factoid took 910 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 5 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p0) p1), (NOT p0), (OR (AND (NOT p0) p2) (AND p1 p2)), p1, (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p0) p1), (NOT p0), (OR (AND (NOT p0) p2) (AND p1 p2)), p1, (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p0) p1), (NOT p0), (OR (AND (NOT p0) p2) (AND p1 p2)), p1, (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 686 reset in 119 ms.
Product exploration explored 100000 steps with 720 reset in 542 ms.
Applying partial POR strategy [false, true, false, true, true]
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p0) p1), (NOT p0), (OR (AND (NOT p0) p2) (AND p1 p2)), p1, (AND p1 (NOT p2))]
Support contains 4 out of 142 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 142/142 places, 148/148 transitions.
Graph (trivial) has 121 edges and 142 vertex of which 18 / 142 are part of one of the 1 SCC in 0 ms
Free SCC test removed 17 places
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Graph (complete) has 147 edges and 125 vertex of which 81 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.1 ms
Discarding 44 places :
Also discarding 40 output transitions
Drop transitions removed 40 transitions
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 32 rules applied. Total rules applied 34 place count 81 transition count 89
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 13 Pre rules applied. Total rules applied 34 place count 81 transition count 89
Deduced a syphon composed of 45 places in 0 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 47 place count 81 transition count 89
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 70 place count 58 transition count 65
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 93 place count 58 transition count 65
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 94 place count 57 transition count 64
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 95 place count 57 transition count 64
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 33 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 106 place count 57 transition count 65
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 117 place count 46 transition count 54
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 128 place count 46 transition count 54
Performed 6 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 134 place count 46 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 135 place count 46 transition count 76
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 142 place count 39 transition count 59
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 2 with 7 rules applied. Total rules applied 149 place count 39 transition count 59
Deduced a syphon composed of 21 places in 0 ms
Applied a total of 149 rules in 22 ms. Remains 39 /142 variables (removed 103) and now considering 59/148 (removed 89) transitions.
[2024-05-26 09:30:15] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 59 rows 39 cols
[2024-05-26 09:30:15] [INFO ] Computed 2 invariants in 1 ms
[2024-05-26 09:30:16] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 39/142 places, 59/148 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 79 ms. Remains : 39/142 places, 59/148 transitions.
Built C files in :
/tmp/ltsmin6396074639681268616
[2024-05-26 09:30:16] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6396074639681268616
Running compilation step : cd /tmp/ltsmin6396074639681268616;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 413 ms.
Running link step : cd /tmp/ltsmin6396074639681268616;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin6396074639681268616;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased18040558222418660764.hoa' '--buchi-type=spotba'
LTSmin run took 867 ms.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-02 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-02 finished in 13156 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0&&F(!p0)) U (p0&&F(!p0)&&X(X(!p1))))))'
Support contains 3 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 159/159 transitions.
Ensure Unique test removed 8 places
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 153 transition count 159
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 13 place count 148 transition count 154
Iterating global reduction 1 with 5 rules applied. Total rules applied 18 place count 148 transition count 154
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 146 transition count 152
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 146 transition count 152
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 145 transition count 151
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 145 transition count 151
Applied a total of 24 rules in 11 ms. Remains 145 /161 variables (removed 16) and now considering 151/159 (removed 8) transitions.
// Phase 1: matrix 151 rows 145 cols
[2024-05-26 09:30:17] [INFO ] Computed 6 invariants in 1 ms
[2024-05-26 09:30:17] [INFO ] Implicit Places using invariants in 60 ms returned [133]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 61 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 144/161 places, 151/159 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 143 transition count 150
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 143 transition count 150
Applied a total of 2 rules in 6 ms. Remains 143 /144 variables (removed 1) and now considering 150/151 (removed 1) transitions.
// Phase 1: matrix 150 rows 143 cols
[2024-05-26 09:30:17] [INFO ] Computed 5 invariants in 1 ms
[2024-05-26 09:30:17] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-26 09:30:17] [INFO ] Invariant cache hit.
[2024-05-26 09:30:17] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 143/161 places, 150/159 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 268 ms. Remains : 143/161 places, 150/159 transitions.
Stuttering acceptance computed with spot in 327 ms :[p1, p0, (OR p0 p1), (OR p1 p0), true, true, true]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 6}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 2}], [{ cond=p0, acceptance={} source=4 dest: 3}, { cond=(NOT p0), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=5, aps=[p1:(AND (GEQ s132 1) (GEQ s134 1)), p0:(GEQ s89 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, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-04 finished in 615 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||G(p1))))'
Support contains 4 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 159/159 transitions.
Ensure Unique test removed 9 places
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 152 transition count 159
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 15 place count 146 transition count 153
Iterating global reduction 1 with 6 rules applied. Total rules applied 21 place count 146 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 22 place count 146 transition count 152
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 24 place count 144 transition count 150
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 144 transition count 150
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 143 transition count 149
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 143 transition count 149
Applied a total of 28 rules in 20 ms. Remains 143 /161 variables (removed 18) and now considering 149/159 (removed 10) transitions.
// Phase 1: matrix 149 rows 143 cols
[2024-05-26 09:30:18] [INFO ] Computed 5 invariants in 2 ms
[2024-05-26 09:30:18] [INFO ] Implicit Places using invariants in 71 ms returned [132]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 75 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 142/161 places, 149/159 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 141 transition count 148
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 141 transition count 148
Applied a total of 2 rules in 5 ms. Remains 141 /142 variables (removed 1) and now considering 148/149 (removed 1) transitions.
// Phase 1: matrix 148 rows 141 cols
[2024-05-26 09:30:18] [INFO ] Computed 4 invariants in 3 ms
[2024-05-26 09:30:18] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-26 09:30:18] [INFO ] Invariant cache hit.
[2024-05-26 09:30:18] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 141/161 places, 148/159 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 361 ms. Remains : 141/161 places, 148/159 transitions.
Stuttering acceptance computed with spot in 223 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(LT s133 1), p0:(OR (LT s112 1) (LT s113 1) (LT s114 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3277 steps with 15 reset in 14 ms.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-05 finished in 621 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0&&(F(p1) U G(p2))))))'
Support contains 4 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 159/159 transitions.
Graph (trivial) has 121 edges and 161 vertex of which 19 / 161 are part of one of the 1 SCC in 1 ms
Free SCC test removed 18 places
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Graph (complete) has 179 edges and 143 vertex of which 106 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.1 ms
Discarding 37 places :
Also discarding 32 output transitions
Drop transitions removed 32 transitions
Ensure Unique test removed 6 places
Reduce places removed 7 places and 1 transitions.
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 56 place count 99 transition count 53
Reduce places removed 54 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 57 rules applied. Total rules applied 113 place count 45 transition count 50
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 115 place count 43 transition count 50
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 115 place count 43 transition count 37
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 141 place count 30 transition count 37
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 142 place count 29 transition count 37
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 143 place count 28 transition count 36
Iterating global reduction 4 with 1 rules applied. Total rules applied 144 place count 28 transition count 36
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 154 place count 23 transition count 31
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 157 place count 23 transition count 28
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 163 place count 20 transition count 33
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 165 place count 20 transition count 31
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 171 place count 20 transition count 25
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 173 place count 19 transition count 24
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 174 place count 18 transition count 23
Ensure Unique test removed 2 places
Iterating post reduction 6 with 2 rules applied. Total rules applied 176 place count 16 transition count 23
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 177 place count 15 transition count 19
Iterating global reduction 7 with 1 rules applied. Total rules applied 178 place count 15 transition count 19
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 179 place count 14 transition count 18
Applied a total of 179 rules in 35 ms. Remains 14 /161 variables (removed 147) and now considering 18/159 (removed 141) transitions.
// Phase 1: matrix 18 rows 14 cols
[2024-05-26 09:30:18] [INFO ] Computed 1 invariants in 1 ms
[2024-05-26 09:30:18] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-26 09:30:18] [INFO ] Invariant cache hit.
[2024-05-26 09:30:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-26 09:30:18] [INFO ] Implicit Places using invariants and state equation in 40 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 73 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/161 places, 18/159 transitions.
Applied a total of 0 rules in 4 ms. Remains 13 /13 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 112 ms. Remains : 13/161 places, 18/159 transitions.
Stuttering acceptance computed with spot in 373 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1))), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s6 1), p2:(AND (GEQ s3 1) (GEQ s4 1)), p1:(GEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 0 ms.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-06 finished in 514 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 159/159 transitions.
Graph (trivial) has 120 edges and 161 vertex of which 19 / 161 are part of one of the 1 SCC in 1 ms
Free SCC test removed 18 places
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Graph (complete) has 179 edges and 143 vertex of which 90 are kept as prefixes of interest. Removing 53 places using SCC suffix rule.1 ms
Discarding 53 places :
Also discarding 45 output transitions
Drop transitions removed 45 transitions
Ensure Unique test removed 5 places
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 50 place count 85 transition count 47
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 50 rules applied. Total rules applied 100 place count 37 transition count 45
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 101 place count 36 transition count 45
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 101 place count 36 transition count 35
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 121 place count 26 transition count 35
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 122 place count 25 transition count 34
Iterating global reduction 3 with 1 rules applied. Total rules applied 123 place count 25 transition count 34
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 15 rules applied. Total rules applied 138 place count 17 transition count 27
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 142 place count 17 transition count 23
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 144 place count 16 transition count 22
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 148 place count 14 transition count 23
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 150 place count 14 transition count 21
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 151 place count 14 transition count 20
Applied a total of 151 rules in 22 ms. Remains 14 /161 variables (removed 147) and now considering 20/159 (removed 139) transitions.
// Phase 1: matrix 20 rows 14 cols
[2024-05-26 09:30:19] [INFO ] Computed 1 invariants in 1 ms
[2024-05-26 09:30:19] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-26 09:30:19] [INFO ] Invariant cache hit.
[2024-05-26 09:30:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-26 09:30:19] [INFO ] Implicit Places using invariants and state equation in 45 ms returned [5]
Discarding 1 places :
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 81 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/161 places, 19/159 transitions.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 13 transition count 18
Applied a total of 1 rules in 2 ms. Remains 13 /13 variables (removed 0) and now considering 18/19 (removed 1) transitions.
// Phase 1: matrix 18 rows 13 cols
[2024-05-26 09:30:19] [INFO ] Computed 1 invariants in 0 ms
[2024-05-26 09:30:19] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-26 09:30:19] [INFO ] Invariant cache hit.
[2024-05-26 09:30:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-26 09:30:19] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 13/161 places, 18/159 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 180 ms. Remains : 13/161 places, 18/159 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s4 1) (AND (GEQ s10 1) (GEQ s11 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 85 steps with 3 reset in 1 ms.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-07 finished in 299 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 159/159 transitions.
Graph (trivial) has 124 edges and 161 vertex of which 19 / 161 are part of one of the 1 SCC in 1 ms
Free SCC test removed 18 places
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Graph (complete) has 179 edges and 143 vertex of which 90 are kept as prefixes of interest. Removing 53 places using SCC suffix rule.1 ms
Discarding 53 places :
Also discarding 45 output transitions
Drop transitions removed 45 transitions
Ensure Unique test removed 3 places
Reduce places removed 4 places and 1 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 51 place count 86 transition count 45
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 100 place count 37 transition count 45
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 100 place count 37 transition count 34
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 122 place count 26 transition count 34
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 123 place count 25 transition count 33
Iterating global reduction 2 with 1 rules applied. Total rules applied 124 place count 25 transition count 33
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 136 place count 19 transition count 27
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 139 place count 19 transition count 24
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 145 place count 16 transition count 34
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 148 place count 16 transition count 31
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 158 place count 16 transition count 21
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 160 place count 15 transition count 20
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 161 place count 14 transition count 19
Ensure Unique test removed 2 places
Iterating post reduction 4 with 2 rules applied. Total rules applied 163 place count 12 transition count 19
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 164 place count 11 transition count 14
Iterating global reduction 5 with 1 rules applied. Total rules applied 165 place count 11 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 166 place count 10 transition count 13
Applied a total of 166 rules in 29 ms. Remains 10 /161 variables (removed 151) and now considering 13/159 (removed 146) transitions.
// Phase 1: matrix 13 rows 10 cols
[2024-05-26 09:30:19] [INFO ] Computed 2 invariants in 0 ms
[2024-05-26 09:30:19] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-26 09:30:19] [INFO ] Invariant cache hit.
[2024-05-26 09:30:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-26 09:30:19] [INFO ] Implicit Places using invariants and state equation in 39 ms returned [2]
Discarding 1 places :
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 73 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/161 places, 12/159 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 103 ms. Remains : 9/161 places, 12/159 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s5 1) (LT s6 1) (LT s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 357 steps with 22 reset in 2 ms.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-08 finished in 172 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U p1)&&X((p2 U (p3||G(p2)))))))'
Support contains 5 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 159/159 transitions.
Ensure Unique test removed 9 places
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 152 transition count 159
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 15 place count 146 transition count 153
Iterating global reduction 1 with 6 rules applied. Total rules applied 21 place count 146 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 22 place count 146 transition count 152
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 24 place count 144 transition count 150
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 144 transition count 150
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 143 transition count 149
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 143 transition count 149
Applied a total of 28 rules in 9 ms. Remains 143 /161 variables (removed 18) and now considering 149/159 (removed 10) transitions.
// Phase 1: matrix 149 rows 143 cols
[2024-05-26 09:30:19] [INFO ] Computed 5 invariants in 4 ms
[2024-05-26 09:30:19] [INFO ] Implicit Places using invariants in 86 ms returned [132]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 87 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 142/161 places, 149/159 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 141 transition count 148
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 141 transition count 148
Applied a total of 2 rules in 4 ms. Remains 141 /142 variables (removed 1) and now considering 148/149 (removed 1) transitions.
// Phase 1: matrix 148 rows 141 cols
[2024-05-26 09:30:19] [INFO ] Computed 4 invariants in 2 ms
[2024-05-26 09:30:19] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-26 09:30:19] [INFO ] Invariant cache hit.
[2024-05-26 09:30:19] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 141/161 places, 148/159 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 351 ms. Remains : 141/161 places, 148/159 transitions.
Stuttering acceptance computed with spot in 199 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}, { cond=(OR p1 p0), acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p3) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={} source=2 dest: 2}, { cond=(OR (AND p1 (NOT p3) (NOT p2)) (AND p0 (NOT p3) (NOT p2))), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s72 1), p0:(OR (AND (GEQ s15 1) (GEQ s140 1)) (GEQ s51 1)), p3:(AND (OR (GEQ s110 1) (GEQ s51 1)) (LT s110 1)), p2:(LT s110 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 1365 steps with 8 reset in 8 ms.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-09 finished in 586 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 159/159 transitions.
Graph (trivial) has 122 edges and 161 vertex of which 19 / 161 are part of one of the 1 SCC in 1 ms
Free SCC test removed 18 places
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Graph (complete) has 179 edges and 143 vertex of which 92 are kept as prefixes of interest. Removing 51 places using SCC suffix rule.1 ms
Discarding 51 places :
Also discarding 43 output transitions
Drop transitions removed 43 transitions
Ensure Unique test removed 5 places
Reduce places removed 6 places and 1 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 86 transition count 46
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 103 place count 36 transition count 45
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 103 place count 36 transition count 34
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 125 place count 25 transition count 34
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 126 place count 24 transition count 33
Iterating global reduction 2 with 1 rules applied. Total rules applied 127 place count 24 transition count 33
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 139 place count 18 transition count 27
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 142 place count 18 transition count 24
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 148 place count 15 transition count 34
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 3 with 11 rules applied. Total rules applied 159 place count 15 transition count 23
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 161 place count 14 transition count 22
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 162 place count 13 transition count 21
Ensure Unique test removed 2 places
Iterating post reduction 3 with 2 rules applied. Total rules applied 164 place count 11 transition count 21
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 165 place count 10 transition count 16
Iterating global reduction 4 with 1 rules applied. Total rules applied 166 place count 10 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 167 place count 9 transition count 15
Applied a total of 167 rules in 13 ms. Remains 9 /161 variables (removed 152) and now considering 15/159 (removed 144) transitions.
// Phase 1: matrix 15 rows 9 cols
[2024-05-26 09:30:20] [INFO ] Computed 0 invariants in 0 ms
[2024-05-26 09:30:20] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-26 09:30:20] [INFO ] Invariant cache hit.
[2024-05-26 09:30:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-26 09:30:20] [INFO ] Implicit Places using invariants and state equation in 42 ms returned [2]
Discarding 1 places :
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 71 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/161 places, 14/159 transitions.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 13
Applied a total of 1 rules in 2 ms. Remains 8 /8 variables (removed 0) and now considering 13/14 (removed 1) transitions.
// Phase 1: matrix 13 rows 8 cols
[2024-05-26 09:30:20] [INFO ] Computed 0 invariants in 0 ms
[2024-05-26 09:30:20] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-26 09:30:20] [INFO ] Invariant cache hit.
[2024-05-26 09:30:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-26 09:30:20] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/161 places, 13/159 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 150 ms. Remains : 8/161 places, 13/159 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-10 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:(LT s4 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 13 steps with 1 reset in 0 ms.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-10 finished in 268 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U X(G(p1)))))'
Support contains 2 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 159/159 transitions.
Ensure Unique test removed 9 places
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 152 transition count 159
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 14 place count 147 transition count 154
Iterating global reduction 1 with 5 rules applied. Total rules applied 19 place count 147 transition count 154
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 147 transition count 153
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 22 place count 145 transition count 151
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 145 transition count 151
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 144 transition count 150
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 144 transition count 150
Applied a total of 26 rules in 9 ms. Remains 144 /161 variables (removed 17) and now considering 150/159 (removed 9) transitions.
// Phase 1: matrix 150 rows 144 cols
[2024-05-26 09:30:20] [INFO ] Computed 5 invariants in 2 ms
[2024-05-26 09:30:20] [INFO ] Implicit Places using invariants in 91 ms returned [133]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 92 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 143/161 places, 150/159 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 142 transition count 149
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 142 transition count 149
Applied a total of 2 rules in 5 ms. Remains 142 /143 variables (removed 1) and now considering 149/150 (removed 1) transitions.
// Phase 1: matrix 149 rows 142 cols
[2024-05-26 09:30:20] [INFO ] Computed 4 invariants in 2 ms
[2024-05-26 09:30:20] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-26 09:30:20] [INFO ] Invariant cache hit.
[2024-05-26 09:30:20] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 142/161 places, 149/159 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 353 ms. Remains : 142/161 places, 149/159 transitions.
Stuttering acceptance computed with spot in 177 ms :[(NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s86 1) (GEQ s128 1)), p0:(GEQ s86 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-11 finished in 550 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))||G(p1)||(!p0&&F(p2)))))'
Support contains 4 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 159/159 transitions.
Ensure Unique test removed 8 places
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 153 transition count 159
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 12 place count 149 transition count 155
Iterating global reduction 1 with 4 rules applied. Total rules applied 16 place count 149 transition count 155
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 17 place count 149 transition count 154
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 148 transition count 153
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 148 transition count 153
Applied a total of 19 rules in 7 ms. Remains 148 /161 variables (removed 13) and now considering 153/159 (removed 6) transitions.
// Phase 1: matrix 153 rows 148 cols
[2024-05-26 09:30:21] [INFO ] Computed 6 invariants in 6 ms
[2024-05-26 09:30:21] [INFO ] Implicit Places using invariants in 85 ms returned [136]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 86 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 147/161 places, 153/159 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 146 transition count 152
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 146 transition count 152
Applied a total of 2 rules in 4 ms. Remains 146 /147 variables (removed 1) and now considering 152/153 (removed 1) transitions.
// Phase 1: matrix 152 rows 146 cols
[2024-05-26 09:30:21] [INFO ] Computed 5 invariants in 1 ms
[2024-05-26 09:30:21] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-26 09:30:21] [INFO ] Invariant cache hit.
[2024-05-26 09:30:21] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 146/161 places, 152/159 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 362 ms. Remains : 146/161 places, 152/159 transitions.
Stuttering acceptance computed with spot in 489 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p1)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=3 dest: 6}, { cond=(AND p1 p0), acceptance={} source=3 dest: 7}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=6 dest: 6}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=7 dest: 4}, { cond=(AND p1 p0), acceptance={} source=7 dest: 7}, { cond=(AND p1 (NOT p0)), acceptance={} source=7 dest: 9}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=8 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=8 dest: 8}], [{ cond=(NOT p1), acceptance={} source=9 dest: 0}, { cond=p1, acceptance={} source=9 dest: 9}]], initial=2, aps=[p2:(AND (GEQ s42 1) (GEQ s43 1)), p1:(GEQ s136 1), p0:(GEQ s144 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, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 11 steps with 0 reset in 0 ms.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-13 finished in 880 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0 U (G(!p0)||(p1&&X((X(p3)&&p2)))))))'
Support contains 5 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 159/159 transitions.
Ensure Unique test removed 8 places
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 153 transition count 159
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 14 place count 147 transition count 153
Iterating global reduction 1 with 6 rules applied. Total rules applied 20 place count 147 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 21 place count 147 transition count 152
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 23 place count 145 transition count 150
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 145 transition count 150
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 144 transition count 149
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 144 transition count 149
Applied a total of 27 rules in 11 ms. Remains 144 /161 variables (removed 17) and now considering 149/159 (removed 10) transitions.
// Phase 1: matrix 149 rows 144 cols
[2024-05-26 09:30:21] [INFO ] Computed 6 invariants in 1 ms
[2024-05-26 09:30:21] [INFO ] Implicit Places using invariants in 73 ms returned [133]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 74 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 143/161 places, 149/159 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 142 transition count 148
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 142 transition count 148
Applied a total of 2 rules in 3 ms. Remains 142 /143 variables (removed 1) and now considering 148/149 (removed 1) transitions.
// Phase 1: matrix 148 rows 142 cols
[2024-05-26 09:30:21] [INFO ] Computed 5 invariants in 2 ms
[2024-05-26 09:30:22] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-26 09:30:22] [INFO ] Invariant cache hit.
[2024-05-26 09:30:22] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 142/161 places, 148/159 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 343 ms. Remains : 142/161 places, 148/159 transitions.
Stuttering acceptance computed with spot in 515 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2)) (AND p0 (NOT p3))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)) (AND p0 (NOT p3))), (OR (AND p0 (NOT p2)) (AND p0 (NOT p3))), (AND p0 (NOT p3)), (AND p0 (NOT p3)), true, (OR (NOT p2) (NOT p3)), (NOT p3), (NOT p3)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 5}, { cond=(AND p1 p0), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=2 dest: 7}, { cond=(AND p1 p0 p2), acceptance={} source=2 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=3 dest: 5}, { cond=(AND p1 p0 (NOT p3)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p2 (NOT p3)), acceptance={} source=4 dest: 3}, { cond=(AND p1 (NOT p0) p2 (NOT p3)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2) (NOT p3)), acceptance={} source=4 dest: 5}, { cond=(AND p1 p0 (NOT p2) (NOT p3)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p1) p0 p2 (NOT p3)), acceptance={} source=4 dest: 7}, { cond=(AND p1 p0 p2 (NOT p3)), acceptance={} source=4 dest: 8}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 5}, { cond=p2, acceptance={} source=6 dest: 7}], [{ cond=(NOT p3), acceptance={} source=7 dest: 5}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=8 dest: 5}, { cond=(AND p2 (NOT p3)), acceptance={} source=8 dest: 7}]], initial=0, aps=[p1:(GEQ s69 1), p0:(LT s55 1), p2:(AND (GEQ s27 1) (GEQ s28 1)), p3:(AND (GEQ s27 1) (GEQ s28 1) (GEQ s107 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-15 finished in 888 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||G(p1)||F(p2))))'
Found a Lengthening insensitive property : IBMB2S565S3960-PT-none-LTLFireability-00
Stuttering acceptance computed with spot in 267 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
Support contains 5 out of 161 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 161/161 places, 159/159 transitions.
Graph (trivial) has 123 edges and 161 vertex of which 19 / 161 are part of one of the 1 SCC in 0 ms
Free SCC test removed 18 places
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Graph (complete) has 179 edges and 143 vertex of which 107 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.1 ms
Discarding 36 places :
Also discarding 30 output transitions
Drop transitions removed 30 transitions
Ensure Unique test removed 5 places
Reduce places removed 6 places and 1 transitions.
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 56 place count 101 transition count 55
Reduce places removed 54 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 111 place count 47 transition count 54
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 111 place count 47 transition count 40
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 139 place count 33 transition count 40
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 140 place count 32 transition count 39
Iterating global reduction 2 with 1 rules applied. Total rules applied 141 place count 32 transition count 39
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 153 place count 26 transition count 33
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 156 place count 26 transition count 30
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 162 place count 23 transition count 40
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 164 place count 23 transition count 38
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 165 place count 22 transition count 37
Ensure Unique test removed 2 places
Iterating post reduction 4 with 2 rules applied. Total rules applied 167 place count 20 transition count 37
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 168 place count 19 transition count 31
Iterating global reduction 5 with 1 rules applied. Total rules applied 169 place count 19 transition count 31
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 170 place count 18 transition count 30
Applied a total of 170 rules in 19 ms. Remains 18 /161 variables (removed 143) and now considering 30/159 (removed 129) transitions.
// Phase 1: matrix 30 rows 18 cols
[2024-05-26 09:30:23] [INFO ] Computed 2 invariants in 0 ms
[2024-05-26 09:30:23] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-26 09:30:23] [INFO ] Invariant cache hit.
[2024-05-26 09:30:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-26 09:30:23] [INFO ] Implicit Places using invariants and state equation in 54 ms returned [10]
Discarding 1 places :
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Implicit Place search using SMT with State Equation took 89 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 17/161 places, 26/159 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 26/26 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 111 ms. Remains : 17/161 places, 26/159 transitions.
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=4 dest: 3}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (LT s8 1) (LT s9 1)), p2:(OR (LT s1 1) (LT s2 1)), p0:(GEQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 6520 reset in 269 ms.
Product exploration explored 100000 steps with 6460 reset in 362 ms.
Computed a total of 4 stabilizing places and 11 stable transitions
Graph (complete) has 28 edges and 17 vertex of which 10 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Computed a total of 4 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 237 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 270 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 607 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 93 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10000 steps, including 97 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 26 rows 17 cols
[2024-05-26 09:30:24] [INFO ] Computed 2 invariants in 0 ms
[2024-05-26 09:30:24] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 09:30:24] [INFO ] After 17ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2024-05-26 09:30:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-26 09:30:24] [INFO ] After 4ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1 real:2
[2024-05-26 09:30:24] [INFO ] After 9ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:2
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-05-26 09:30:24] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-26 09:30:24] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-26 09:30:24] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-26 09:30:24] [INFO ] After 9ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-26 09:30:24] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 10 ms.
[2024-05-26 09:30:24] [INFO ] After 75ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 27 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=13 )
Parikh walk visited 3 properties in 1 ms.
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X p2))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2) p1)), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (AND p0 (NOT p2) (NOT p1))), (F (NOT p2)), (F (AND (NOT p2) (NOT p1))), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p2) p1)), (F (AND p0 (NOT p2) p1))]
Knowledge based reduction with 7 factoid took 408 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 267 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
Stuttering acceptance computed with spot in 272 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
Support contains 5 out of 17 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 26/26 transitions.
Applied a total of 0 rules in 0 ms. Remains 17 /17 variables (removed 0) and now considering 26/26 (removed 0) transitions.
[2024-05-26 09:30:25] [INFO ] Invariant cache hit.
[2024-05-26 09:30:25] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-26 09:30:25] [INFO ] Invariant cache hit.
[2024-05-26 09:30:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-26 09:30:25] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2024-05-26 09:30:25] [INFO ] Invariant cache hit.
[2024-05-26 09:30:25] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 123 ms. Remains : 17/17 places, 26/26 transitions.
Computed a total of 4 stabilizing places and 11 stable transitions
Graph (complete) has 28 edges and 17 vertex of which 10 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Computed a total of 4 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 173 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 263 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 594 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-26 09:30:26] [INFO ] Invariant cache hit.
[2024-05-26 09:30:26] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2024-05-26 09:30:26] [INFO ] After 16ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-26 09:30:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-26 09:30:26] [INFO ] After 5ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2024-05-26 09:30:26] [INFO ] After 11ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-26 09:30:26] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 26 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=26 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X p2))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2) p1)), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (AND p0 (NOT p2) (NOT p1))), (F (NOT p2)), (F (AND (NOT p2) (NOT p1))), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p2) p1)), (F (AND p0 (NOT p2) p1))]
Knowledge based reduction with 7 factoid took 564 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 271 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
Stuttering acceptance computed with spot in 272 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
Stuttering acceptance computed with spot in 273 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
Product exploration explored 100000 steps with 6538 reset in 180 ms.
Product exploration explored 100000 steps with 6536 reset in 211 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 230 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
Support contains 5 out of 17 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17/17 places, 26/26 transitions.
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 17 transition count 21
Applied a total of 5 rules in 2 ms. Remains 17 /17 variables (removed 0) and now considering 21/26 (removed 5) transitions.
[2024-05-26 09:30:28] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 21 rows 17 cols
[2024-05-26 09:30:28] [INFO ] Computed 2 invariants in 0 ms
[2024-05-26 09:30:28] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/17 places, 21/26 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 57 ms. Remains : 17/17 places, 21/26 transitions.
Built C files in :
/tmp/ltsmin17048449655942081146
[2024-05-26 09:30:28] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17048449655942081146
Running compilation step : cd /tmp/ltsmin17048449655942081146;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 220 ms.
Running link step : cd /tmp/ltsmin17048449655942081146;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin17048449655942081146;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8695683571703150726.hoa' '--buchi-type=spotba'
LTSmin run took 501 ms.
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-00 finished in 6844 ms.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-00 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2024-05-26 09:30:29] [INFO ] Flatten gal took : 8 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 130332 ms.

BK_STOP 1716715830789

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="IBMB2S565S3960-PT-none"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is IBMB2S565S3960-PT-none, 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 r219-smll-171649598200223"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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