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.r285-smll-171654421800008.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 ParamProductionCell-PT-0, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r285-smll-171654421800008
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 20:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Apr 12 20:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 12 20:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 12 20:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 149K May 18 16:43 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 ParamProductionCell-PT-0-LTLFireability-00
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-01
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-02
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-03
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-04
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-05
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-06
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-07
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-08
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-09
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-10
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-11
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-12
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-13
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-14
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716840304412

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=ParamProductionCell-PT-0
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-27 20:05:07] [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-27 20:05:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 20:05:07] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2024-05-27 20:05:07] [INFO ] Transformed 198 places.
[2024-05-27 20:05:07] [INFO ] Transformed 176 transitions.
[2024-05-27 20:05:07] [INFO ] Found NUPN structural information;
[2024-05-27 20:05:07] [INFO ] Parsed PT model containing 198 places and 176 transitions and 730 arcs in 224 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ParamProductionCell-PT-0-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-0-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-0-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 56 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 176/176 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 193 transition count 171
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 193 transition count 171
Applied a total of 10 rules in 44 ms. Remains 193 /198 variables (removed 5) and now considering 171/176 (removed 5) transitions.
// Phase 1: matrix 171 rows 193 cols
[2024-05-27 20:05:07] [INFO ] Computed 49 invariants in 16 ms
[2024-05-27 20:05:08] [INFO ] Implicit Places using invariants in 577 ms returned [15, 16, 18, 24, 31, 35, 42, 47, 59, 64, 65, 79, 99, 118, 119, 165, 166]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 620 ms to find 17 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 176/198 places, 171/176 transitions.
Applied a total of 0 rules in 10 ms. Remains 176 /176 variables (removed 0) and now considering 171/171 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 674 ms. Remains : 176/198 places, 171/176 transitions.
Support contains 56 out of 176 places after structural reductions.
[2024-05-27 20:05:08] [INFO ] Flatten gal took : 64 ms
[2024-05-27 20:05:08] [INFO ] Flatten gal took : 25 ms
[2024-05-27 20:05:08] [INFO ] Input system was already deterministic with 171 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 453 ms. (steps per millisecond=22 ) properties (out of 30) seen :28
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 171 rows 176 cols
[2024-05-27 20:05:09] [INFO ] Computed 32 invariants in 6 ms
[2024-05-27 20:05:09] [INFO ] [Real]Absence check using 20 positive place invariants in 9 ms returned sat
[2024-05-27 20:05:09] [INFO ] [Real]Absence check using 20 positive and 12 generalized place invariants in 5 ms returned sat
[2024-05-27 20:05:09] [INFO ] After 260ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-27 20:05:09] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2024-05-27 20:05:09] [INFO ] [Nat]Absence check using 20 positive and 12 generalized place invariants in 6 ms returned sat
[2024-05-27 20:05:09] [INFO ] After 121ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-27 20:05:09] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-05-27 20:05:09] [INFO ] After 59ms SMT Verify possible using 59 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-27 20:05:09] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 8 ms to minimize.
[2024-05-27 20:05:10] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 1 ms to minimize.
[2024-05-27 20:05:10] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
[2024-05-27 20:05:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 253 ms
[2024-05-27 20:05:10] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
[2024-05-27 20:05:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2024-05-27 20:05:10] [INFO ] After 426ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 34 ms.
[2024-05-27 20:05:10] [INFO ] After 694ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 12 ms.
Support contains 9 out of 176 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 171/171 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 176 transition count 157
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 29 place count 162 transition count 156
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 30 place count 161 transition count 156
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 30 place count 161 transition count 144
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 54 place count 149 transition count 144
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 55 place count 148 transition count 143
Iterating global reduction 3 with 1 rules applied. Total rules applied 56 place count 148 transition count 143
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 100 place count 125 transition count 122
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 100 place count 125 transition count 121
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 103 place count 123 transition count 121
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 105 place count 122 transition count 120
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 109 place count 122 transition count 116
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 113 place count 118 transition count 116
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 115 place count 118 transition count 116
Applied a total of 115 rules in 80 ms. Remains 118 /176 variables (removed 58) and now considering 116/171 (removed 55) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 118/176 places, 116/171 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 116 rows 118 cols
[2024-05-27 20:05:10] [INFO ] Computed 29 invariants in 3 ms
[2024-05-27 20:05:10] [INFO ] [Real]Absence check using 20 positive place invariants in 10 ms returned sat
[2024-05-27 20:05:10] [INFO ] [Real]Absence check using 20 positive and 9 generalized place invariants in 13 ms returned sat
[2024-05-27 20:05:10] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 20:05:10] [INFO ] [Nat]Absence check using 20 positive place invariants in 11 ms returned sat
[2024-05-27 20:05:10] [INFO ] [Nat]Absence check using 20 positive and 9 generalized place invariants in 5 ms returned sat
[2024-05-27 20:05:10] [INFO ] After 70ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-27 20:05:10] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-27 20:05:10] [INFO ] After 27ms SMT Verify possible using 60 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-27 20:05:10] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 1 ms to minimize.
[2024-05-27 20:05:10] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 1 ms to minimize.
[2024-05-27 20:05:10] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 4 ms to minimize.
[2024-05-27 20:05:10] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-05-27 20:05:10] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-27 20:05:11] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2024-05-27 20:05:11] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 344 ms
[2024-05-27 20:05:11] [INFO ] After 383ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2024-05-27 20:05:11] [INFO ] After 534ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 7 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 116/116 transitions.
Applied a total of 0 rules in 6 ms. Remains 118 /118 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 118/118 places, 116/116 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1528 steps, run visited all 1 properties in 27 ms. (steps per millisecond=56 )
Probabilistic random walk after 1528 steps, saw 793 distinct states, run finished after 27 ms. (steps per millisecond=56 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
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((p0||F(p1)))&&X(X((X(F(p1))&&p2)))))'
Support contains 7 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 171/171 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 175 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 175 transition count 170
Applied a total of 2 rules in 11 ms. Remains 175 /176 variables (removed 1) and now considering 170/171 (removed 1) transitions.
// Phase 1: matrix 170 rows 175 cols
[2024-05-27 20:05:11] [INFO ] Computed 32 invariants in 2 ms
[2024-05-27 20:05:11] [INFO ] Implicit Places using invariants in 195 ms returned [16, 35, 39, 62, 67, 88, 100, 101, 103, 144, 145, 147]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 199 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 163/176 places, 170/171 transitions.
Applied a total of 0 rules in 4 ms. Remains 163 /163 variables (removed 0) and now considering 170/170 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 215 ms. Remains : 163/176 places, 170/171 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 425 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0)), (OR (NOT p2) (AND p0 (NOT p1))), (OR (NOT p2) (AND p0 (NOT p1))), true]
Running random walk in product with property : ParamProductionCell-PT-0-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(OR (AND p0 p2) (AND p1 p2)), acceptance={} source=4 dest: 1}, { cond=(NOT p2), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s17 1) (EQ s22 1)), p1:(AND (EQ s80 1) (EQ s81 1) (EQ s88 1)), p2:(AND (EQ s7 1) (EQ s29 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, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 323 steps with 2 reset in 7 ms.
FORMULA ParamProductionCell-PT-0-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-0-LTLFireability-00 finished in 721 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)||G(p1))))'
Support contains 4 out of 176 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 176/176 places, 171/171 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 176 transition count 158
Reduce places removed 13 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 15 rules applied. Total rules applied 28 place count 163 transition count 156
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 30 place count 161 transition count 156
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 30 place count 161 transition count 146
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 50 place count 151 transition count 146
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 98 place count 126 transition count 123
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 98 place count 126 transition count 122
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 101 place count 124 transition count 122
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 103 place count 123 transition count 121
Applied a total of 103 rules in 37 ms. Remains 123 /176 variables (removed 53) and now considering 121/171 (removed 50) transitions.
// Phase 1: matrix 121 rows 123 cols
[2024-05-27 20:05:12] [INFO ] Computed 29 invariants in 2 ms
[2024-05-27 20:05:12] [INFO ] Implicit Places using invariants in 159 ms returned [0, 9, 17, 20, 38, 41, 52, 64, 65, 67, 101, 102, 104]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 161 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 110/176 places, 121/171 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 110 transition count 117
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 106 transition count 116
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 105 transition count 116
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 10 place count 105 transition count 113
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 16 place count 102 transition count 113
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 50 place count 85 transition count 96
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 52 place count 84 transition count 95
Applied a total of 52 rules in 17 ms. Remains 84 /110 variables (removed 26) and now considering 95/121 (removed 26) transitions.
// Phase 1: matrix 95 rows 84 cols
[2024-05-27 20:05:12] [INFO ] Computed 16 invariants in 1 ms
[2024-05-27 20:05:12] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-27 20:05:12] [INFO ] Invariant cache hit.
[2024-05-27 20:05:12] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-27 20:05:12] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 84/176 places, 95/171 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 482 ms. Remains : 84/176 places, 95/171 transitions.
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ParamProductionCell-PT-0-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s15 0) (EQ s18 0)), p1:(OR (NEQ s37 1) (NEQ s68 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 368 ms.
Stack based approach found an accepted trace after 1174 steps with 0 reset with depth 1175 and stack size 593 in 5 ms.
FORMULA ParamProductionCell-PT-0-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-0-LTLFireability-01 finished in 913 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))'
Support contains 4 out of 176 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 176/176 places, 171/171 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 176 transition count 154
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 159 transition count 154
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 34 place count 159 transition count 144
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 54 place count 149 transition count 144
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 148 transition count 143
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 148 transition count 143
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 118 place count 116 transition count 113
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 118 place count 116 transition count 112
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 121 place count 114 transition count 112
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 123 place count 113 transition count 111
Applied a total of 123 rules in 30 ms. Remains 113 /176 variables (removed 63) and now considering 111/171 (removed 60) transitions.
// Phase 1: matrix 111 rows 113 cols
[2024-05-27 20:05:13] [INFO ] Computed 29 invariants in 1 ms
[2024-05-27 20:05:13] [INFO ] Implicit Places using invariants in 143 ms returned [0, 9, 17, 20, 23, 36, 39, 50, 52, 62, 63, 65, 92, 93, 95]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 145 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 98/176 places, 111/171 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 98 transition count 105
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 92 transition count 105
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 12 place count 92 transition count 101
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 20 place count 88 transition count 101
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 22 place count 86 transition count 99
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 86 transition count 99
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 62 place count 67 transition count 80
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 2 with 2 rules applied. Total rules applied 64 place count 66 transition count 79
Applied a total of 64 rules in 17 ms. Remains 66 /98 variables (removed 32) and now considering 79/111 (removed 32) transitions.
// Phase 1: matrix 79 rows 66 cols
[2024-05-27 20:05:13] [INFO ] Computed 14 invariants in 0 ms
[2024-05-27 20:05:13] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-27 20:05:13] [INFO ] Invariant cache hit.
[2024-05-27 20:05:13] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-27 20:05:13] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 66/176 places, 79/171 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 405 ms. Remains : 66/176 places, 79/171 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-0-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s29 1) (EQ s31 1) (OR (NEQ s30 1) (NEQ s35 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 155 reset in 270 ms.
Stack based approach found an accepted trace after 68 steps with 0 reset with depth 69 and stack size 69 in 0 ms.
FORMULA ParamProductionCell-PT-0-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-0-LTLFireability-02 finished in 728 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(((p1 U p2)&&p0))))'
Support contains 6 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 171/171 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 175 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 175 transition count 170
Applied a total of 2 rules in 5 ms. Remains 175 /176 variables (removed 1) and now considering 170/171 (removed 1) transitions.
// Phase 1: matrix 170 rows 175 cols
[2024-05-27 20:05:13] [INFO ] Computed 32 invariants in 2 ms
[2024-05-27 20:05:14] [INFO ] Implicit Places using invariants in 177 ms returned [16, 30, 35, 39, 62, 67, 86, 88, 100, 101, 103, 145, 147]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 179 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 162/176 places, 170/171 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 160 transition count 168
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 160 transition count 168
Applied a total of 4 rules in 5 ms. Remains 160 /162 variables (removed 2) and now considering 168/170 (removed 2) transitions.
// Phase 1: matrix 168 rows 160 cols
[2024-05-27 20:05:14] [INFO ] Computed 19 invariants in 1 ms
[2024-05-27 20:05:14] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-27 20:05:14] [INFO ] Invariant cache hit.
[2024-05-27 20:05:14] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-05-27 20:05:14] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 160/176 places, 168/171 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 540 ms. Remains : 160/176 places, 168/171 transitions.
Stuttering acceptance computed with spot in 182 ms :[(NOT p2), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (OR (NOT p2) (NOT p0))]
Running random walk in product with property : ParamProductionCell-PT-0-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 3}], [{ cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 0}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=4, aps=[p2:(AND (EQ s131 1) (EQ s132 1) (EQ s153 1)), p1:(EQ s99 1), p0:(AND (EQ s13 1) (EQ s69 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-0-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-0-LTLFireability-03 finished in 741 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(F((p1||G(p2))))&&p0)))'
Support contains 7 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 171/171 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 175 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 175 transition count 170
Applied a total of 2 rules in 4 ms. Remains 175 /176 variables (removed 1) and now considering 170/171 (removed 1) transitions.
// Phase 1: matrix 170 rows 175 cols
[2024-05-27 20:05:14] [INFO ] Computed 32 invariants in 9 ms
[2024-05-27 20:05:14] [INFO ] Implicit Places using invariants in 158 ms returned [30, 35, 39, 62, 67, 86, 100, 101, 103, 144, 145, 147]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 160 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 163/176 places, 170/171 transitions.
Applied a total of 0 rules in 2 ms. Remains 163 /163 variables (removed 0) and now considering 170/170 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 166 ms. Remains : 163/176 places, 170/171 transitions.
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : ParamProductionCell-PT-0-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s79 1) (EQ s82 1) (EQ s132 1) (OR (AND (EQ s16 1) (EQ s22 1)) (AND (EQ s21 1) (EQ s29 1)))), p2:(AND (EQ s79 1) (EQ s82 1) (EQ s132 1)), p1:(A...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-0-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-0-LTLFireability-04 finished in 368 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 2 out of 176 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 176/176 places, 171/171 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 176 transition count 154
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 159 transition count 154
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 34 place count 159 transition count 144
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 54 place count 149 transition count 144
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 148 transition count 143
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 148 transition count 143
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 120 place count 115 transition count 112
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 120 place count 115 transition count 111
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 123 place count 113 transition count 111
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 2 with 2 rules applied. Total rules applied 125 place count 112 transition count 110
Applied a total of 125 rules in 25 ms. Remains 112 /176 variables (removed 64) and now considering 110/171 (removed 61) transitions.
// Phase 1: matrix 110 rows 112 cols
[2024-05-27 20:05:15] [INFO ] Computed 29 invariants in 1 ms
[2024-05-27 20:05:15] [INFO ] Implicit Places using invariants in 182 ms returned [0, 9, 17, 20, 23, 36, 39, 50, 51, 61, 62, 64, 91, 92, 94]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 183 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 97/176 places, 110/171 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 97 transition count 105
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 92 transition count 105
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 10 place count 92 transition count 100
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 20 place count 87 transition count 100
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 22 place count 85 transition count 98
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 85 transition count 98
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 60 place count 67 transition count 80
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 2 with 2 rules applied. Total rules applied 62 place count 66 transition count 79
Applied a total of 62 rules in 13 ms. Remains 66 /97 variables (removed 31) and now considering 79/110 (removed 31) transitions.
// Phase 1: matrix 79 rows 66 cols
[2024-05-27 20:05:15] [INFO ] Computed 14 invariants in 0 ms
[2024-05-27 20:05:15] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-27 20:05:15] [INFO ] Invariant cache hit.
[2024-05-27 20:05:15] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-27 20:05:15] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 66/176 places, 79/171 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 465 ms. Remains : 66/176 places, 79/171 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-0-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s55 1) (EQ s57 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 131 ms.
Stack based approach found an accepted trace after 100 steps with 0 reset with depth 101 and stack size 101 in 0 ms.
FORMULA ParamProductionCell-PT-0-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-0-LTLFireability-05 finished in 648 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)))'
Support contains 3 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 171/171 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 175 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 175 transition count 170
Applied a total of 2 rules in 4 ms. Remains 175 /176 variables (removed 1) and now considering 170/171 (removed 1) transitions.
// Phase 1: matrix 170 rows 175 cols
[2024-05-27 20:05:15] [INFO ] Computed 32 invariants in 1 ms
[2024-05-27 20:05:15] [INFO ] Implicit Places using invariants in 214 ms returned [16, 30, 35, 39, 62, 67, 88, 100, 101, 103, 144, 145, 147]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 217 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 162/176 places, 170/171 transitions.
Applied a total of 0 rules in 2 ms. Remains 162 /162 variables (removed 0) and now considering 170/170 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 223 ms. Remains : 162/176 places, 170/171 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-0-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (NEQ s79 1) (NEQ s80 1) (NEQ s147 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 51 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-0-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-0-LTLFireability-06 finished in 324 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(F(p0))))'
Support contains 5 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 171/171 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 175 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 175 transition count 170
Applied a total of 2 rules in 4 ms. Remains 175 /176 variables (removed 1) and now considering 170/171 (removed 1) transitions.
[2024-05-27 20:05:16] [INFO ] Invariant cache hit.
[2024-05-27 20:05:16] [INFO ] Implicit Places using invariants in 233 ms returned [16, 30, 35, 39, 62, 67, 86, 88, 100, 101, 144, 145, 147]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 237 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 162/176 places, 170/171 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 160 transition count 168
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 160 transition count 168
Applied a total of 4 rules in 4 ms. Remains 160 /162 variables (removed 2) and now considering 168/170 (removed 2) transitions.
// Phase 1: matrix 168 rows 160 cols
[2024-05-27 20:05:16] [INFO ] Computed 19 invariants in 2 ms
[2024-05-27 20:05:16] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-27 20:05:16] [INFO ] Invariant cache hit.
[2024-05-27 20:05:16] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-05-27 20:05:16] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 160/176 places, 168/171 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 638 ms. Remains : 160/176 places, 168/171 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-0-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s14 0) (EQ s70 0) (AND (EQ s89 1) (EQ s92 1) (EQ s97 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 209 ms.
Product exploration explored 100000 steps with 33333 reset in 196 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 15 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ParamProductionCell-PT-0-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ParamProductionCell-PT-0-LTLFireability-09 finished in 1189 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)||G((F(p1)&&F(G(p2)))))))'
Support contains 5 out of 176 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 176/176 places, 171/171 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 176 transition count 154
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 159 transition count 154
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 34 place count 159 transition count 145
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 52 place count 150 transition count 145
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 149 transition count 144
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 149 transition count 144
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 116 place count 117 transition count 114
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 116 place count 117 transition count 113
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 119 place count 115 transition count 113
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 2 with 2 rules applied. Total rules applied 121 place count 114 transition count 112
Applied a total of 121 rules in 18 ms. Remains 114 /176 variables (removed 62) and now considering 112/171 (removed 59) transitions.
// Phase 1: matrix 112 rows 114 cols
[2024-05-27 20:05:17] [INFO ] Computed 29 invariants in 1 ms
[2024-05-27 20:05:17] [INFO ] Implicit Places using invariants in 167 ms returned [0, 9, 17, 20, 23, 36, 39, 50, 51, 61, 62, 64, 91]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 168 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/176 places, 112/171 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 101 transition count 109
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 98 transition count 109
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 6 place count 98 transition count 104
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 16 place count 93 transition count 104
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 18 place count 91 transition count 102
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 91 transition count 102
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 46 place count 78 transition count 89
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 2 with 2 rules applied. Total rules applied 48 place count 77 transition count 88
Applied a total of 48 rules in 11 ms. Remains 77 /101 variables (removed 24) and now considering 88/112 (removed 24) transitions.
// Phase 1: matrix 88 rows 77 cols
[2024-05-27 20:05:17] [INFO ] Computed 16 invariants in 1 ms
[2024-05-27 20:05:17] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-27 20:05:17] [INFO ] Invariant cache hit.
[2024-05-27 20:05:17] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-27 20:05:17] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 77/176 places, 88/171 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 469 ms. Remains : 77/176 places, 88/171 transitions.
Stuttering acceptance computed with spot in 118 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : ParamProductionCell-PT-0-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND p0 p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s64 1), p2:(OR (EQ s57 0) (EQ s72 0)), p0:(OR (EQ s59 0) (EQ s62 0))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 2247 reset in 132 ms.
Product exploration explored 100000 steps with 2248 reset in 141 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (AND p0 p2)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (AND p0 p2)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 280 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 124 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 8) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-27 20:05:18] [INFO ] Invariant cache hit.
[2024-05-27 20:05:18] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 20:05:18] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2024-05-27 20:05:18] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-27 20:05:18] [INFO ] After 37ms SMT Verify possible using all constraints in natural 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 p1) p2 p0), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (AND p0 p2)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (AND p0 p2))), (G (NOT (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND p0 p2))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p2)), (F (AND p0 (NOT p2))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT p2))]
Knowledge based reduction with 14 factoid took 521 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 117 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Support contains 5 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 88/88 transitions.
Applied a total of 0 rules in 2 ms. Remains 77 /77 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2024-05-27 20:05:19] [INFO ] Invariant cache hit.
[2024-05-27 20:05:19] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-27 20:05:19] [INFO ] Invariant cache hit.
[2024-05-27 20:05:19] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-27 20:05:19] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
[2024-05-27 20:05:19] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-27 20:05:19] [INFO ] Invariant cache hit.
[2024-05-27 20:05:19] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 363 ms. Remains : 77/77 places, 88/88 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (AND p0 p2)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (AND p0 p2)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 175 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 8) seen :7
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-27 20:05:20] [INFO ] Invariant cache hit.
[2024-05-27 20:05:20] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 20:05:20] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2024-05-27 20:05:20] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-27 20:05:20] [INFO ] After 48ms SMT Verify possible using all constraints in natural 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 p1) p2 p0), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (AND p0 p2)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (AND p0 p2))), (G (NOT (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND p0 p2))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p2)), (F (AND p0 (NOT p2))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT p2))]
Knowledge based reduction with 14 factoid took 542 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 118 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 116 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 2247 reset in 125 ms.
Product exploration explored 100000 steps with 2243 reset in 143 ms.
Built C files in :
/tmp/ltsmin2639870719236081291
[2024-05-27 20:05:21] [INFO ] Computing symmetric may disable matrix : 88 transitions.
[2024-05-27 20:05:21] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:05:21] [INFO ] Computing symmetric may enable matrix : 88 transitions.
[2024-05-27 20:05:21] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:05:21] [INFO ] Computing Do-Not-Accords matrix : 88 transitions.
[2024-05-27 20:05:21] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:05:21] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2639870719236081291
Running compilation step : cd /tmp/ltsmin2639870719236081291;'/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 470 ms.
Running link step : cd /tmp/ltsmin2639870719236081291;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin2639870719236081291;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased951185554614869574.hoa' '--buchi-type=spotba'
LTSmin run took 255 ms.
FORMULA ParamProductionCell-PT-0-LTLFireability-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-0-LTLFireability-10 finished in 5036 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(p0) U (F(p1) U p2))&&X(X(G(!p1)))))'
Support contains 7 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 171/171 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 175 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 175 transition count 170
Applied a total of 2 rules in 4 ms. Remains 175 /176 variables (removed 1) and now considering 170/171 (removed 1) transitions.
// Phase 1: matrix 170 rows 175 cols
[2024-05-27 20:05:22] [INFO ] Computed 32 invariants in 1 ms
[2024-05-27 20:05:22] [INFO ] Implicit Places using invariants in 172 ms returned [16, 30, 39, 67, 86, 88, 101, 103, 144, 145, 147]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 174 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 164/176 places, 170/171 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 162 transition count 168
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 162 transition count 168
Applied a total of 4 rules in 3 ms. Remains 162 /164 variables (removed 2) and now considering 168/170 (removed 2) transitions.
// Phase 1: matrix 168 rows 162 cols
[2024-05-27 20:05:22] [INFO ] Computed 21 invariants in 3 ms
[2024-05-27 20:05:22] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-27 20:05:22] [INFO ] Invariant cache hit.
[2024-05-27 20:05:22] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-05-27 20:05:22] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 431 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 162/176 places, 168/171 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 614 ms. Remains : 162/176 places, 168/171 transitions.
Stuttering acceptance computed with spot in 420 ms :[(OR (NOT p2) p1), (NOT p1), (NOT p2), p1, (AND (NOT p1) (NOT p0)), (NOT p2), p1, true]
Running random walk in product with property : ParamProductionCell-PT-0-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 6}, { cond=p1, acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={0} source=7 dest: 7}]], initial=0, aps=[p2:(AND (EQ s3 1) (EQ s59 1)), p1:(AND (EQ s31 1) (EQ s33 1) (EQ s47 1)), p0:(AND (EQ s93 1) (EQ s113 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, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 57 steps with 4 reset in 1 ms.
FORMULA ParamProductionCell-PT-0-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-0-LTLFireability-11 finished in 1061 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(p1)&&F(p2)&&p0))))'
Support contains 5 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 171/171 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 175 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 175 transition count 170
Applied a total of 2 rules in 4 ms. Remains 175 /176 variables (removed 1) and now considering 170/171 (removed 1) transitions.
// Phase 1: matrix 170 rows 175 cols
[2024-05-27 20:05:23] [INFO ] Computed 32 invariants in 2 ms
[2024-05-27 20:05:23] [INFO ] Implicit Places using invariants in 201 ms returned [16, 30, 35, 39, 62, 67, 86, 88, 100, 103, 144, 145, 147]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 217 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 162/176 places, 170/171 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 160 transition count 168
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 160 transition count 168
Applied a total of 4 rules in 3 ms. Remains 160 /162 variables (removed 2) and now considering 168/170 (removed 2) transitions.
// Phase 1: matrix 168 rows 160 cols
[2024-05-27 20:05:23] [INFO ] Computed 19 invariants in 1 ms
[2024-05-27 20:05:23] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-27 20:05:23] [INFO ] Invariant cache hit.
[2024-05-27 20:05:23] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-05-27 20:05:23] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 419 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 160/176 places, 168/171 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 646 ms. Remains : 160/176 places, 168/171 transitions.
Stuttering acceptance computed with spot in 221 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2) (NOT p0)), true, (OR (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : ParamProductionCell-PT-0-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 p2), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 4}], [{ cond=(AND p0 p1 p2), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=5, aps=[p1:(OR (EQ s75 0) (EQ s91 0)), p2:(AND (EQ s89 1) (EQ s95 1)), p0:(AND (EQ s91 1) (EQ s110 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-0-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-0-LTLFireability-12 finished in 886 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(!p0)||(!p1 U (G(!p1)||(!p1&&(F(!p0)||(!p2&&X(p1))))))))'
Support contains 7 out of 176 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 176/176 places, 171/171 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 176 transition count 155
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 160 transition count 155
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 32 place count 160 transition count 144
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 54 place count 149 transition count 144
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 148 transition count 143
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 148 transition count 143
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 112 place count 119 transition count 116
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 112 place count 119 transition count 115
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 115 place count 117 transition count 115
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 2 with 2 rules applied. Total rules applied 117 place count 116 transition count 114
Applied a total of 117 rules in 18 ms. Remains 116 /176 variables (removed 60) and now considering 114/171 (removed 57) transitions.
// Phase 1: matrix 114 rows 116 cols
[2024-05-27 20:05:24] [INFO ] Computed 29 invariants in 1 ms
[2024-05-27 20:05:24] [INFO ] Implicit Places using invariants in 126 ms returned [0, 9, 17, 20, 23, 36, 39, 52, 63, 64, 93, 94, 96]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 128 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 103/176 places, 114/171 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 103 transition count 110
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 99 transition count 110
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 8 place count 99 transition count 106
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 95 transition count 106
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 48 place count 79 transition count 90
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 2 with 2 rules applied. Total rules applied 50 place count 78 transition count 89
Applied a total of 50 rules in 12 ms. Remains 78 /103 variables (removed 25) and now considering 89/114 (removed 25) transitions.
// Phase 1: matrix 89 rows 78 cols
[2024-05-27 20:05:24] [INFO ] Computed 16 invariants in 0 ms
[2024-05-27 20:05:24] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-27 20:05:24] [INFO ] Invariant cache hit.
[2024-05-27 20:05:24] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-27 20:05:24] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 78/176 places, 89/171 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 438 ms. Remains : 78/176 places, 89/171 transitions.
Stuttering acceptance computed with spot in 209 ms :[true, p0, (AND p0 p1), p0, false, (AND p0 p1)]
Running random walk in product with property : ParamProductionCell-PT-0-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(NOT p0), acceptance={} source=3 dest: 3}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND p0 p1), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=5 dest: 5}]], initial=2, aps=[p0:(OR (NEQ s32 1) (NEQ s33 1) (NEQ s72 1)), p1:(AND (EQ s44 1) (EQ s56 1)), p2:(AND (EQ s11 1) (EQ s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 4351 reset in 149 ms.
Product exploration explored 100000 steps with 4334 reset in 175 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND p0 p2 (NOT p1)))), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 p1))), (X p0), true, (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 126 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter insensitive) to 10 states, 26 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 398 ms :[p0, false, false, (AND p0 p1), false, false, false, false, false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 11) seen :9
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-27 20:05:26] [INFO ] Invariant cache hit.
[2024-05-27 20:05:26] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2024-05-27 20:05:26] [INFO ] [Real]Absence check using 14 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-27 20:05:26] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND p0 p2 (NOT p1)))), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 p1))), (X p0), true, (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (G (NOT (AND (NOT p0) p1 p2))), (G (NOT (AND (NOT p0) p1 (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) p2)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT p0)), (F (AND p0 (NOT p1) p2)), (F (NOT (OR (NOT p0) p1 (NOT p2)))), (F (AND p0 p1 p2)), (F (AND p0 p1)), (F (AND p0 p1 (NOT p2))), (F (NOT (AND p0 (NOT p1) (NOT p2))))]
Knowledge based reduction with 12 factoid took 514 ms. Reduced automaton from 10 states, 26 edges and 3 AP (stutter insensitive) to 12 states, 32 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 478 ms :[p0, false, false, (AND p0 p1), false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 474 ms :[p0, false, false, (AND p0 p1), false, false, false, false, false, false, false, false]
Support contains 7 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 89/89 transitions.
Applied a total of 0 rules in 5 ms. Remains 78 /78 variables (removed 0) and now considering 89/89 (removed 0) transitions.
[2024-05-27 20:05:27] [INFO ] Invariant cache hit.
[2024-05-27 20:05:27] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-27 20:05:27] [INFO ] Invariant cache hit.
[2024-05-27 20:05:27] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-27 20:05:27] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
[2024-05-27 20:05:27] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-27 20:05:27] [INFO ] Invariant cache hit.
[2024-05-27 20:05:27] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 350 ms. Remains : 78/78 places, 89/89 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT p1)), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 318 ms. Reduced automaton from 12 states, 32 edges and 3 AP (stutter insensitive) to 12 states, 32 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 487 ms :[p0, false, false, (AND p0 p1), false, false, false, false, false, false, false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 11) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-27 20:05:29] [INFO ] Invariant cache hit.
[2024-05-27 20:05:29] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2024-05-27 20:05:29] [INFO ] [Real]Absence check using 14 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-27 20:05:29] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT p1)), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X p0)), (X (X (NOT p1))), (G (NOT (AND (NOT p0) p1 p2))), (G (NOT (AND (NOT p0) p1 (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) p2)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT p0)), (F (AND p0 (NOT p1) p2)), (F (NOT (OR (NOT p0) p1 (NOT p2)))), (F (AND p0 p1 p2)), (F p1), (F (AND p0 p1 (NOT p2))), (F (NOT (AND p0 (NOT p1) (NOT p2))))]
Knowledge based reduction with 22 factoid took 1003 ms. Reduced automaton from 12 states, 32 edges and 3 AP (stutter insensitive) to 12 states, 32 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 472 ms :[p0, false, false, (AND p0 p1), false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 490 ms :[p0, false, false, (AND p0 p1), false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 475 ms :[p0, false, false, (AND p0 p1), false, false, false, false, false, false, false, false]
Product exploration explored 100000 steps with 4351 reset in 161 ms.
Product exploration explored 100000 steps with 4342 reset in 185 ms.
Built C files in :
/tmp/ltsmin11039362311247693993
[2024-05-27 20:05:31] [INFO ] Computing symmetric may disable matrix : 89 transitions.
[2024-05-27 20:05:31] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:05:31] [INFO ] Computing symmetric may enable matrix : 89 transitions.
[2024-05-27 20:05:31] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:05:31] [INFO ] Computing Do-Not-Accords matrix : 89 transitions.
[2024-05-27 20:05:31] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:05:31] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11039362311247693993
Running compilation step : cd /tmp/ltsmin11039362311247693993;'/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 285 ms.
Running link step : cd /tmp/ltsmin11039362311247693993;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin11039362311247693993;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15849804753647851472.hoa' '--buchi-type=spotba'
LTSmin run took 129 ms.
FORMULA ParamProductionCell-PT-0-LTLFireability-14 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-0-LTLFireability-14 finished in 8245 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 (F(G(!p1))||G((X(p3)&&p2)))))'
Support contains 7 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 171/171 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 175 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 175 transition count 170
Applied a total of 2 rules in 3 ms. Remains 175 /176 variables (removed 1) and now considering 170/171 (removed 1) transitions.
// Phase 1: matrix 170 rows 175 cols
[2024-05-27 20:05:32] [INFO ] Computed 32 invariants in 4 ms
[2024-05-27 20:05:32] [INFO ] Implicit Places using invariants in 205 ms returned [16, 30, 35, 39, 62, 86, 88, 100, 101, 103, 144, 145]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 206 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 163/176 places, 170/171 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 161 transition count 168
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 161 transition count 168
Applied a total of 4 rules in 3 ms. Remains 161 /163 variables (removed 2) and now considering 168/170 (removed 2) transitions.
// Phase 1: matrix 168 rows 161 cols
[2024-05-27 20:05:32] [INFO ] Computed 20 invariants in 0 ms
[2024-05-27 20:05:32] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-27 20:05:32] [INFO ] Invariant cache hit.
[2024-05-27 20:05:32] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-05-27 20:05:33] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 423 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 161/176 places, 168/171 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 636 ms. Remains : 161/176 places, 168/171 transitions.
Stuttering acceptance computed with spot in 311 ms :[(OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (AND (NOT p0) p1), (OR (AND (NOT p0) p1 (NOT p2)) (AND p1 (NOT p3))), p1, (OR (AND p0 p1 (NOT p2)) (AND p0 p1 (NOT p3)))]
Running random walk in product with property : ParamProductionCell-PT-0-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 0}, { cond=(AND p1 p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={1} source=0 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={1} source=0 dest: 2}, { cond=(AND p1 p2), acceptance={0, 1} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) p2 p0 (NOT p3)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p2 p0 (NOT p3)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p2) p0 (NOT p3)), acceptance={1} source=2 dest: 0}, { cond=(AND p1 (NOT p2) p0 (NOT p3)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p2) p0 (NOT p3)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p2 p0 (NOT p3)), acceptance={1} source=2 dest: 2}, { cond=(AND p1 p2 p0 (NOT p3)), acceptance={0, 1} source=2 dest: 2}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p3))), acceptance={} source=2 dest: 3}, { cond=(AND p2 (NOT p0) p3), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={1} source=3 dest: 3}, { cond=p1, acceptance={0, 1} source=3 dest: 3}], [{ cond=(OR (AND (NOT p2) p0) (AND p0 (NOT p3))), acceptance={} source=4 dest: 3}, { cond=(AND p2 p0 p3), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s85 1) (EQ s107 1)), p2:(AND (EQ s134 1) (EQ s155 1)), p0:(AND (EQ s61 1) (EQ s62 1) (EQ s67 1)), p3:(AND (EQ s134 1) (EQ s155 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 132 ms.
Stack based approach found an accepted trace after 1942 steps with 0 reset with depth 1943 and stack size 1274 in 6 ms.
FORMULA ParamProductionCell-PT-0-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-0-LTLFireability-15 finished in 1107 ms.
All properties solved by simple procedures.
Total runtime 26500 ms.

BK_STOP 1716840334647

--------------------
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="ParamProductionCell-PT-0"
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 ParamProductionCell-PT-0, 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 r285-smll-171654421800008"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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