Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 712K
-rw-r--r-- 1 mcc users 8.4K Feb 26 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 17:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 17:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 16:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Feb 26 17:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 160K Feb 26 17:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 26 17:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Feb 26 17:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 174K Mar 5 18:23 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-2-LTLFireability-00
FORMULA_NAME ParamProductionCell-PT-2-LTLFireability-01
FORMULA_NAME ParamProductionCell-PT-2-LTLFireability-02
FORMULA_NAME ParamProductionCell-PT-2-LTLFireability-03
FORMULA_NAME ParamProductionCell-PT-2-LTLFireability-04
FORMULA_NAME ParamProductionCell-PT-2-LTLFireability-05
FORMULA_NAME ParamProductionCell-PT-2-LTLFireability-06
FORMULA_NAME ParamProductionCell-PT-2-LTLFireability-07
FORMULA_NAME ParamProductionCell-PT-2-LTLFireability-08
FORMULA_NAME ParamProductionCell-PT-2-LTLFireability-09
FORMULA_NAME ParamProductionCell-PT-2-LTLFireability-10
FORMULA_NAME ParamProductionCell-PT-2-LTLFireability-11
FORMULA_NAME ParamProductionCell-PT-2-LTLFireability-12
FORMULA_NAME ParamProductionCell-PT-2-LTLFireability-13
FORMULA_NAME ParamProductionCell-PT-2-LTLFireability-14
FORMULA_NAME ParamProductionCell-PT-2-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678918272986

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ParamProductionCell-PT-2
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-15 22:11:16] [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]
[2023-03-15 22:11:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 22:11:16] [INFO ] Load time of PNML (sax parser for PT used): 238 ms
[2023-03-15 22:11:16] [INFO ] Transformed 231 places.
[2023-03-15 22:11:16] [INFO ] Transformed 202 transitions.
[2023-03-15 22:11:16] [INFO ] Found NUPN structural information;
[2023-03-15 22:11:16] [INFO ] Parsed PT model containing 231 places and 202 transitions and 846 arcs in 388 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ParamProductionCell-PT-2-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-2-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 202/202 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 227 transition count 198
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 227 transition count 198
Applied a total of 8 rules in 76 ms. Remains 227 /231 variables (removed 4) and now considering 198/202 (removed 4) transitions.
// Phase 1: matrix 198 rows 227 cols
[2023-03-15 22:11:17] [INFO ] Computed 59 place invariants in 41 ms
[2023-03-15 22:11:17] [INFO ] Implicit Places using invariants in 884 ms returned [15, 16, 19, 24, 35, 36, 41, 42, 47, 59, 64, 65, 73, 78, 114, 117, 119, 120, 161, 162, 164, 166, 167, 192, 193, 196, 203, 218]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 958 ms to find 28 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 199/231 places, 198/202 transitions.
Applied a total of 0 rules in 21 ms. Remains 199 /199 variables (removed 0) and now considering 198/198 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1056 ms. Remains : 199/231 places, 198/202 transitions.
Support contains 50 out of 199 places after structural reductions.
[2023-03-15 22:11:18] [INFO ] Flatten gal took : 96 ms
[2023-03-15 22:11:18] [INFO ] Flatten gal took : 37 ms
[2023-03-15 22:11:18] [INFO ] Input system was already deterministic with 198 transitions.
Support contains 48 out of 199 places (down from 50) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 656 ms. (steps per millisecond=15 ) properties (out of 32) seen :30
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 198 rows 199 cols
[2023-03-15 22:11:19] [INFO ] Computed 31 place invariants in 11 ms
[2023-03-15 22:11:19] [INFO ] [Real]Absence check using 24 positive place invariants in 20 ms returned sat
[2023-03-15 22:11:19] [INFO ] [Real]Absence check using 24 positive and 7 generalized place invariants in 10 ms returned sat
[2023-03-15 22:11:19] [INFO ] After 322ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 22:11:19] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:11:19] [INFO ] After 57ms SMT Verify possible using 68 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 22:11:19] [INFO ] After 561ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 22:11:19] [INFO ] [Nat]Absence check using 24 positive place invariants in 56 ms returned sat
[2023-03-15 22:11:19] [INFO ] [Nat]Absence check using 24 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-15 22:11:20] [INFO ] After 139ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 22:11:20] [INFO ] After 39ms SMT Verify possible using 68 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 22:11:20] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 13 ms to minimize.
[2023-03-15 22:11:20] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 2 ms to minimize.
[2023-03-15 22:11:20] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 2 ms to minimize.
[2023-03-15 22:11:20] [INFO ] Deduced a trap composed of 5 places in 171 ms of which 3 ms to minimize.
[2023-03-15 22:11:21] [INFO ] Deduced a trap composed of 11 places in 222 ms of which 2 ms to minimize.
[2023-03-15 22:11:21] [INFO ] Deduced a trap composed of 12 places in 114 ms of which 1 ms to minimize.
[2023-03-15 22:11:21] [INFO ] Deduced a trap composed of 27 places in 139 ms of which 1 ms to minimize.
[2023-03-15 22:11:21] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1285 ms
[2023-03-15 22:11:21] [INFO ] After 1376ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 45 ms.
[2023-03-15 22:11:21] [INFO ] After 1750ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 199 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 199/199 places, 198/198 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 199 transition count 181
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 182 transition count 181
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 34 place count 182 transition count 164
Deduced a syphon composed of 17 places in 8 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 68 place count 165 transition count 164
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 70 place count 163 transition count 162
Iterating global reduction 2 with 2 rules applied. Total rules applied 72 place count 163 transition count 162
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 140 place count 129 transition count 128
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 145 place count 129 transition count 123
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 150 place count 124 transition count 123
Applied a total of 150 rules in 88 ms. Remains 124 /199 variables (removed 75) and now considering 123/198 (removed 75) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 124/199 places, 123/198 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Finished probabilistic random walk after 33163 steps, run visited all 1 properties in 192 ms. (steps per millisecond=172 )
Probabilistic random walk after 33163 steps, saw 9913 distinct states, run finished after 192 ms. (steps per millisecond=172 ) properties seen :1
FORMULA ParamProductionCell-PT-2-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 4 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 197 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 197 transition count 196
Applied a total of 4 rules in 20 ms. Remains 197 /199 variables (removed 2) and now considering 196/198 (removed 2) transitions.
// Phase 1: matrix 196 rows 197 cols
[2023-03-15 22:11:22] [INFO ] Computed 31 place invariants in 6 ms
[2023-03-15 22:11:23] [INFO ] Implicit Places using invariants in 561 ms returned [27, 38, 65, 84, 85, 87, 99, 174, 178]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 571 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/199 places, 196/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 186 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 186 transition count 194
Applied a total of 4 rules in 15 ms. Remains 186 /188 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 186 cols
[2023-03-15 22:11:23] [INFO ] Computed 22 place invariants in 3 ms
[2023-03-15 22:11:23] [INFO ] Implicit Places using invariants in 463 ms returned []
[2023-03-15 22:11:23] [INFO ] Invariant cache hit.
[2023-03-15 22:11:23] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:11:24] [INFO ] Implicit Places using invariants and state equation in 507 ms returned []
Implicit Place search using SMT with State Equation took 973 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 186/199 places, 194/198 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1580 ms. Remains : 186/199 places, 194/198 transitions.
Stuttering acceptance computed with spot in 358 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-2-LTLFireability-00 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:(AND (EQ s160 1) (EQ s167 1) (EQ s16 1) (EQ s19 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 22 reset in 683 ms.
Stack based approach found an accepted trace after 434 steps with 0 reset with depth 435 and stack size 435 in 4 ms.
FORMULA ParamProductionCell-PT-2-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-2-LTLFireability-00 finished in 2739 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 199 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 199/199 places, 198/198 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 199 transition count 182
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 183 transition count 182
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 32 place count 183 transition count 164
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 68 place count 165 transition count 164
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 70 place count 163 transition count 162
Iterating global reduction 2 with 2 rules applied. Total rules applied 72 place count 163 transition count 162
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 136 place count 131 transition count 130
Applied a total of 136 rules in 51 ms. Remains 131 /199 variables (removed 68) and now considering 130/198 (removed 68) transitions.
// Phase 1: matrix 130 rows 131 cols
[2023-03-15 22:11:25] [INFO ] Computed 31 place invariants in 3 ms
[2023-03-15 22:11:25] [INFO ] Implicit Places using invariants in 332 ms returned [12, 19, 26, 42, 52, 53, 55, 67, 114, 117, 119]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 336 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 120/199 places, 130/198 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 120 transition count 127
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 117 transition count 127
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 117 transition count 125
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 115 transition count 125
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 12 place count 113 transition count 123
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 113 transition count 123
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 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 68 place count 86 transition count 96
Applied a total of 68 rules in 59 ms. Remains 86 /120 variables (removed 34) and now considering 96/130 (removed 34) transitions.
// Phase 1: matrix 96 rows 86 cols
[2023-03-15 22:11:25] [INFO ] Computed 20 place invariants in 6 ms
[2023-03-15 22:11:25] [INFO ] Implicit Places using invariants in 209 ms returned []
[2023-03-15 22:11:25] [INFO ] Invariant cache hit.
[2023-03-15 22:11:25] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:11:26] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 539 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 86/199 places, 96/198 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 991 ms. Remains : 86/199 places, 96/198 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-2-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s24 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 824 reset in 318 ms.
Product exploration explored 100000 steps with 814 reset in 536 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 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 163 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Finished random walk after 81 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=40 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 198 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 96/96 transitions.
Applied a total of 0 rules in 8 ms. Remains 86 /86 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2023-03-15 22:11:27] [INFO ] Invariant cache hit.
[2023-03-15 22:11:28] [INFO ] Implicit Places using invariants in 172 ms returned []
[2023-03-15 22:11:28] [INFO ] Invariant cache hit.
[2023-03-15 22:11:28] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:11:28] [INFO ] Implicit Places using invariants and state equation in 321 ms returned []
Implicit Place search using SMT with State Equation took 500 ms to find 0 implicit places.
[2023-03-15 22:11:28] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-15 22:11:28] [INFO ] Invariant cache hit.
[2023-03-15 22:11:28] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 682 ms. Remains : 86/86 places, 96/96 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 170 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Finished random walk after 112 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=56 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 197 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 809 reset in 211 ms.
Product exploration explored 100000 steps with 826 reset in 241 ms.
Built C files in :
/tmp/ltsmin9964918585220890000
[2023-03-15 22:11:29] [INFO ] Computing symmetric may disable matrix : 96 transitions.
[2023-03-15 22:11:29] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 22:11:29] [INFO ] Computing symmetric may enable matrix : 96 transitions.
[2023-03-15 22:11:29] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 22:11:29] [INFO ] Computing Do-Not-Accords matrix : 96 transitions.
[2023-03-15 22:11:29] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 22:11:29] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9964918585220890000
Running compilation step : cd /tmp/ltsmin9964918585220890000;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 802 ms.
Running link step : cd /tmp/ltsmin9964918585220890000;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 70 ms.
Running LTSmin : cd /tmp/ltsmin9964918585220890000;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11879679124136401135.hoa' '--buchi-type=spotba'
LTSmin run took 1998 ms.
FORMULA ParamProductionCell-PT-2-LTLFireability-01 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-2-LTLFireability-01 finished in 7576 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!X(!G((F((F(p1)&&p0))||p2))) U p1))'
Support contains 6 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 197 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 197 transition count 196
Applied a total of 4 rules in 9 ms. Remains 197 /199 variables (removed 2) and now considering 196/198 (removed 2) transitions.
// Phase 1: matrix 196 rows 197 cols
[2023-03-15 22:11:32] [INFO ] Computed 31 place invariants in 3 ms
[2023-03-15 22:11:33] [INFO ] Implicit Places using invariants in 220 ms returned [27, 38, 65, 84, 85, 87, 99, 169, 178]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 223 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/199 places, 196/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 186 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 186 transition count 194
Applied a total of 4 rules in 4 ms. Remains 186 /188 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 186 cols
[2023-03-15 22:11:33] [INFO ] Computed 22 place invariants in 3 ms
[2023-03-15 22:11:33] [INFO ] Implicit Places using invariants in 174 ms returned []
[2023-03-15 22:11:33] [INFO ] Invariant cache hit.
[2023-03-15 22:11:33] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:11:33] [INFO ] Implicit Places using invariants and state equation in 529 ms returned []
Implicit Place search using SMT with State Equation took 712 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 186/199 places, 194/198 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 948 ms. Remains : 186/199 places, 194/198 transitions.
Stuttering acceptance computed with spot in 351 ms :[(NOT p1), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1)]
Running random walk in product with property : ParamProductionCell-PT-2-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=p1, acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s16 1) (EQ s19 1)), p2:(AND (EQ s164 1) (EQ s170 1)), p0:(AND (EQ s35 1) (EQ s40 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 846 reset in 273 ms.
Product exploration explored 100000 steps with 843 reset in 382 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) (NOT p2) (NOT p0)), (X (NOT p1)), (X (AND (NOT p2) (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0)))), true, (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2) p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 642 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1)]
Finished random walk after 120 steps, including 0 resets, run visited all 5 properties in 7 ms. (steps per millisecond=17 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p1)), (X (AND (NOT p2) (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0)))), true, (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2) p0))))]
False Knowledge obtained : [(F (AND p0 (NOT p1) (NOT p2))), (F (AND p0 (NOT p1))), (F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 9 factoid took 713 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 307 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1)]
Stuttering acceptance computed with spot in 307 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1)]
[2023-03-15 22:11:36] [INFO ] Invariant cache hit.
[2023-03-15 22:11:37] [INFO ] [Real]Absence check using 19 positive place invariants in 12 ms returned sat
[2023-03-15 22:11:37] [INFO ] [Real]Absence check using 19 positive and 3 generalized place invariants in 5 ms returned sat
[2023-03-15 22:11:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:11:37] [INFO ] [Real]Absence check using state equation in 364 ms returned sat
[2023-03-15 22:11:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:11:37] [INFO ] [Nat]Absence check using 19 positive place invariants in 15 ms returned sat
[2023-03-15 22:11:37] [INFO ] [Nat]Absence check using 19 positive and 3 generalized place invariants in 5 ms returned sat
[2023-03-15 22:11:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:11:38] [INFO ] [Nat]Absence check using state equation in 317 ms returned sat
[2023-03-15 22:11:38] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:11:38] [INFO ] [Nat]Added 68 Read/Feed constraints in 34 ms returned sat
[2023-03-15 22:11:38] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 1 ms to minimize.
[2023-03-15 22:11:38] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 1 ms to minimize.
[2023-03-15 22:11:38] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 1 ms to minimize.
[2023-03-15 22:11:38] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 1 ms to minimize.
[2023-03-15 22:11:38] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 1 ms to minimize.
[2023-03-15 22:11:38] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 1 ms to minimize.
[2023-03-15 22:11:39] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 1 ms to minimize.
[2023-03-15 22:11:39] [INFO ] Deduced a trap composed of 6 places in 109 ms of which 1 ms to minimize.
[2023-03-15 22:11:39] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 1 ms to minimize.
[2023-03-15 22:11:39] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 1 ms to minimize.
[2023-03-15 22:11:39] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 1 ms to minimize.
[2023-03-15 22:11:39] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 1 ms to minimize.
[2023-03-15 22:11:39] [INFO ] Deduced a trap composed of 42 places in 103 ms of which 1 ms to minimize.
[2023-03-15 22:11:39] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 1 ms to minimize.
[2023-03-15 22:11:40] [INFO ] Deduced a trap composed of 46 places in 107 ms of which 1 ms to minimize.
[2023-03-15 22:11:40] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 1 ms to minimize.
[2023-03-15 22:11:40] [INFO ] Deduced a trap composed of 43 places in 91 ms of which 1 ms to minimize.
[2023-03-15 22:11:40] [INFO ] Deduced a trap composed of 53 places in 79 ms of which 0 ms to minimize.
[2023-03-15 22:11:40] [INFO ] Deduced a trap composed of 41 places in 83 ms of which 0 ms to minimize.
[2023-03-15 22:11:40] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 0 ms to minimize.
[2023-03-15 22:11:40] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 1 ms to minimize.
[2023-03-15 22:11:40] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
[2023-03-15 22:11:40] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 1 ms to minimize.
[2023-03-15 22:11:41] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 1 ms to minimize.
[2023-03-15 22:11:41] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2023-03-15 22:11:41] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 3040 ms
[2023-03-15 22:11:41] [INFO ] Computed and/alt/rep : 192/311/192 causal constraints (skipped 0 transitions) in 20 ms.
[2023-03-15 22:11:42] [INFO ] Added : 181 causal constraints over 37 iterations in 1025 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-15 22:11:42] [INFO ] Invariant cache hit.
[2023-03-15 22:11:42] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2023-03-15 22:11:42] [INFO ] [Real]Absence check using 19 positive and 3 generalized place invariants in 5 ms returned sat
[2023-03-15 22:11:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:11:42] [INFO ] [Real]Absence check using state equation in 212 ms returned sat
[2023-03-15 22:11:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:11:42] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2023-03-15 22:11:42] [INFO ] [Nat]Absence check using 19 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-15 22:11:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:11:42] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2023-03-15 22:11:42] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:11:42] [INFO ] [Nat]Added 68 Read/Feed constraints in 18 ms returned sat
[2023-03-15 22:11:43] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 1 ms to minimize.
[2023-03-15 22:11:43] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2023-03-15 22:11:43] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 1 ms to minimize.
[2023-03-15 22:11:43] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 0 ms to minimize.
[2023-03-15 22:11:43] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 1 ms to minimize.
[2023-03-15 22:11:43] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 0 ms to minimize.
[2023-03-15 22:11:43] [INFO ] Deduced a trap composed of 34 places in 105 ms of which 1 ms to minimize.
[2023-03-15 22:11:43] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 0 ms to minimize.
[2023-03-15 22:11:43] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 1 ms to minimize.
[2023-03-15 22:11:43] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 0 ms to minimize.
[2023-03-15 22:11:44] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 1 ms to minimize.
[2023-03-15 22:11:44] [INFO ] Deduced a trap composed of 72 places in 116 ms of which 1 ms to minimize.
[2023-03-15 22:11:44] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 1 ms to minimize.
[2023-03-15 22:11:44] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 1 ms to minimize.
[2023-03-15 22:11:44] [INFO ] Deduced a trap composed of 17 places in 131 ms of which 1 ms to minimize.
[2023-03-15 22:11:44] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 1 ms to minimize.
[2023-03-15 22:11:44] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 1 ms to minimize.
[2023-03-15 22:11:45] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 2 ms to minimize.
[2023-03-15 22:11:45] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 0 ms to minimize.
[2023-03-15 22:11:45] [INFO ] Deduced a trap composed of 25 places in 109 ms of which 1 ms to minimize.
[2023-03-15 22:11:45] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 0 ms to minimize.
[2023-03-15 22:11:45] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 1 ms to minimize.
[2023-03-15 22:11:45] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 1 ms to minimize.
[2023-03-15 22:11:45] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 2828 ms
[2023-03-15 22:11:45] [INFO ] Computed and/alt/rep : 192/311/192 causal constraints (skipped 0 transitions) in 24 ms.
[2023-03-15 22:11:46] [INFO ] Added : 104 causal constraints over 21 iterations in 810 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 6 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 194/194 transitions.
Applied a total of 0 rules in 2 ms. Remains 186 /186 variables (removed 0) and now considering 194/194 (removed 0) transitions.
[2023-03-15 22:11:46] [INFO ] Invariant cache hit.
[2023-03-15 22:11:46] [INFO ] Implicit Places using invariants in 126 ms returned []
[2023-03-15 22:11:46] [INFO ] Invariant cache hit.
[2023-03-15 22:11:46] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:11:47] [INFO ] Implicit Places using invariants and state equation in 421 ms returned []
Implicit Place search using SMT with State Equation took 549 ms to find 0 implicit places.
[2023-03-15 22:11:47] [INFO ] Invariant cache hit.
[2023-03-15 22:11:47] [INFO ] Dead Transitions using invariants and state equation in 209 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 766 ms. Remains : 186/186 places, 194/194 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) (NOT p0) (NOT p2)), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (AND (NOT p0) (NOT p2))), (X (X (NOT p1))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 772 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 306 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1)]
Finished random walk after 118 steps, including 0 resets, run visited all 5 properties in 6 ms. (steps per millisecond=19 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (AND (NOT p0) (NOT p2))), (X (X (NOT p1))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p1) p0 (NOT p2))), (F (AND (NOT p1) p0)), (F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 11 factoid took 915 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 293 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1)]
Stuttering acceptance computed with spot in 322 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1)]
[2023-03-15 22:11:50] [INFO ] Invariant cache hit.
[2023-03-15 22:11:50] [INFO ] [Real]Absence check using 19 positive place invariants in 16 ms returned sat
[2023-03-15 22:11:50] [INFO ] [Real]Absence check using 19 positive and 3 generalized place invariants in 5 ms returned sat
[2023-03-15 22:11:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:11:50] [INFO ] [Real]Absence check using state equation in 374 ms returned sat
[2023-03-15 22:11:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:11:50] [INFO ] [Nat]Absence check using 19 positive place invariants in 15 ms returned sat
[2023-03-15 22:11:50] [INFO ] [Nat]Absence check using 19 positive and 3 generalized place invariants in 5 ms returned sat
[2023-03-15 22:11:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:11:51] [INFO ] [Nat]Absence check using state equation in 288 ms returned sat
[2023-03-15 22:11:51] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:11:51] [INFO ] [Nat]Added 68 Read/Feed constraints in 32 ms returned sat
[2023-03-15 22:11:51] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 2 ms to minimize.
[2023-03-15 22:11:51] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 1 ms to minimize.
[2023-03-15 22:11:51] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 1 ms to minimize.
[2023-03-15 22:11:51] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 1 ms to minimize.
[2023-03-15 22:11:51] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 1 ms to minimize.
[2023-03-15 22:11:51] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 1 ms to minimize.
[2023-03-15 22:11:52] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 1 ms to minimize.
[2023-03-15 22:11:52] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 0 ms to minimize.
[2023-03-15 22:11:52] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 0 ms to minimize.
[2023-03-15 22:11:52] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 1 ms to minimize.
[2023-03-15 22:11:52] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 0 ms to minimize.
[2023-03-15 22:11:52] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 3 ms to minimize.
[2023-03-15 22:11:52] [INFO ] Deduced a trap composed of 42 places in 83 ms of which 1 ms to minimize.
[2023-03-15 22:11:52] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 2 ms to minimize.
[2023-03-15 22:11:52] [INFO ] Deduced a trap composed of 46 places in 103 ms of which 1 ms to minimize.
[2023-03-15 22:11:53] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 0 ms to minimize.
[2023-03-15 22:11:53] [INFO ] Deduced a trap composed of 43 places in 87 ms of which 1 ms to minimize.
[2023-03-15 22:11:53] [INFO ] Deduced a trap composed of 53 places in 97 ms of which 0 ms to minimize.
[2023-03-15 22:11:53] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 0 ms to minimize.
[2023-03-15 22:11:53] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 0 ms to minimize.
[2023-03-15 22:11:53] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 0 ms to minimize.
[2023-03-15 22:11:53] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 0 ms to minimize.
[2023-03-15 22:11:53] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 1 ms to minimize.
[2023-03-15 22:11:54] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 1 ms to minimize.
[2023-03-15 22:11:54] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
[2023-03-15 22:11:54] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 2982 ms
[2023-03-15 22:11:54] [INFO ] Computed and/alt/rep : 192/311/192 causal constraints (skipped 0 transitions) in 21 ms.
[2023-03-15 22:11:55] [INFO ] Added : 181 causal constraints over 37 iterations in 1223 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-15 22:11:55] [INFO ] Invariant cache hit.
[2023-03-15 22:11:55] [INFO ] [Real]Absence check using 19 positive place invariants in 14 ms returned sat
[2023-03-15 22:11:55] [INFO ] [Real]Absence check using 19 positive and 3 generalized place invariants in 7 ms returned sat
[2023-03-15 22:11:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:11:55] [INFO ] [Real]Absence check using state equation in 325 ms returned sat
[2023-03-15 22:11:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:11:56] [INFO ] [Nat]Absence check using 19 positive place invariants in 15 ms returned sat
[2023-03-15 22:11:56] [INFO ] [Nat]Absence check using 19 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-15 22:11:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:11:56] [INFO ] [Nat]Absence check using state equation in 211 ms returned sat
[2023-03-15 22:11:56] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:11:56] [INFO ] [Nat]Added 68 Read/Feed constraints in 27 ms returned sat
[2023-03-15 22:11:56] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 1 ms to minimize.
[2023-03-15 22:11:56] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 1 ms to minimize.
[2023-03-15 22:11:56] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 1 ms to minimize.
[2023-03-15 22:11:56] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 1 ms to minimize.
[2023-03-15 22:11:57] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 1 ms to minimize.
[2023-03-15 22:11:57] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 0 ms to minimize.
[2023-03-15 22:11:57] [INFO ] Deduced a trap composed of 34 places in 107 ms of which 0 ms to minimize.
[2023-03-15 22:11:57] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 1 ms to minimize.
[2023-03-15 22:11:57] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 0 ms to minimize.
[2023-03-15 22:11:57] [INFO ] Deduced a trap composed of 26 places in 127 ms of which 0 ms to minimize.
[2023-03-15 22:11:57] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 1 ms to minimize.
[2023-03-15 22:11:57] [INFO ] Deduced a trap composed of 72 places in 97 ms of which 0 ms to minimize.
[2023-03-15 22:11:57] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 1 ms to minimize.
[2023-03-15 22:11:58] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 1 ms to minimize.
[2023-03-15 22:11:58] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 1 ms to minimize.
[2023-03-15 22:11:58] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 1 ms to minimize.
[2023-03-15 22:11:58] [INFO ] Deduced a trap composed of 40 places in 112 ms of which 1 ms to minimize.
[2023-03-15 22:11:58] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 1 ms to minimize.
[2023-03-15 22:11:58] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 1 ms to minimize.
[2023-03-15 22:11:58] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 1 ms to minimize.
[2023-03-15 22:11:59] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 1 ms to minimize.
[2023-03-15 22:11:59] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 1 ms to minimize.
[2023-03-15 22:11:59] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 1 ms to minimize.
[2023-03-15 22:11:59] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 2977 ms
[2023-03-15 22:11:59] [INFO ] Computed and/alt/rep : 192/311/192 causal constraints (skipped 0 transitions) in 28 ms.
[2023-03-15 22:12:00] [INFO ] Added : 104 causal constraints over 21 iterations in 914 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 295 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1)]
Product exploration explored 100000 steps with 845 reset in 292 ms.
Product exploration explored 100000 steps with 845 reset in 529 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1)]
Support contains 6 out of 186 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 186/186 places, 194/194 transitions.
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 186 transition count 194
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 16 Pre rules applied. Total rules applied 31 place count 186 transition count 194
Deduced a syphon composed of 47 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 47 place count 186 transition count 194
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 54 place count 179 transition count 187
Deduced a syphon composed of 40 places in 1 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 61 place count 179 transition count 187
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 82 places in 1 ms
Iterating global reduction 1 with 42 rules applied. Total rules applied 103 place count 179 transition count 187
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 127 place count 155 transition count 163
Deduced a syphon composed of 58 places in 0 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 151 place count 155 transition count 163
Deduced a syphon composed of 58 places in 0 ms
Applied a total of 151 rules in 58 ms. Remains 155 /186 variables (removed 31) and now considering 163/194 (removed 31) transitions.
[2023-03-15 22:12:01] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 163 rows 155 cols
[2023-03-15 22:12:01] [INFO ] Computed 22 place invariants in 2 ms
[2023-03-15 22:12:02] [INFO ] Dead Transitions using invariants and state equation in 236 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 155/186 places, 163/194 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 314 ms. Remains : 155/186 places, 163/194 transitions.
Built C files in :
/tmp/ltsmin3290533471278604327
[2023-03-15 22:12:02] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3290533471278604327
Running compilation step : cd /tmp/ltsmin3290533471278604327;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 708 ms.
Running link step : cd /tmp/ltsmin3290533471278604327;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin3290533471278604327;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16921789685878174617.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 194/194 transitions.
Applied a total of 0 rules in 3 ms. Remains 186 /186 variables (removed 0) and now considering 194/194 (removed 0) transitions.
// Phase 1: matrix 194 rows 186 cols
[2023-03-15 22:12:17] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-15 22:12:17] [INFO ] Implicit Places using invariants in 163 ms returned []
[2023-03-15 22:12:17] [INFO ] Invariant cache hit.
[2023-03-15 22:12:17] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:12:17] [INFO ] Implicit Places using invariants and state equation in 538 ms returned []
Implicit Place search using SMT with State Equation took 704 ms to find 0 implicit places.
[2023-03-15 22:12:17] [INFO ] Invariant cache hit.
[2023-03-15 22:12:18] [INFO ] Dead Transitions using invariants and state equation in 237 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 946 ms. Remains : 186/186 places, 194/194 transitions.
Built C files in :
/tmp/ltsmin16438479118559552511
[2023-03-15 22:12:18] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16438479118559552511
Running compilation step : cd /tmp/ltsmin16438479118559552511;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 654 ms.
Running link step : cd /tmp/ltsmin16438479118559552511;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin16438479118559552511;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16198910862448131875.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-15 22:12:33] [INFO ] Flatten gal took : 26 ms
[2023-03-15 22:12:33] [INFO ] Flatten gal took : 16 ms
[2023-03-15 22:12:33] [INFO ] Time to serialize gal into /tmp/LTL16820786831041174130.gal : 5 ms
[2023-03-15 22:12:33] [INFO ] Time to serialize properties into /tmp/LTL9083903754893948069.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16820786831041174130.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4519647171100867261.hoa' '-atoms' '/tmp/LTL9083903754893948069.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL9083903754893948069.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4519647171100867261.hoa
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t14, t22, t26, t30, t34, t42, t46, t54, t58, t62, t65, t72, t73, t76, t77, t80, t81,...450
Detected timeout of ITS tools.
[2023-03-15 22:12:48] [INFO ] Flatten gal took : 13 ms
[2023-03-15 22:12:48] [INFO ] Flatten gal took : 12 ms
[2023-03-15 22:12:48] [INFO ] Time to serialize gal into /tmp/LTL17735292021841967477.gal : 3 ms
[2023-03-15 22:12:48] [INFO ] Time to serialize properties into /tmp/LTL16824957117553058057.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17735292021841967477.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16824957117553058057.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((!(X(!(G((F(((F("((press_stop==1)&&(blank_forged==1))"))&&("(table_bottom_pos==1)"))&&("(TL_lower_run==1)")))||("((crane_to_belt2==...226
Formula 0 simplified : !"((press_stop==1)&&(blank_forged==1))" & X(!"((press_stop==1)&&(blank_forged==1))" W F(!"((crane_to_belt2==1)&&(CU_trans_rs==1))" &...251
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t14, t22, t26, t30, t34, t42, t46, t54, t58, t62, t65, t72, t73, t76, t77, t80, t81,...450
Detected timeout of ITS tools.
[2023-03-15 22:13:03] [INFO ] Flatten gal took : 13 ms
[2023-03-15 22:13:03] [INFO ] Applying decomposition
[2023-03-15 22:13:03] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph15204774088566647938.txt' '-o' '/tmp/graph15204774088566647938.bin' '-w' '/tmp/graph15204774088566647938.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph15204774088566647938.bin' '-l' '-1' '-v' '-w' '/tmp/graph15204774088566647938.weights' '-q' '0' '-e' '0.001'
[2023-03-15 22:13:03] [INFO ] Decomposing Gal with order
[2023-03-15 22:13:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 22:13:03] [INFO ] Removed a total of 49 redundant transitions.
[2023-03-15 22:13:03] [INFO ] Flatten gal took : 112 ms
[2023-03-15 22:13:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 17 ms.
[2023-03-15 22:13:04] [INFO ] Time to serialize gal into /tmp/LTL2961285401771850058.gal : 10 ms
[2023-03-15 22:13:04] [INFO ] Time to serialize properties into /tmp/LTL15398083387994482016.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2961285401771850058.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15398083387994482016.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((!(X(!(G((F(((F("((i0.i0.u8.press_stop==1)&&(i0.i0.u6.blank_forged==1))"))&&("(i1.i1.u13.table_bottom_pos==1)"))&&("(i1.i1.u12.TL_l...302
Formula 0 simplified : !"((i0.i0.u8.press_stop==1)&&(i0.i0.u6.blank_forged==1))" & X(!"((i0.i0.u8.press_stop==1)&&(i0.i0.u6.blank_forged==1))" W F(!"((i9.i...345
Reverse transition relation is NOT exact ! Due to transitions t10, t14, t62, t117, t120, i0.i0.t6, i1.i0.u2.t22, i1.i0.u14.t34, i1.i0.u16.t30, i1.i1.u12.t2...809
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16997720876073962289
[2023-03-15 22:13:19] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16997720876073962289
Running compilation step : cd /tmp/ltsmin16997720876073962289;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 420 ms.
Running link step : cd /tmp/ltsmin16997720876073962289;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin16997720876073962289;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(!X()&&(LTLAPp0==true)))||(LTLAPp2==true)))) U (LTLAPp1==true))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ParamProductionCell-PT-2-LTLFireability-02 finished in 121381 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((G(p1)||p0))&&F(G(p2)))))'
Support contains 7 out of 199 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 199/199 places, 198/198 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 199 transition count 185
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 186 transition count 183
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 30 place count 184 transition count 183
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 30 place count 184 transition count 164
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 68 place count 165 transition count 164
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 70 place count 163 transition count 162
Iterating global reduction 3 with 2 rules applied. Total rules applied 72 place count 163 transition count 162
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 128 place count 135 transition count 134
Applied a total of 128 rules in 23 ms. Remains 135 /199 variables (removed 64) and now considering 134/198 (removed 64) transitions.
// Phase 1: matrix 134 rows 135 cols
[2023-03-15 22:13:34] [INFO ] Computed 31 place invariants in 1 ms
[2023-03-15 22:13:34] [INFO ] Implicit Places using invariants in 177 ms returned [12, 19, 42, 52, 55, 118, 121, 123]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 188 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 127/199 places, 134/198 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 127 transition count 132
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 125 transition count 132
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 6 place count 123 transition count 130
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 123 transition count 130
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 24 place count 115 transition count 122
Applied a total of 24 rules in 20 ms. Remains 115 /127 variables (removed 12) and now considering 122/134 (removed 12) transitions.
// Phase 1: matrix 122 rows 115 cols
[2023-03-15 22:13:34] [INFO ] Computed 23 place invariants in 2 ms
[2023-03-15 22:13:34] [INFO ] Implicit Places using invariants in 164 ms returned []
[2023-03-15 22:13:34] [INFO ] Invariant cache hit.
[2023-03-15 22:13:34] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:13:34] [INFO ] Implicit Places using invariants and state equation in 421 ms returned []
Implicit Place search using SMT with State Equation took 600 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 115/199 places, 122/198 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 832 ms. Remains : 115/199 places, 122/198 transitions.
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2)]
Running random walk in product with property : ParamProductionCell-PT-2-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s40 0) (EQ s56 0)), p1:(OR (EQ s19 0) (EQ s20 0) (EQ s24 0)), p2:(AND (EQ s44 1) (EQ s46 1))], nbAcceptance=1, 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 0 reset in 216 ms.
Stack based approach found an accepted trace after 213 steps with 0 reset with depth 214 and stack size 214 in 1 ms.
FORMULA ParamProductionCell-PT-2-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-2-LTLFireability-04 finished in 1225 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 4 out of 199 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 199/199 places, 198/198 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 199 transition count 182
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 183 transition count 182
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 32 place count 183 transition count 164
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 68 place count 165 transition count 164
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 70 place count 163 transition count 162
Iterating global reduction 2 with 2 rules applied. Total rules applied 72 place count 163 transition count 162
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 138 place count 130 transition count 129
Applied a total of 138 rules in 34 ms. Remains 130 /199 variables (removed 69) and now considering 129/198 (removed 69) transitions.
// Phase 1: matrix 129 rows 130 cols
[2023-03-15 22:13:35] [INFO ] Computed 31 place invariants in 1 ms
[2023-03-15 22:13:35] [INFO ] Implicit Places using invariants in 248 ms returned [13, 20, 27, 41, 51, 52, 54, 66, 113, 116, 118]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 259 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 119/199 places, 129/198 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 119 transition count 126
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 116 transition count 126
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 116 transition count 124
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 114 transition count 124
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 12 place count 112 transition count 122
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 112 transition count 122
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 66 place count 86 transition count 96
Applied a total of 66 rules in 20 ms. Remains 86 /119 variables (removed 33) and now considering 96/129 (removed 33) transitions.
// Phase 1: matrix 96 rows 86 cols
[2023-03-15 22:13:35] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-15 22:13:35] [INFO ] Implicit Places using invariants in 209 ms returned []
[2023-03-15 22:13:35] [INFO ] Invariant cache hit.
[2023-03-15 22:13:36] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:13:36] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 470 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 86/199 places, 96/198 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 784 ms. Remains : 86/199 places, 96/198 transitions.
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ParamProductionCell-PT-2-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s16 1) (EQ s20 1)), p0:(AND (EQ s40 1) (EQ s50 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 198 reset in 245 ms.
Stack based approach found an accepted trace after 143 steps with 0 reset with depth 144 and stack size 144 in 0 ms.
FORMULA ParamProductionCell-PT-2-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-2-LTLFireability-07 finished in 1153 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 4 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 197 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 197 transition count 196
Applied a total of 4 rules in 9 ms. Remains 197 /199 variables (removed 2) and now considering 196/198 (removed 2) transitions.
// Phase 1: matrix 196 rows 197 cols
[2023-03-15 22:13:36] [INFO ] Computed 31 place invariants in 2 ms
[2023-03-15 22:13:36] [INFO ] Implicit Places using invariants in 273 ms returned [16, 27, 38, 65, 84, 85, 87, 99, 169, 174]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 288 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/199 places, 196/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 194
Applied a total of 4 rules in 9 ms. Remains 185 /187 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 185 cols
[2023-03-15 22:13:36] [INFO ] Computed 21 place invariants in 2 ms
[2023-03-15 22:13:37] [INFO ] Implicit Places using invariants in 179 ms returned []
[2023-03-15 22:13:37] [INFO ] Invariant cache hit.
[2023-03-15 22:13:37] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:13:37] [INFO ] Implicit Places using invariants and state equation in 567 ms returned []
Implicit Place search using SMT with State Equation took 756 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/199 places, 194/198 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1063 ms. Remains : 185/199 places, 194/198 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ParamProductionCell-PT-2-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (EQ s84 1) (EQ s104 1)), p0:(AND (EQ s166 1) (EQ s179 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 78 reset in 191 ms.
Stack based approach found an accepted trace after 432 steps with 0 reset with depth 433 and stack size 433 in 2 ms.
FORMULA ParamProductionCell-PT-2-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-2-LTLFireability-08 finished in 1429 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 197 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 197 transition count 196
Applied a total of 4 rules in 6 ms. Remains 197 /199 variables (removed 2) and now considering 196/198 (removed 2) transitions.
// Phase 1: matrix 196 rows 197 cols
[2023-03-15 22:13:37] [INFO ] Computed 31 place invariants in 6 ms
[2023-03-15 22:13:38] [INFO ] Implicit Places using invariants in 312 ms returned [16, 27, 38, 65, 84, 85, 87, 99, 169, 174]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 315 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/199 places, 196/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 194
Applied a total of 4 rules in 6 ms. Remains 185 /187 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 185 cols
[2023-03-15 22:13:38] [INFO ] Computed 21 place invariants in 2 ms
[2023-03-15 22:13:38] [INFO ] Implicit Places using invariants in 203 ms returned []
[2023-03-15 22:13:38] [INFO ] Invariant cache hit.
[2023-03-15 22:13:38] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:13:39] [INFO ] Implicit Places using invariants and state equation in 579 ms returned []
Implicit Place search using SMT with State Equation took 785 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/199 places, 194/198 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1112 ms. Remains : 185/199 places, 194/198 transitions.
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-2-LTLFireability-09 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 (EQ s166 0) (EQ s179 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-2-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-2-LTLFireability-09 finished in 1248 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(!X(X(p0))) U p1)&&F(p2)))'
Support contains 7 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 197 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 197 transition count 196
Applied a total of 4 rules in 7 ms. Remains 197 /199 variables (removed 2) and now considering 196/198 (removed 2) transitions.
// Phase 1: matrix 196 rows 197 cols
[2023-03-15 22:13:39] [INFO ] Computed 31 place invariants in 2 ms
[2023-03-15 22:13:39] [INFO ] Implicit Places using invariants in 317 ms returned [16, 38, 65, 84, 85, 87, 99, 169, 174, 178]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 319 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/199 places, 196/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 194
Applied a total of 4 rules in 5 ms. Remains 185 /187 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 185 cols
[2023-03-15 22:13:39] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-15 22:13:39] [INFO ] Implicit Places using invariants in 165 ms returned []
[2023-03-15 22:13:39] [INFO ] Invariant cache hit.
[2023-03-15 22:13:39] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:13:40] [INFO ] Implicit Places using invariants and state equation in 478 ms returned []
Implicit Place search using SMT with State Equation took 654 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/199 places, 194/198 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 987 ms. Remains : 185/199 places, 194/198 transitions.
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (OR (NOT p1) p0), p0]
Running random walk in product with property : ParamProductionCell-PT-2-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s173 1) (EQ s180 1)), p1:(AND (EQ s17 1) (EQ s26 1) (EQ s29 1)), p0:(AND (EQ s79 1) (EQ s99 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1137 reset in 211 ms.
Product exploration explored 100000 steps with 1227 reset in 255 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 p2) (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p2)), (X (X (NOT p1))), (X (X (NOT p2))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 350 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(OR (NOT p1) (NOT p2) p0), (NOT p2), (OR (NOT p1) p0), p0]
Finished random walk after 1043 steps, including 0 resets, run visited all 3 properties in 23 ms. (steps per millisecond=45 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p2)), (X (X (NOT p1))), (X (X (NOT p2))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p2), (F p0), (F p1)]
Knowledge based reduction with 6 factoid took 467 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p1) (NOT p2) p0), (NOT p2), (OR (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p1) (NOT p2) p0), (NOT p2), (OR (NOT p1) p0), p0]
[2023-03-15 22:13:42] [INFO ] Invariant cache hit.
[2023-03-15 22:13:42] [INFO ] [Real]Absence check using 18 positive place invariants in 16 ms returned sat
[2023-03-15 22:13:42] [INFO ] [Real]Absence check using 18 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-15 22:13:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:13:42] [INFO ] [Real]Absence check using state equation in 342 ms returned sat
[2023-03-15 22:13:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:13:43] [INFO ] [Nat]Absence check using 18 positive place invariants in 16 ms returned sat
[2023-03-15 22:13:43] [INFO ] [Nat]Absence check using 18 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-15 22:13:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:13:43] [INFO ] [Nat]Absence check using state equation in 266 ms returned sat
[2023-03-15 22:13:43] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:13:43] [INFO ] [Nat]Added 68 Read/Feed constraints in 27 ms returned sat
[2023-03-15 22:13:43] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 1 ms to minimize.
[2023-03-15 22:13:43] [INFO ] Deduced a trap composed of 77 places in 109 ms of which 1 ms to minimize.
[2023-03-15 22:13:43] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 0 ms to minimize.
[2023-03-15 22:13:44] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 1 ms to minimize.
[2023-03-15 22:13:44] [INFO ] Deduced a trap composed of 42 places in 100 ms of which 1 ms to minimize.
[2023-03-15 22:13:44] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 0 ms to minimize.
[2023-03-15 22:13:44] [INFO ] Deduced a trap composed of 57 places in 88 ms of which 1 ms to minimize.
[2023-03-15 22:13:44] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 0 ms to minimize.
[2023-03-15 22:13:44] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 1 ms to minimize.
[2023-03-15 22:13:44] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 0 ms to minimize.
[2023-03-15 22:13:44] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 1 ms to minimize.
[2023-03-15 22:13:44] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 1 ms to minimize.
[2023-03-15 22:13:45] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 0 ms to minimize.
[2023-03-15 22:13:45] [INFO ] Deduced a trap composed of 41 places in 102 ms of which 1 ms to minimize.
[2023-03-15 22:13:45] [INFO ] Deduced a trap composed of 51 places in 104 ms of which 1 ms to minimize.
[2023-03-15 22:13:45] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 0 ms to minimize.
[2023-03-15 22:13:45] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 2 ms to minimize.
[2023-03-15 22:13:45] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 1 ms to minimize.
[2023-03-15 22:13:45] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 1 ms to minimize.
[2023-03-15 22:13:46] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 1 ms to minimize.
[2023-03-15 22:13:46] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 1 ms to minimize.
[2023-03-15 22:13:46] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 0 ms to minimize.
[2023-03-15 22:13:46] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 1 ms to minimize.
[2023-03-15 22:13:46] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 2960 ms
[2023-03-15 22:13:46] [INFO ] Computed and/alt/rep : 192/311/192 causal constraints (skipped 0 transitions) in 26 ms.
[2023-03-15 22:13:47] [INFO ] Added : 164 causal constraints over 33 iterations in 954 ms. Result :sat
Could not prove EG (NOT p1)
[2023-03-15 22:13:47] [INFO ] Invariant cache hit.
[2023-03-15 22:13:47] [INFO ] [Real]Absence check using 18 positive place invariants in 14 ms returned sat
[2023-03-15 22:13:47] [INFO ] [Real]Absence check using 18 positive and 3 generalized place invariants in 9 ms returned sat
[2023-03-15 22:13:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:13:48] [INFO ] [Real]Absence check using state equation in 397 ms returned sat
[2023-03-15 22:13:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:13:48] [INFO ] [Nat]Absence check using 18 positive place invariants in 15 ms returned sat
[2023-03-15 22:13:48] [INFO ] [Nat]Absence check using 18 positive and 3 generalized place invariants in 6 ms returned sat
[2023-03-15 22:13:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:13:48] [INFO ] [Nat]Absence check using state equation in 382 ms returned sat
[2023-03-15 22:13:48] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:13:48] [INFO ] [Nat]Added 68 Read/Feed constraints in 30 ms returned sat
[2023-03-15 22:13:48] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 1 ms to minimize.
[2023-03-15 22:13:48] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 1 ms to minimize.
[2023-03-15 22:13:49] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 1 ms to minimize.
[2023-03-15 22:13:49] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 0 ms to minimize.
[2023-03-15 22:13:49] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 1 ms to minimize.
[2023-03-15 22:13:49] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 0 ms to minimize.
[2023-03-15 22:13:49] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 1 ms to minimize.
[2023-03-15 22:13:49] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 1 ms to minimize.
[2023-03-15 22:13:49] [INFO ] Deduced a trap composed of 39 places in 87 ms of which 1 ms to minimize.
[2023-03-15 22:13:49] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 0 ms to minimize.
[2023-03-15 22:13:50] [INFO ] Deduced a trap composed of 6 places in 106 ms of which 1 ms to minimize.
[2023-03-15 22:13:50] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 0 ms to minimize.
[2023-03-15 22:13:50] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 1 ms to minimize.
[2023-03-15 22:13:50] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 0 ms to minimize.
[2023-03-15 22:13:50] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 3 ms to minimize.
[2023-03-15 22:13:50] [INFO ] Deduced a trap composed of 33 places in 97 ms of which 1 ms to minimize.
[2023-03-15 22:13:50] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 1 ms to minimize.
[2023-03-15 22:13:51] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 1 ms to minimize.
[2023-03-15 22:13:51] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2023-03-15 22:13:51] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2406 ms
[2023-03-15 22:13:51] [INFO ] Computed and/alt/rep : 192/311/192 causal constraints (skipped 0 transitions) in 24 ms.
[2023-03-15 22:13:52] [INFO ] Added : 172 causal constraints over 35 iterations in 1266 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 7 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 194/194 transitions.
Applied a total of 0 rules in 3 ms. Remains 185 /185 variables (removed 0) and now considering 194/194 (removed 0) transitions.
[2023-03-15 22:13:52] [INFO ] Invariant cache hit.
[2023-03-15 22:13:52] [INFO ] Implicit Places using invariants in 187 ms returned []
[2023-03-15 22:13:52] [INFO ] Invariant cache hit.
[2023-03-15 22:13:52] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:13:53] [INFO ] Implicit Places using invariants and state equation in 524 ms returned []
Implicit Place search using SMT with State Equation took 715 ms to find 0 implicit places.
[2023-03-15 22:13:53] [INFO ] Invariant cache hit.
[2023-03-15 22:13:53] [INFO ] Dead Transitions using invariants and state equation in 290 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1010 ms. Remains : 185/185 places, 194/194 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 p2) (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p2)), (X (X (NOT p1))), (X (X (NOT p2))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 367 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[(OR (NOT p1) (NOT p2) p0), (NOT p2), (OR (NOT p1) p0), p0]
Finished random walk after 1042 steps, including 0 resets, run visited all 3 properties in 8 ms. (steps per millisecond=130 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p2)), (X (X (NOT p1))), (X (X (NOT p2))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p2), (F p0), (F p1)]
Knowledge based reduction with 6 factoid took 457 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p1) (NOT p2) p0), (NOT p2), (OR (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 212 ms :[(OR (NOT p1) (NOT p2) p0), (NOT p2), (OR (NOT p1) p0), p0]
[2023-03-15 22:13:54] [INFO ] Invariant cache hit.
[2023-03-15 22:13:55] [INFO ] [Real]Absence check using 18 positive place invariants in 15 ms returned sat
[2023-03-15 22:13:55] [INFO ] [Real]Absence check using 18 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-15 22:13:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:13:55] [INFO ] [Real]Absence check using state equation in 341 ms returned sat
[2023-03-15 22:13:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:13:55] [INFO ] [Nat]Absence check using 18 positive place invariants in 16 ms returned sat
[2023-03-15 22:13:55] [INFO ] [Nat]Absence check using 18 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-15 22:13:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:13:56] [INFO ] [Nat]Absence check using state equation in 271 ms returned sat
[2023-03-15 22:13:56] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:13:56] [INFO ] [Nat]Added 68 Read/Feed constraints in 27 ms returned sat
[2023-03-15 22:13:56] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 0 ms to minimize.
[2023-03-15 22:13:56] [INFO ] Deduced a trap composed of 77 places in 114 ms of which 1 ms to minimize.
[2023-03-15 22:13:56] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 1 ms to minimize.
[2023-03-15 22:13:56] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 1 ms to minimize.
[2023-03-15 22:13:56] [INFO ] Deduced a trap composed of 42 places in 99 ms of which 1 ms to minimize.
[2023-03-15 22:13:56] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 0 ms to minimize.
[2023-03-15 22:13:56] [INFO ] Deduced a trap composed of 57 places in 89 ms of which 1 ms to minimize.
[2023-03-15 22:13:57] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 1 ms to minimize.
[2023-03-15 22:13:57] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 1 ms to minimize.
[2023-03-15 22:13:57] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 0 ms to minimize.
[2023-03-15 22:13:57] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 0 ms to minimize.
[2023-03-15 22:13:57] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 1 ms to minimize.
[2023-03-15 22:13:57] [INFO ] Deduced a trap composed of 39 places in 108 ms of which 1 ms to minimize.
[2023-03-15 22:13:57] [INFO ] Deduced a trap composed of 41 places in 110 ms of which 1 ms to minimize.
[2023-03-15 22:13:57] [INFO ] Deduced a trap composed of 51 places in 108 ms of which 0 ms to minimize.
[2023-03-15 22:13:58] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 1 ms to minimize.
[2023-03-15 22:13:58] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 1 ms to minimize.
[2023-03-15 22:13:58] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 1 ms to minimize.
[2023-03-15 22:13:58] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 1 ms to minimize.
[2023-03-15 22:13:58] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 1 ms to minimize.
[2023-03-15 22:13:58] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 1 ms to minimize.
[2023-03-15 22:13:58] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 1 ms to minimize.
[2023-03-15 22:13:59] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 1 ms to minimize.
[2023-03-15 22:13:59] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 2953 ms
[2023-03-15 22:13:59] [INFO ] Computed and/alt/rep : 192/311/192 causal constraints (skipped 0 transitions) in 23 ms.
[2023-03-15 22:13:59] [INFO ] Added : 164 causal constraints over 33 iterations in 965 ms. Result :sat
Could not prove EG (NOT p1)
[2023-03-15 22:13:59] [INFO ] Invariant cache hit.
[2023-03-15 22:14:00] [INFO ] [Real]Absence check using 18 positive place invariants in 15 ms returned sat
[2023-03-15 22:14:00] [INFO ] [Real]Absence check using 18 positive and 3 generalized place invariants in 8 ms returned sat
[2023-03-15 22:14:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:14:00] [INFO ] [Real]Absence check using state equation in 406 ms returned sat
[2023-03-15 22:14:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:14:00] [INFO ] [Nat]Absence check using 18 positive place invariants in 16 ms returned sat
[2023-03-15 22:14:00] [INFO ] [Nat]Absence check using 18 positive and 3 generalized place invariants in 7 ms returned sat
[2023-03-15 22:14:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:14:01] [INFO ] [Nat]Absence check using state equation in 383 ms returned sat
[2023-03-15 22:14:01] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:14:01] [INFO ] [Nat]Added 68 Read/Feed constraints in 30 ms returned sat
[2023-03-15 22:14:01] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 1 ms to minimize.
[2023-03-15 22:14:01] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 1 ms to minimize.
[2023-03-15 22:14:01] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 1 ms to minimize.
[2023-03-15 22:14:01] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 0 ms to minimize.
[2023-03-15 22:14:01] [INFO ] Deduced a trap composed of 7 places in 110 ms of which 1 ms to minimize.
[2023-03-15 22:14:02] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 0 ms to minimize.
[2023-03-15 22:14:02] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 0 ms to minimize.
[2023-03-15 22:14:02] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 1 ms to minimize.
[2023-03-15 22:14:02] [INFO ] Deduced a trap composed of 39 places in 85 ms of which 1 ms to minimize.
[2023-03-15 22:14:02] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 0 ms to minimize.
[2023-03-15 22:14:02] [INFO ] Deduced a trap composed of 6 places in 102 ms of which 0 ms to minimize.
[2023-03-15 22:14:02] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 1 ms to minimize.
[2023-03-15 22:14:02] [INFO ] Deduced a trap composed of 17 places in 109 ms of which 1 ms to minimize.
[2023-03-15 22:14:03] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 1 ms to minimize.
[2023-03-15 22:14:03] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 0 ms to minimize.
[2023-03-15 22:14:03] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 1 ms to minimize.
[2023-03-15 22:14:03] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 1 ms to minimize.
[2023-03-15 22:14:03] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 0 ms to minimize.
[2023-03-15 22:14:03] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
[2023-03-15 22:14:03] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2446 ms
[2023-03-15 22:14:03] [INFO ] Computed and/alt/rep : 192/311/192 causal constraints (skipped 0 transitions) in 24 ms.
[2023-03-15 22:14:05] [INFO ] Added : 172 causal constraints over 35 iterations in 1277 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p1) (NOT p2) p0), (NOT p2), (OR (NOT p1) p0), p0]
Product exploration explored 100000 steps with 1197 reset in 226 ms.
Product exploration explored 100000 steps with 1167 reset in 265 ms.
Applying partial POR strategy [false, true, false, true]
Stuttering acceptance computed with spot in 251 ms :[(OR (NOT p1) (NOT p2) p0), (NOT p2), (OR (NOT p1) p0), p0]
Support contains 7 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 194/194 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 185 transition count 194
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 14 Pre rules applied. Total rules applied 36 place count 185 transition count 194
Deduced a syphon composed of 50 places in 1 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 50 place count 185 transition count 194
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 58 place count 177 transition count 186
Deduced a syphon composed of 42 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 66 place count 177 transition count 186
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 88 places in 0 ms
Iterating global reduction 1 with 46 rules applied. Total rules applied 112 place count 177 transition count 186
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 141 place count 148 transition count 157
Deduced a syphon composed of 59 places in 1 ms
Iterating global reduction 1 with 29 rules applied. Total rules applied 170 place count 148 transition count 157
Deduced a syphon composed of 59 places in 0 ms
Applied a total of 170 rules in 33 ms. Remains 148 /185 variables (removed 37) and now considering 157/194 (removed 37) transitions.
[2023-03-15 22:14:06] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 157 rows 148 cols
[2023-03-15 22:14:06] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-15 22:14:06] [INFO ] Dead Transitions using invariants and state equation in 238 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 148/185 places, 157/194 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 292 ms. Remains : 148/185 places, 157/194 transitions.
Built C files in :
/tmp/ltsmin11235528744818948383
[2023-03-15 22:14:06] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11235528744818948383
Running compilation step : cd /tmp/ltsmin11235528744818948383;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 672 ms.
Running link step : cd /tmp/ltsmin11235528744818948383;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin11235528744818948383;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2559013581497055857.hoa' '--buchi-type=spotba'
LTSmin run took 11184 ms.
FORMULA ParamProductionCell-PT-2-LTLFireability-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-2-LTLFireability-10 finished in 39174 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0) U (p1 U p2))||(p3 U p2)))'
Support contains 8 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 197 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 197 transition count 196
Applied a total of 4 rules in 7 ms. Remains 197 /199 variables (removed 2) and now considering 196/198 (removed 2) transitions.
// Phase 1: matrix 196 rows 197 cols
[2023-03-15 22:14:18] [INFO ] Computed 31 place invariants in 2 ms
[2023-03-15 22:14:18] [INFO ] Implicit Places using invariants in 265 ms returned [16, 27, 38, 65, 84, 99, 169, 174, 178]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 268 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/199 places, 196/198 transitions.
Applied a total of 0 rules in 3 ms. Remains 188 /188 variables (removed 0) and now considering 196/196 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 278 ms. Remains : 188/199 places, 196/198 transitions.
Stuttering acceptance computed with spot in 474 ms :[true, (OR (NOT p2) (NOT p0)), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : ParamProductionCell-PT-2-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p3), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) p1 p3), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p3) p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p3 p0), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p3) p0), acceptance={0} source=3 dest: 4}, { cond=(AND (NOT p2) p1 p3 p0), acceptance={0} source=3 dest: 5}, { cond=(AND (NOT p2) p3 (NOT p0)), acceptance={0} source=3 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=4 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3) (NOT p0)), acceptance={0} source=5 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p3) p0), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p3 p0), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p3) p0), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p2) p1 p3 p0), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p2) p1 (NOT p3) (NOT p0)), acceptance={0} source=5 dest: 6}, { cond=(AND (NOT p2) p1 p3 (NOT p0)), acceptance={0} source=5 dest: 7}, { cond=(AND (NOT p2) (NOT p1) p3 (NOT p0)), acceptance={0} source=5 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={0} source=7 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0} source=7 dest: 6}, { cond=(AND (NOT p2) p1 p3), acceptance={0} source=7 dest: 7}, { cond=(AND (NOT p2) (NOT p1) p3), acceptance={0} source=7 dest: 8}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=8 dest: 0}, { cond=(AND (NOT p2) p3), acceptance={0} source=8 dest: 8}]], initial=2, aps=[p0:(AND (EQ s2 1) (EQ s160 1)), p2:(AND (EQ s80 1) (EQ s128 1)), p1:(AND (EQ s78 1) (EQ s124 1)), p3:(AND (EQ s82 1) (EQ s89 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-2-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-2-LTLFireability-11 finished in 786 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||G((X(p2)&&p1))))))'
Support contains 5 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 197 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 197 transition count 196
Applied a total of 4 rules in 6 ms. Remains 197 /199 variables (removed 2) and now considering 196/198 (removed 2) transitions.
[2023-03-15 22:14:19] [INFO ] Invariant cache hit.
[2023-03-15 22:14:19] [INFO ] Implicit Places using invariants in 289 ms returned [16, 27, 38, 65, 84, 85, 87, 99, 174, 178]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 291 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/199 places, 196/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 194
Applied a total of 4 rules in 6 ms. Remains 185 /187 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 185 cols
[2023-03-15 22:14:19] [INFO ] Computed 21 place invariants in 2 ms
[2023-03-15 22:14:19] [INFO ] Implicit Places using invariants in 189 ms returned []
[2023-03-15 22:14:19] [INFO ] Invariant cache hit.
[2023-03-15 22:14:19] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:14:20] [INFO ] Implicit Places using invariants and state equation in 583 ms returned []
Implicit Place search using SMT with State Equation took 774 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/199 places, 194/198 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1079 ms. Remains : 185/199 places, 194/198 transitions.
Stuttering acceptance computed with spot in 241 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : ParamProductionCell-PT-2-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p2), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p0:(AND (EQ s83 1) (EQ s121 1)), p1:(AND (EQ s159 1) (EQ s178 1)), p2:(OR (EQ s159 0) (EQ s178 0) (EQ s164 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-2-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-2-LTLFireability-12 finished in 1344 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G((X(p2)||p1)))))'
Support contains 6 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 198/198 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 198 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 198 transition count 197
Applied a total of 2 rules in 5 ms. Remains 198 /199 variables (removed 1) and now considering 197/198 (removed 1) transitions.
// Phase 1: matrix 197 rows 198 cols
[2023-03-15 22:14:20] [INFO ] Computed 31 place invariants in 2 ms
[2023-03-15 22:14:20] [INFO ] Implicit Places using invariants in 302 ms returned [16, 27, 38, 65, 85, 87, 100, 170, 175, 179]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 304 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/199 places, 197/198 transitions.
Applied a total of 0 rules in 3 ms. Remains 188 /188 variables (removed 0) and now considering 197/197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 312 ms. Remains : 188/199 places, 197/198 transitions.
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : ParamProductionCell-PT-2-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s85 0) (EQ s124 0)), p0:(AND (EQ s14 1) (EQ s118 1)), p2:(OR (EQ s80 0) (EQ s86 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 2220 reset in 249 ms.
Product exploration explored 100000 steps with 2219 reset in 277 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 p1 (NOT p0) p2), (X (AND p1 (NOT p0) p2)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (X (AND p1 (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 627 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter sensitive) to 2 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 197 rows 188 cols
[2023-03-15 22:14:22] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-15 22:14:22] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 22:14:22] [INFO ] [Nat]Absence check using 18 positive place invariants in 15 ms returned sat
[2023-03-15 22:14:22] [INFO ] [Nat]Absence check using 18 positive and 3 generalized place invariants in 6 ms returned sat
[2023-03-15 22:14:22] [INFO ] After 85ms 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 p1 (NOT p0) p2), (X (AND p1 (NOT p0) p2)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (X (AND p1 (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1) p2)), (F (NOT (AND (NOT p0) p1 p2)))]
Knowledge based reduction with 14 factoid took 914 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter sensitive) to 2 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 6 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 197/197 transitions.
Applied a total of 0 rules in 4 ms. Remains 188 /188 variables (removed 0) and now considering 197/197 (removed 0) transitions.
[2023-03-15 22:14:23] [INFO ] Invariant cache hit.
[2023-03-15 22:14:23] [INFO ] Implicit Places using invariants in 166 ms returned []
[2023-03-15 22:14:23] [INFO ] Invariant cache hit.
[2023-03-15 22:14:24] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:14:24] [INFO ] Implicit Places using invariants and state equation in 551 ms returned []
Implicit Place search using SMT with State Equation took 734 ms to find 0 implicit places.
[2023-03-15 22:14:24] [INFO ] Invariant cache hit.
[2023-03-15 22:14:24] [INFO ] Dead Transitions using invariants and state equation in 281 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1020 ms. Remains : 188/188 places, 197/197 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 p0) p1 p2), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1 p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 528 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter sensitive) to 2 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Finished random walk after 188 steps, including 0 resets, run visited all 4 properties in 5 ms. (steps per millisecond=37 )
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1 p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p0)))), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND p1 (NOT p0) p2)))]
Knowledge based reduction with 9 factoid took 661 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter sensitive) to 2 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 2225 reset in 239 ms.
Product exploration explored 100000 steps with 2218 reset in 272 ms.
Built C files in :
/tmp/ltsmin11471198408505677225
[2023-03-15 22:14:26] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11471198408505677225
Running compilation step : cd /tmp/ltsmin11471198408505677225;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 697 ms.
Running link step : cd /tmp/ltsmin11471198408505677225;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin11471198408505677225;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10795955914725081831.hoa' '--buchi-type=spotba'
LTSmin run took 261 ms.
FORMULA ParamProductionCell-PT-2-LTLFireability-13 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-2-LTLFireability-13 finished in 7504 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 199 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 199/199 places, 198/198 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 199 transition count 181
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 182 transition count 181
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 34 place count 182 transition count 164
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 68 place count 165 transition count 164
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 69 place count 164 transition count 163
Iterating global reduction 2 with 1 rules applied. Total rules applied 70 place count 164 transition count 163
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 138 place count 130 transition count 129
Applied a total of 138 rules in 27 ms. Remains 130 /199 variables (removed 69) and now considering 129/198 (removed 69) transitions.
// Phase 1: matrix 129 rows 130 cols
[2023-03-15 22:14:28] [INFO ] Computed 31 place invariants in 2 ms
[2023-03-15 22:14:28] [INFO ] Implicit Places using invariants in 425 ms returned [12, 19, 26, 40, 50, 51, 65, 113, 116, 118]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 437 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 120/199 places, 129/198 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 120 transition count 127
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 118 transition count 127
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 118 transition count 126
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 117 transition count 126
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 44 place count 98 transition count 107
Applied a total of 44 rules in 27 ms. Remains 98 /120 variables (removed 22) and now considering 107/129 (removed 22) transitions.
// Phase 1: matrix 107 rows 98 cols
[2023-03-15 22:14:28] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-15 22:14:28] [INFO ] Implicit Places using invariants in 148 ms returned []
[2023-03-15 22:14:28] [INFO ] Invariant cache hit.
[2023-03-15 22:14:28] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:14:28] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 462 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 98/199 places, 107/198 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 955 ms. Remains : 98/199 places, 107/198 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-2-LTLFireability-14 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 s38 1) (EQ s56 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 206 ms.
Stack based approach found an accepted trace after 149 steps with 0 reset with depth 150 and stack size 150 in 0 ms.
FORMULA ParamProductionCell-PT-2-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-2-LTLFireability-14 finished in 1231 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((F(p0)&&X((F(G(p2))&&p1)))))))'
Support contains 6 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 197 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 197 transition count 196
Applied a total of 4 rules in 5 ms. Remains 197 /199 variables (removed 2) and now considering 196/198 (removed 2) transitions.
// Phase 1: matrix 196 rows 197 cols
[2023-03-15 22:14:29] [INFO ] Computed 31 place invariants in 2 ms
[2023-03-15 22:14:29] [INFO ] Implicit Places using invariants in 307 ms returned [16, 27, 38, 84, 85, 87, 99, 174, 178]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 308 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/199 places, 196/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 186 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 186 transition count 194
Applied a total of 4 rules in 7 ms. Remains 186 /188 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 186 cols
[2023-03-15 22:14:29] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-15 22:14:29] [INFO ] Implicit Places using invariants in 196 ms returned []
[2023-03-15 22:14:29] [INFO ] Invariant cache hit.
[2023-03-15 22:14:29] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:14:30] [INFO ] Implicit Places using invariants and state equation in 565 ms returned []
Implicit Place search using SMT with State Equation took 763 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 186/199 places, 194/198 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1083 ms. Remains : 186/199 places, 194/198 transitions.
Stuttering acceptance computed with spot in 429 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : ParamProductionCell-PT-2-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=true, acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 6}, { cond=p1, acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=p2, acceptance={} source=7 dest: 7}, { cond=(NOT p2), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(OR (EQ s160 0) (EQ s175 0)), p1:(AND (EQ s62 1) (EQ s64 1)), p2:(AND (EQ s84 1) (EQ s147 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], 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 4 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-2-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-2-LTLFireability-15 finished in 1550 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!X(!G((F((F(p1)&&p0))||p2))) U p1))'
Found a Lengthening insensitive property : ParamProductionCell-PT-2-LTLFireability-02
Stuttering acceptance computed with spot in 286 ms :[(NOT p1), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1)]
Support contains 6 out of 199 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 199/199 places, 198/198 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 199 transition count 183
Reduce places removed 15 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 16 rules applied. Total rules applied 31 place count 184 transition count 182
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 32 place count 183 transition count 182
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 32 place count 183 transition count 164
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 68 place count 165 transition count 164
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 70 place count 163 transition count 162
Iterating global reduction 3 with 2 rules applied. Total rules applied 72 place count 163 transition count 162
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 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 132 place count 133 transition count 132
Applied a total of 132 rules in 22 ms. Remains 133 /199 variables (removed 66) and now considering 132/198 (removed 66) transitions.
// Phase 1: matrix 132 rows 133 cols
[2023-03-15 22:14:31] [INFO ] Computed 31 place invariants in 1 ms
[2023-03-15 22:14:31] [INFO ] Implicit Places using invariants in 247 ms returned [21, 28, 43, 53, 54, 56, 68, 115, 121]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 262 ms to find 9 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 124/199 places, 132/198 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 124 transition count 129
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 121 transition count 129
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 121 transition count 127
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 119 transition count 127
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 12 place count 117 transition count 125
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 117 transition count 125
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 58 place count 95 transition count 103
Applied a total of 58 rules in 15 ms. Remains 95 /124 variables (removed 29) and now considering 103/132 (removed 29) transitions.
// Phase 1: matrix 103 rows 95 cols
[2023-03-15 22:14:31] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-15 22:14:31] [INFO ] Implicit Places using invariants in 159 ms returned []
[2023-03-15 22:14:31] [INFO ] Invariant cache hit.
[2023-03-15 22:14:31] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:14:31] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 417 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 95/199 places, 103/198 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 717 ms. Remains : 95/199 places, 103/198 transitions.
Running random walk in product with property : ParamProductionCell-PT-2-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=p1, acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s11 1) (EQ s14 1)), p2:(AND (EQ s86 1) (EQ s88 1)), p0:(AND (EQ s24 1) (EQ s28 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1720 reset in 143 ms.
Product exploration explored 100000 steps with 1725 reset in 158 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) (NOT p2) (NOT p0)), (X (NOT p1)), (X (AND (NOT p2) (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0)))), true, (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2) p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 707 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 296 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1)]
Finished random walk after 51 steps, including 0 resets, run visited all 5 properties in 2 ms. (steps per millisecond=25 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p1)), (X (AND (NOT p2) (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0)))), true, (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2) p0))))]
False Knowledge obtained : [(F (AND p0 (NOT p1) (NOT p2))), (F (AND p0 (NOT p1))), (F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 9 factoid took 780 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 294 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1)]
Stuttering acceptance computed with spot in 288 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1)]
[2023-03-15 22:14:34] [INFO ] Invariant cache hit.
[2023-03-15 22:14:34] [INFO ] [Real]Absence check using 19 positive place invariants in 12 ms returned sat
[2023-03-15 22:14:34] [INFO ] [Real]Absence check using 19 positive and 3 generalized place invariants in 5 ms returned sat
[2023-03-15 22:14:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:14:34] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2023-03-15 22:14:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:14:35] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2023-03-15 22:14:35] [INFO ] [Nat]Absence check using 19 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-15 22:14:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:14:35] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2023-03-15 22:14:35] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:14:35] [INFO ] [Nat]Added 68 Read/Feed constraints in 24 ms returned sat
[2023-03-15 22:14:35] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2023-03-15 22:14:35] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 1 ms to minimize.
[2023-03-15 22:14:35] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
[2023-03-15 22:14:35] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 0 ms to minimize.
[2023-03-15 22:14:35] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2023-03-15 22:14:35] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 1 ms to minimize.
[2023-03-15 22:14:35] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 0 ms to minimize.
[2023-03-15 22:14:35] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2023-03-15 22:14:35] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2023-03-15 22:14:35] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 0 ms to minimize.
[2023-03-15 22:14:35] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 0 ms to minimize.
[2023-03-15 22:14:36] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2023-03-15 22:14:36] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2023-03-15 22:14:36] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2023-03-15 22:14:36] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2023-03-15 22:14:36] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2023-03-15 22:14:36] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2023-03-15 22:14:36] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2023-03-15 22:14:36] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
[2023-03-15 22:14:36] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2023-03-15 22:14:36] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 1323 ms
[2023-03-15 22:14:36] [INFO ] Computed and/alt/rep : 101/228/101 causal constraints (skipped 0 transitions) in 14 ms.
[2023-03-15 22:14:36] [INFO ] Added : 86 causal constraints over 19 iterations in 358 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-15 22:14:36] [INFO ] Invariant cache hit.
[2023-03-15 22:14:37] [INFO ] [Real]Absence check using 19 positive place invariants in 13 ms returned sat
[2023-03-15 22:14:37] [INFO ] [Real]Absence check using 19 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-15 22:14:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:14:37] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2023-03-15 22:14:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:14:37] [INFO ] [Nat]Absence check using 19 positive place invariants in 13 ms returned sat
[2023-03-15 22:14:37] [INFO ] [Nat]Absence check using 19 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-15 22:14:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:14:37] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2023-03-15 22:14:37] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:14:37] [INFO ] [Nat]Added 68 Read/Feed constraints in 21 ms returned sat
[2023-03-15 22:14:37] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2023-03-15 22:14:37] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2023-03-15 22:14:37] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2023-03-15 22:14:37] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2023-03-15 22:14:37] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 0 ms to minimize.
[2023-03-15 22:14:37] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 0 ms to minimize.
[2023-03-15 22:14:37] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2023-03-15 22:14:37] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 0 ms to minimize.
[2023-03-15 22:14:38] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 0 ms to minimize.
[2023-03-15 22:14:38] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2023-03-15 22:14:38] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2023-03-15 22:14:38] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 0 ms to minimize.
[2023-03-15 22:14:38] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2023-03-15 22:14:38] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 0 ms to minimize.
[2023-03-15 22:14:38] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 0 ms to minimize.
[2023-03-15 22:14:38] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 0 ms to minimize.
[2023-03-15 22:14:38] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2023-03-15 22:14:38] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2023-03-15 22:14:38] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 1237 ms
[2023-03-15 22:14:38] [INFO ] Computed and/alt/rep : 101/228/101 causal constraints (skipped 0 transitions) in 13 ms.
[2023-03-15 22:14:39] [INFO ] Added : 97 causal constraints over 22 iterations in 418 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 6 out of 95 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 95/95 places, 103/103 transitions.
Applied a total of 0 rules in 0 ms. Remains 95 /95 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2023-03-15 22:14:39] [INFO ] Invariant cache hit.
[2023-03-15 22:14:39] [INFO ] Implicit Places using invariants in 149 ms returned []
[2023-03-15 22:14:39] [INFO ] Invariant cache hit.
[2023-03-15 22:14:39] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:14:39] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 483 ms to find 0 implicit places.
[2023-03-15 22:14:39] [INFO ] Invariant cache hit.
[2023-03-15 22:14:39] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 644 ms. Remains : 95/95 places, 103/103 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) (NOT p0) (NOT p2)), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (AND (NOT p0) (NOT p2))), (X (X (NOT p1))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 735 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 287 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1)]
Finished random walk after 51 steps, including 0 resets, run visited all 5 properties in 5 ms. (steps per millisecond=10 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (AND (NOT p0) (NOT p2))), (X (X (NOT p1))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p1) p0 (NOT p2))), (F (AND (NOT p1) p0)), (F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 11 factoid took 904 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 285 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1)]
Stuttering acceptance computed with spot in 284 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1)]
[2023-03-15 22:14:42] [INFO ] Invariant cache hit.
[2023-03-15 22:14:42] [INFO ] [Real]Absence check using 19 positive place invariants in 11 ms returned sat
[2023-03-15 22:14:42] [INFO ] [Real]Absence check using 19 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-15 22:14:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:14:42] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2023-03-15 22:14:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:14:42] [INFO ] [Nat]Absence check using 19 positive place invariants in 11 ms returned sat
[2023-03-15 22:14:42] [INFO ] [Nat]Absence check using 19 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-15 22:14:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:14:42] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2023-03-15 22:14:42] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:14:42] [INFO ] [Nat]Added 68 Read/Feed constraints in 23 ms returned sat
[2023-03-15 22:14:42] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2023-03-15 22:14:42] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 1 ms to minimize.
[2023-03-15 22:14:42] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 0 ms to minimize.
[2023-03-15 22:14:43] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 3 ms to minimize.
[2023-03-15 22:14:43] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2023-03-15 22:14:43] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 0 ms to minimize.
[2023-03-15 22:14:43] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2023-03-15 22:14:43] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 0 ms to minimize.
[2023-03-15 22:14:43] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2023-03-15 22:14:43] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 0 ms to minimize.
[2023-03-15 22:14:43] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2023-03-15 22:14:43] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2023-03-15 22:14:43] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2023-03-15 22:14:43] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2023-03-15 22:14:43] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2023-03-15 22:14:43] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2023-03-15 22:14:43] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2023-03-15 22:14:43] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2023-03-15 22:14:44] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2023-03-15 22:14:44] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2023-03-15 22:14:44] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 1318 ms
[2023-03-15 22:14:44] [INFO ] Computed and/alt/rep : 101/228/101 causal constraints (skipped 0 transitions) in 12 ms.
[2023-03-15 22:14:44] [INFO ] Added : 86 causal constraints over 19 iterations in 356 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-15 22:14:44] [INFO ] Invariant cache hit.
[2023-03-15 22:14:44] [INFO ] [Real]Absence check using 19 positive place invariants in 12 ms returned sat
[2023-03-15 22:14:44] [INFO ] [Real]Absence check using 19 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-15 22:14:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:14:44] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2023-03-15 22:14:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:14:44] [INFO ] [Nat]Absence check using 19 positive place invariants in 13 ms returned sat
[2023-03-15 22:14:44] [INFO ] [Nat]Absence check using 19 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-15 22:14:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:14:44] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2023-03-15 22:14:44] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:14:44] [INFO ] [Nat]Added 68 Read/Feed constraints in 20 ms returned sat
[2023-03-15 22:14:45] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 2 ms to minimize.
[2023-03-15 22:14:45] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 3 ms to minimize.
[2023-03-15 22:14:45] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2023-03-15 22:14:45] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2023-03-15 22:14:45] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 0 ms to minimize.
[2023-03-15 22:14:45] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 0 ms to minimize.
[2023-03-15 22:14:45] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2023-03-15 22:14:45] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 0 ms to minimize.
[2023-03-15 22:14:45] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 2 ms to minimize.
[2023-03-15 22:14:45] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 2 ms to minimize.
[2023-03-15 22:14:45] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2023-03-15 22:14:45] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 0 ms to minimize.
[2023-03-15 22:14:45] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2023-03-15 22:14:45] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 0 ms to minimize.
[2023-03-15 22:14:45] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2023-03-15 22:14:46] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
[2023-03-15 22:14:46] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2023-03-15 22:14:46] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 2 ms to minimize.
[2023-03-15 22:14:46] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 1215 ms
[2023-03-15 22:14:46] [INFO ] Computed and/alt/rep : 101/228/101 causal constraints (skipped 0 transitions) in 12 ms.
[2023-03-15 22:14:46] [INFO ] Added : 97 causal constraints over 22 iterations in 420 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 282 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1)]
Product exploration explored 100000 steps with 1723 reset in 238 ms.
Product exploration explored 100000 steps with 1717 reset in 270 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 284 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1)]
Support contains 6 out of 95 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 95/95 places, 103/103 transitions.
Applied a total of 0 rules in 3 ms. Remains 95 /95 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2023-03-15 22:14:47] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-15 22:14:47] [INFO ] Invariant cache hit.
[2023-03-15 22:14:47] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 159 ms. Remains : 95/95 places, 103/103 transitions.
Built C files in :
/tmp/ltsmin2009474985546441368
[2023-03-15 22:14:47] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2009474985546441368
Running compilation step : cd /tmp/ltsmin2009474985546441368;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 422 ms.
Running link step : cd /tmp/ltsmin2009474985546441368;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin2009474985546441368;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9305637424858010975.hoa' '--buchi-type=spotba'
LTSmin run took 2872 ms.
Treatment of property ParamProductionCell-PT-2-LTLFireability-02 finished in 20520 ms.
Length sensitive decision was in the wrong direction : Lengthening insensitive + true
[2023-03-15 22:14:51] [INFO ] Flatten gal took : 13 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6566764161976258024
[2023-03-15 22:14:51] [INFO ] Computing symmetric may disable matrix : 198 transitions.
[2023-03-15 22:14:51] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 22:14:51] [INFO ] Computing symmetric may enable matrix : 198 transitions.
[2023-03-15 22:14:51] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 22:14:51] [INFO ] Applying decomposition
[2023-03-15 22:14:51] [INFO ] Computing Do-Not-Accords matrix : 198 transitions.
[2023-03-15 22:14:51] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 22:14:51] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6566764161976258024
Running compilation step : cd /tmp/ltsmin6566764161976258024;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-15 22:14:51] [INFO ] Flatten gal took : 26 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph13532079165669132464.txt' '-o' '/tmp/graph13532079165669132464.bin' '-w' '/tmp/graph13532079165669132464.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph13532079165669132464.bin' '-l' '-1' '-v' '-w' '/tmp/graph13532079165669132464.weights' '-q' '0' '-e' '0.001'
[2023-03-15 22:14:51] [INFO ] Decomposing Gal with order
[2023-03-15 22:14:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 22:14:51] [INFO ] Removed a total of 67 redundant transitions.
[2023-03-15 22:14:51] [INFO ] Flatten gal took : 40 ms
[2023-03-15 22:14:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2023-03-15 22:14:51] [INFO ] Time to serialize gal into /tmp/LTLFireability10215373844072177419.gal : 22 ms
[2023-03-15 22:14:51] [INFO ] Time to serialize properties into /tmp/LTLFireability11384434061841632076.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10215373844072177419.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11384434061841632076.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !(((!(X(!(G((F(((F("((i1.u11.press_stop==1)&&(i1.u10.blank_forged==1))"))&&("(i3.i1.u16.table_bottom_pos==1)"))&&("(i3.i1.u16.TL_lower...294
Formula 0 simplified : !"((i1.u11.press_stop==1)&&(i1.u10.blank_forged==1))" & X(!"((i1.u11.press_stop==1)&&(i1.u10.blank_forged==1))" W F(!"((i9.i1.u65.cr...333
Reverse transition relation is NOT exact ! Due to transitions t10, t65, t86, t99, t155, t183, t188, i0.t117, i0.i1.t62, i0.i1.t120, i1.t14, i1.t6, i2.u17.t...675
Compilation finished in 830 ms.
Running link step : cd /tmp/ltsmin6566764161976258024;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin6566764161976258024;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(!X()&&(LTLAPp0==true)))||(LTLAPp2==true)))) U (LTLAPp1==true))' '--buchi-type=spotba'
LTSmin run took 54993 ms.
FORMULA ParamProductionCell-PT-2-LTLFireability-02 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 271109 ms.

BK_STOP 1678918548278

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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-2"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is ParamProductionCell-PT-2, 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 r261-smll-167863536300380"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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