Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 84K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Mar 28 16:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 28 16:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Mar 27 06:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 27 06:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Mar 25 07:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 07:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 2 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 174K May 5 16:51 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-3-00
FORMULA_NAME ParamProductionCell-PT-3-01
FORMULA_NAME ParamProductionCell-PT-3-02
FORMULA_NAME ParamProductionCell-PT-3-03
FORMULA_NAME ParamProductionCell-PT-3-04
FORMULA_NAME ParamProductionCell-PT-3-05
FORMULA_NAME ParamProductionCell-PT-3-06
FORMULA_NAME ParamProductionCell-PT-3-07
FORMULA_NAME ParamProductionCell-PT-3-08
FORMULA_NAME ParamProductionCell-PT-3-09
FORMULA_NAME ParamProductionCell-PT-3-10
FORMULA_NAME ParamProductionCell-PT-3-11
FORMULA_NAME ParamProductionCell-PT-3-12
FORMULA_NAME ParamProductionCell-PT-3-13
FORMULA_NAME ParamProductionCell-PT-3-14
FORMULA_NAME ParamProductionCell-PT-3-15

=== Now, execution of the tool begins

BK_START 1620979900159

Running Version 0
[2021-05-14 08:11:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-14 08:11:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 08:11:41] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2021-05-14 08:11:41] [INFO ] Transformed 231 places.
[2021-05-14 08:11:41] [INFO ] Transformed 202 transitions.
[2021-05-14 08:11:41] [INFO ] Found NUPN structural information;
[2021-05-14 08:11:41] [INFO ] Parsed PT model containing 231 places and 202 transitions in 104 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-14 08:11:41] [INFO ] Initial state test concluded for 6 properties.
Support contains 66 out of 231 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 231/231 places, 202/202 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 225 transition count 196
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 225 transition count 196
Applied a total of 12 rules in 31 ms. Remains 225 /231 variables (removed 6) and now considering 196/202 (removed 6) transitions.
// Phase 1: matrix 196 rows 225 cols
[2021-05-14 08:11:41] [INFO ] Computed 59 place invariants in 17 ms
[2021-05-14 08:11:42] [INFO ] Implicit Places using invariants in 247 ms returned [16, 18, 31, 35, 36, 42, 59, 65, 73, 79, 101, 114, 164, 165, 190, 191, 201, 205, 216]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 276 ms to find 19 implicit places.
// Phase 1: matrix 196 rows 206 cols
[2021-05-14 08:11:42] [INFO ] Computed 40 place invariants in 4 ms
[2021-05-14 08:11:42] [INFO ] Dead Transitions using invariants and state equation in 135 ms returned []
Starting structural reductions, iteration 1 : 206/231 places, 196/202 transitions.
Applied a total of 0 rules in 10 ms. Remains 206 /206 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 206 cols
[2021-05-14 08:11:42] [INFO ] Computed 40 place invariants in 5 ms
[2021-05-14 08:11:42] [INFO ] Dead Transitions using invariants and state equation in 107 ms returned []
Finished structural reductions, in 2 iterations. Remains : 206/231 places, 196/202 transitions.
[2021-05-14 08:11:42] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-14 08:11:42] [INFO ] Flatten gal took : 43 ms
FORMULA ParamProductionCell-PT-3-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-3-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-3-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 08:11:42] [INFO ] Flatten gal took : 17 ms
[2021-05-14 08:11:42] [INFO ] Input system was already deterministic with 196 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 338 ms. (steps per millisecond=295 ) properties (out of 33) seen :32
Running SMT prover for 1 properties.
// Phase 1: matrix 196 rows 206 cols
[2021-05-14 08:11:43] [INFO ] Computed 40 place invariants in 8 ms
[2021-05-14 08:11:43] [INFO ] [Real]Absence check using 24 positive place invariants in 5 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&F(G(p1))))], workingDir=/home/mcc/execution]
Support contains 5 out of 206 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 206/206 places, 196/196 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 206 transition count 181
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 191 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 30 place count 191 transition count 164
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 64 place count 174 transition count 164
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 108 place count 152 transition count 142
Applied a total of 108 rules in 36 ms. Remains 152 /206 variables (removed 54) and now considering 142/196 (removed 54) transitions.
// Phase 1: matrix 142 rows 152 cols
[2021-05-14 08:11:43] [INFO ] Computed 40 place invariants in 1 ms
[2021-05-14 08:11:43] [INFO ] Implicit Places using invariants in 119 ms returned [11, 12, 15, 29, 30, 43, 51, 61, 62, 74, 76, 77, 78, 108, 109, 111, 135, 136, 139]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 120 ms to find 19 implicit places.
[2021-05-14 08:11:43] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 142 rows 133 cols
[2021-05-14 08:11:43] [INFO ] Computed 21 place invariants in 0 ms
[2021-05-14 08:11:43] [INFO ] Dead Transitions using invariants and state equation in 70 ms returned []
Starting structural reductions, iteration 1 : 133/206 places, 142/196 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 133 transition count 138
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 10 place count 129 transition count 136
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 12 place count 127 transition count 136
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 12 place count 127 transition count 133
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 18 place count 124 transition count 133
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 3 with 68 rules applied. Total rules applied 86 place count 90 transition count 99
Applied a total of 86 rules in 21 ms. Remains 90 /133 variables (removed 43) and now considering 99/142 (removed 43) transitions.
// Phase 1: matrix 99 rows 90 cols
[2021-05-14 08:11:43] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-14 08:11:43] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 99 rows 90 cols
[2021-05-14 08:11:43] [INFO ] Computed 21 place invariants in 0 ms
[2021-05-14 08:11:43] [INFO ] State equation strengthened by 68 read => feed constraints.
[2021-05-14 08:11:43] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 90/206 places, 99/196 transitions.
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ParamProductionCell-PT-3-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s43 1) (EQ s73 1)), p1:(OR (EQ s16 0) (EQ s18 0) (EQ s28 0))], 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 269 ms.
Stack based approach found an accepted trace after 210 steps with 0 reset with depth 211 and stack size 211 in 1 ms.
FORMULA ParamProductionCell-PT-3-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-3-00 finished in 921 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(((p1 U X(G(p2)))&&p0))))], workingDir=/home/mcc/execution]
Support contains 4 out of 206 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 206/206 places, 196/196 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 206 cols
[2021-05-14 08:11:44] [INFO ] Computed 40 place invariants in 1 ms
[2021-05-14 08:11:44] [INFO ] Implicit Places using invariants in 164 ms returned [15, 17, 22, 36, 40, 41, 57, 69, 88, 89, 102, 104, 106, 107, 147, 148, 150, 178, 184]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 165 ms to find 19 implicit places.
// Phase 1: matrix 196 rows 187 cols
[2021-05-14 08:11:44] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-14 08:11:44] [INFO ] Dead Transitions using invariants and state equation in 92 ms returned []
Starting structural reductions, iteration 1 : 187/206 places, 196/196 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
[2021-05-14 08:11:44] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-14 08:11:44] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 194 rows 185 cols
[2021-05-14 08:11:44] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-14 08:11:44] [INFO ] State equation strengthened by 68 read => feed constraints.
[2021-05-14 08:11:44] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 185/206 places, 194/196 transitions.
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : ParamProductionCell-PT-3-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 p1 p2), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (NEQ s159 0) (NEQ s160 0)), p1:(AND (EQ s159 1) (EQ s160 1)), p2:(OR (NEQ s49 1) (NEQ s55 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 235 ms.
Stack based approach found an accepted trace after 357 steps with 0 reset with depth 358 and stack size 358 in 1 ms.
FORMULA ParamProductionCell-PT-3-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-3-01 finished in 1019 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G((G(p0) U p1)) U X(p2))))], workingDir=/home/mcc/execution]
Support contains 4 out of 206 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 206/206 places, 196/196 transitions.
Applied a total of 0 rules in 2 ms. Remains 206 /206 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 206 cols
[2021-05-14 08:11:45] [INFO ] Computed 40 place invariants in 1 ms
[2021-05-14 08:11:45] [INFO ] Implicit Places using invariants in 102 ms returned [15, 17, 22, 36, 40, 69, 88, 89, 102, 104, 106, 107, 147, 148, 150, 178, 179, 184]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 119 ms to find 18 implicit places.
// Phase 1: matrix 196 rows 188 cols
[2021-05-14 08:11:45] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-14 08:11:45] [INFO ] Dead Transitions using invariants and state equation in 102 ms returned []
Starting structural reductions, iteration 1 : 188/206 places, 196/196 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
[2021-05-14 08:11:45] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-14 08:11:45] [INFO ] Implicit Places using invariants in 67 ms returned []
// Phase 1: matrix 194 rows 186 cols
[2021-05-14 08:11:45] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-14 08:11:45] [INFO ] State equation strengthened by 68 read => feed constraints.
[2021-05-14 08:11:45] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 186/206 places, 194/196 transitions.
Stuttering acceptance computed with spot in 236 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND p1 (NOT p0) (NOT p2)), true, (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : ParamProductionCell-PT-3-02 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(OR p1 p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 5}], [{ cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=3 dest: 6}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=3 dest: 7}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={0} source=3 dest: 8}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=7 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={0} source=7 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={} source=8 dest: 7}, { cond=(OR p1 p0), acceptance={} source=8 dest: 8}]], initial=0, aps=[p1:(OR (EQ s36 0) (EQ s43 0)), p0:(AND (EQ s36 1) (EQ s43 1)), p2:(AND (EQ s52 1) (EQ s58 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, 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 221 steps with 0 reset in 2 ms.
FORMULA ParamProductionCell-PT-3-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-3-02 finished in 734 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0) U G(((p2 U X(p3))||p1))))], workingDir=/home/mcc/execution]
Support contains 7 out of 206 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 206/206 places, 196/196 transitions.
Applied a total of 0 rules in 1 ms. Remains 206 /206 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 206 cols
[2021-05-14 08:11:45] [INFO ] Computed 40 place invariants in 1 ms
[2021-05-14 08:11:45] [INFO ] Implicit Places using invariants in 106 ms returned [15, 17, 22, 36, 41, 57, 69, 88, 89, 102, 104, 106, 147, 148, 150, 178, 179, 184]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 107 ms to find 18 implicit places.
// Phase 1: matrix 196 rows 188 cols
[2021-05-14 08:11:45] [INFO ] Computed 22 place invariants in 2 ms
[2021-05-14 08:11:46] [INFO ] Dead Transitions using invariants and state equation in 102 ms returned []
Starting structural reductions, iteration 1 : 188/206 places, 196/196 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 3 ms. Remains 186 /188 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 186 cols
[2021-05-14 08:11:46] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-14 08:11:46] [INFO ] Implicit Places using invariants in 96 ms returned []
// Phase 1: matrix 194 rows 186 cols
[2021-05-14 08:11:46] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-14 08:11:46] [INFO ] State equation strengthened by 68 read => feed constraints.
[2021-05-14 08:11:46] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 186/206 places, 194/196 transitions.
Stuttering acceptance computed with spot in 344 ms :[(AND (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p3), true, (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-3-03 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=0 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=0 dest: 5}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=0 dest: 6}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=0 dest: 7}], [{ cond=(NOT p3), acceptance={} source=1 dest: 8}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 7}], [{ cond=(AND p1 (NOT p2) (NOT p0) (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(AND p1 p2 p0 (NOT p3)), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2) p0 (NOT p3)), acceptance={} source=3 dest: 5}, { cond=(AND p1 p2 (NOT p0) (NOT p3)), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p2 p0 (NOT p3)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p2 p0 (NOT p3)), acceptance={0} source=4 dest: 4}, { cond=(AND p1 p2 p0 (NOT p3)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p0 (NOT p3)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p1) (NOT p2) p0 (NOT p3)), acceptance={0} source=4 dest: 6}, { cond=(AND p1 (NOT p2) p0 (NOT p3)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p1) p2 (NOT p0) (NOT p3)), acceptance={} source=4 dest: 7}, { cond=(AND p1 p2 (NOT p0) (NOT p3)), acceptance={} source=4 dest: 9}, { cond=(AND p1 (NOT p2) (NOT p0) (NOT p3)), acceptance={} source=4 dest: 10}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=5 dest: 8}, { cond=(AND p0 (NOT p3)), acceptance={} source=5 dest: 11}], [{ cond=(AND p0 (NOT p3)), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p1) p2 p0 (NOT p3)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p1) p2 p0 (NOT p3)), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p0 (NOT p3)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p1) (NOT p2) p0 (NOT p3)), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p1) p2 (NOT p0) (NOT p3)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=7 dest: 1}, { cond=(AND p2 (NOT p3)), acceptance={0} source=7 dest: 7}], [{ cond=true, acceptance={0} source=8 dest: 8}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=9 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=9 dest: 7}, { cond=(AND p1 p2 (NOT p3)), acceptance={} source=9 dest: 9}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=9 dest: 10}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=10 dest: 1}, { cond=(NOT p3), acceptance={} source=10 dest: 2}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=10 dest: 7}], [{ cond=(NOT p0), acceptance={} source=11 dest: 8}, { cond=p0, acceptance={} source=11 dest: 11}]], initial=0, aps=[p0:(AND (EQ s35 1) (EQ s36 1) (EQ s40 1)), p1:(OR (EQ s79 0) (EQ s142 0)), p2:(AND (EQ s92 1) (EQ s94 1)), p3:(AND (EQ s79 1) (EQ s142 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 993 steps with 3 reset in 3 ms.
FORMULA ParamProductionCell-PT-3-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-3-03 finished in 855 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||X((G(p1) U (G(p1)&&p2)))))], workingDir=/home/mcc/execution]
Support contains 6 out of 206 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 206/206 places, 196/196 transitions.
Applied a total of 0 rules in 1 ms. Remains 206 /206 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 206 cols
[2021-05-14 08:11:46] [INFO ] Computed 40 place invariants in 1 ms
[2021-05-14 08:11:46] [INFO ] Implicit Places using invariants in 115 ms returned [15, 22, 36, 41, 57, 69, 88, 89, 102, 104, 106, 107, 147, 148, 150, 178, 179, 184]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 116 ms to find 18 implicit places.
// Phase 1: matrix 196 rows 188 cols
[2021-05-14 08:11:46] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-14 08:11:46] [INFO ] Dead Transitions using invariants and state equation in 85 ms returned []
Starting structural reductions, iteration 1 : 188/206 places, 196/196 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
[2021-05-14 08:11:46] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-14 08:11:47] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 194 rows 186 cols
[2021-05-14 08:11:47] [INFO ] Computed 22 place invariants in 5 ms
[2021-05-14 08:11:47] [INFO ] State equation strengthened by 68 read => feed constraints.
[2021-05-14 08:11:47] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 186/206 places, 194/196 transitions.
Stuttering acceptance computed with spot in 199 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : ParamProductionCell-PT-3-04 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 5}, { cond=p0, acceptance={} source=1 dest: 6}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 0}, { cond=(AND p2 p1), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=6 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 3}, { cond=(AND p0 p2 p1), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=6 dest: 5}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=6 dest: 6}]], initial=1, aps=[p0:(AND (EQ s109 1) (EQ s113 1)), p1:(AND (EQ s37 1) (EQ s40 1)), p2:(AND (EQ s16 1) (EQ s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-3-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-3-04 finished in 754 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||X(F((X(F(p2))&&p1))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 206 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 206/206 places, 196/196 transitions.
Applied a total of 0 rules in 2 ms. Remains 206 /206 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 206 cols
[2021-05-14 08:11:47] [INFO ] Computed 40 place invariants in 1 ms
[2021-05-14 08:11:47] [INFO ] Implicit Places using invariants in 98 ms returned [17, 22, 36, 40, 41, 57, 69, 88, 89, 102, 104, 106, 107, 148, 150, 178, 179, 184]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 99 ms to find 18 implicit places.
// Phase 1: matrix 196 rows 188 cols
[2021-05-14 08:11:47] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-14 08:11:47] [INFO ] Dead Transitions using invariants and state equation in 81 ms returned []
Starting structural reductions, iteration 1 : 188/206 places, 196/196 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 3 ms. Remains 186 /188 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 186 cols
[2021-05-14 08:11:47] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-14 08:11:47] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 194 rows 186 cols
[2021-05-14 08:11:47] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-14 08:11:47] [INFO ] State equation strengthened by 68 read => feed constraints.
[2021-05-14 08:11:47] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 186/206 places, 194/196 transitions.
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p2)), (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-3-06 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s51 1) (EQ s58 1) (OR (EQ s133 0) (EQ s136 0))), p2:(AND (EQ s4 1) (EQ s15 1)), p1:(AND (EQ s51 1) (EQ s58 1) (OR (EQ s133 0) (EQ s136 0)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 452 reset in 300 ms.
Stack based approach found an accepted trace after 24701 steps with 111 reset with depth 229 and stack size 229 in 60 ms.
FORMULA ParamProductionCell-PT-3-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-3-06 finished in 864 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||G(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 206 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 206/206 places, 196/196 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 206 transition count 179
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 189 transition count 179
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 34 place count 189 transition count 164
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 64 place count 174 transition count 164
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 106 place count 153 transition count 143
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 108 place count 152 transition count 142
Applied a total of 108 rules in 17 ms. Remains 152 /206 variables (removed 54) and now considering 142/196 (removed 54) transitions.
// Phase 1: matrix 142 rows 152 cols
[2021-05-14 08:11:48] [INFO ] Computed 40 place invariants in 0 ms
[2021-05-14 08:11:48] [INFO ] Implicit Places using invariants in 112 ms returned [9, 10, 13, 23, 27, 28, 41, 49, 60, 61, 75, 76, 77, 108, 109, 111, 135, 136, 139]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 113 ms to find 19 implicit places.
[2021-05-14 08:11:48] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 142 rows 133 cols
[2021-05-14 08:11:48] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-14 08:11:48] [INFO ] Dead Transitions using invariants and state equation in 59 ms returned []
Starting structural reductions, iteration 1 : 133/206 places, 142/196 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 133 transition count 138
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 10 place count 129 transition count 136
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 12 place count 127 transition count 136
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 12 place count 127 transition count 133
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 18 place count 124 transition count 133
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 88 place count 89 transition count 98
Applied a total of 88 rules in 12 ms. Remains 89 /133 variables (removed 44) and now considering 98/142 (removed 44) transitions.
// Phase 1: matrix 98 rows 89 cols
[2021-05-14 08:11:48] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-14 08:11:48] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 98 rows 89 cols
[2021-05-14 08:11:48] [INFO ] Computed 21 place invariants in 0 ms
[2021-05-14 08:11:48] [INFO ] State equation strengthened by 67 read => feed constraints.
[2021-05-14 08:11:48] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 89/206 places, 98/196 transitions.
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ParamProductionCell-PT-3-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s45 1) (EQ s46 1) (EQ s57 1)), p1:(AND (EQ s46 1) (EQ s56 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 1657 reset in 142 ms.
Product exploration explored 100000 steps with 1659 reset in 172 ms.
Knowledge obtained : [(NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1658 reset in 158 ms.
Product exploration explored 100000 steps with 1671 reset in 205 ms.
[2021-05-14 08:11:49] [INFO ] Flatten gal took : 7 ms
[2021-05-14 08:11:49] [INFO ] Flatten gal took : 6 ms
[2021-05-14 08:11:49] [INFO ] Time to serialize gal into /tmp/LTL1215358544121336960.gal : 12 ms
[2021-05-14 08:11:49] [INFO ] Time to serialize properties into /tmp/LTL12212382111645477542.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL1215358544121336960.gal, -t, CGAL, -LTL, /tmp/LTL12212382111645477542.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1215358544121336960.gal -t CGAL -LTL /tmp/LTL12212382111645477542.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((G(F("((arm2_forward==1)&&(A2L_ext_rs==1))")))||("(((arm2_retract_ext==1)&&(arm2_forward==1))&&(A2L_ext_run==1))"))))
Formula 0 simplified : !F("(((arm2_retract_ext==1)&&(arm2_forward==1))&&(A2L_ext_run==1))" | GF"((arm2_forward==1)&&(A2L_ext_rs==1))")
Reverse transition relation is NOT exact ! Due to transitions t85, t107, t36.t37.t42, t51.t167.t181, t166.t186, t76.t75, t95.t94, t98.t94, t83.t82.t89, t105.t104.t111, t24.t48.t19.t49.t54, t21.t20.t26, t33.t32.t30, t57.t56.t50.t16.t34, t72.t71, t79.t71, t88.t87.t64.t65, t110.t109.t66.t2.t14.t62, t125.t124.t137, t128.t124.t137, t131.t124.t137, t140.t139.t119.t18.t22.t115, t154.t153.t160, t147.t146.t160, t150.t146.t160, t163.t162.t117.t118.t0.t10, t172.t171.t177, t193.t192.t190, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/70/28/98
155 unique states visited
0 strongly connected components in search stack
154 transitions explored
78 items max in DFS search stack
213 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.15333,91000,1,0,539,347747,228,255,2818,324809,1359
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ParamProductionCell-PT-3-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property ParamProductionCell-PT-3-07 finished in 3685 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 206 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 206/206 places, 196/196 transitions.
Applied a total of 0 rules in 1 ms. Remains 206 /206 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 206 cols
[2021-05-14 08:11:52] [INFO ] Computed 40 place invariants in 1 ms
[2021-05-14 08:11:52] [INFO ] Implicit Places using invariants in 131 ms returned [15, 17, 22, 36, 40, 41, 57, 69, 88, 102, 104, 106, 107, 147, 148, 150, 178, 179, 184]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 132 ms to find 19 implicit places.
// Phase 1: matrix 196 rows 187 cols
[2021-05-14 08:11:52] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-14 08:11:52] [INFO ] Dead Transitions using invariants and state equation in 91 ms returned []
Starting structural reductions, iteration 1 : 187/206 places, 196/196 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 3 ms. Remains 185 /187 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 185 cols
[2021-05-14 08:11:52] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-14 08:11:52] [INFO ] Implicit Places using invariants in 75 ms returned []
// Phase 1: matrix 194 rows 185 cols
[2021-05-14 08:11:52] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-14 08:11:52] [INFO ] State equation strengthened by 68 read => feed constraints.
[2021-05-14 08:11:52] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 185/206 places, 194/196 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-3-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s80 1) (EQ s125 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 21 reset in 131 ms.
Stack based approach found an accepted trace after 424 steps with 0 reset with depth 425 and stack size 425 in 1 ms.
FORMULA ParamProductionCell-PT-3-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-3-09 finished in 732 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 206 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 206/206 places, 196/196 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 206 transition count 181
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 191 transition count 181
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 30 place count 191 transition count 167
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 58 place count 177 transition count 167
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 104 place count 154 transition count 144
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 106 place count 153 transition count 143
Applied a total of 106 rules in 16 ms. Remains 153 /206 variables (removed 53) and now considering 143/196 (removed 53) transitions.
// Phase 1: matrix 143 rows 153 cols
[2021-05-14 08:11:52] [INFO ] Computed 40 place invariants in 1 ms
[2021-05-14 08:11:52] [INFO ] Implicit Places using invariants in 91 ms returned [9, 10, 13, 23, 27, 28, 41, 50, 60, 61, 73, 75, 76, 77, 107, 108, 110, 134, 135, 138]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 92 ms to find 20 implicit places.
[2021-05-14 08:11:52] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 143 rows 133 cols
[2021-05-14 08:11:52] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-14 08:11:52] [INFO ] Dead Transitions using invariants and state equation in 59 ms returned []
Starting structural reductions, iteration 1 : 133/206 places, 143/196 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 133 transition count 137
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 127 transition count 136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 126 transition count 136
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 14 place count 126 transition count 131
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 24 place count 121 transition count 131
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 94 place count 86 transition count 96
Applied a total of 94 rules in 9 ms. Remains 86 /133 variables (removed 47) and now considering 96/143 (removed 47) transitions.
// Phase 1: matrix 96 rows 86 cols
[2021-05-14 08:11:52] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-14 08:11:52] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 96 rows 86 cols
[2021-05-14 08:11:52] [INFO ] Computed 20 place invariants in 0 ms
[2021-05-14 08:11:52] [INFO ] State equation strengthened by 67 read => feed constraints.
[2021-05-14 08:11:53] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 86/206 places, 96/196 transitions.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-3-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s0 1) (EQ s72 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 127 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-3-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-3-10 finished in 485 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0&&(p1||X(p1))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 206 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 206/206 places, 196/196 transitions.
Applied a total of 0 rules in 1 ms. Remains 206 /206 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 206 cols
[2021-05-14 08:11:53] [INFO ] Computed 40 place invariants in 0 ms
[2021-05-14 08:11:53] [INFO ] Implicit Places using invariants in 101 ms returned [15, 17, 22, 36, 40, 41, 69, 88, 89, 102, 104, 106, 107, 147, 148, 150, 178, 179]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 102 ms to find 18 implicit places.
// Phase 1: matrix 196 rows 188 cols
[2021-05-14 08:11:53] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-14 08:11:53] [INFO ] Dead Transitions using invariants and state equation in 81 ms returned []
Starting structural reductions, iteration 1 : 188/206 places, 196/196 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 2 ms. Remains 186 /188 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 186 cols
[2021-05-14 08:11:53] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-14 08:11:53] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 194 rows 186 cols
[2021-05-14 08:11:53] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-14 08:11:53] [INFO ] State equation strengthened by 68 read => feed constraints.
[2021-05-14 08:11:53] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 186/206 places, 194/196 transitions.
Stuttering acceptance computed with spot in 80 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : ParamProductionCell-PT-3-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (NEQ s163 1) (NEQ s164 1) (NEQ s171 1)), p1:(AND (EQ s50 1) (EQ s51 1) (EQ s56 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-3-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-3-11 finished in 526 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0 U p1)||F(p2)))], workingDir=/home/mcc/execution]
Support contains 6 out of 206 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 206/206 places, 196/196 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 206 transition count 181
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 191 transition count 180
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 32 place count 190 transition count 180
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 32 place count 190 transition count 164
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 64 place count 174 transition count 164
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 106 place count 153 transition count 143
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 108 place count 152 transition count 142
Applied a total of 108 rules in 14 ms. Remains 152 /206 variables (removed 54) and now considering 142/196 (removed 54) transitions.
// Phase 1: matrix 142 rows 152 cols
[2021-05-14 08:11:53] [INFO ] Computed 40 place invariants in 0 ms
[2021-05-14 08:11:53] [INFO ] Implicit Places using invariants in 94 ms returned [9, 10, 23, 27, 28, 41, 49, 59, 60, 72, 74, 75, 76, 108, 109, 111, 135, 136, 139]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 94 ms to find 19 implicit places.
[2021-05-14 08:11:53] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 142 rows 133 cols
[2021-05-14 08:11:53] [INFO ] Computed 21 place invariants in 0 ms
[2021-05-14 08:11:53] [INFO ] Dead Transitions using invariants and state equation in 76 ms returned []
Starting structural reductions, iteration 1 : 133/206 places, 142/196 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 133 transition count 136
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 127 transition count 136
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 12 place count 127 transition count 132
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 20 place count 123 transition count 132
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 88 place count 89 transition count 98
Applied a total of 88 rules in 8 ms. Remains 89 /133 variables (removed 44) and now considering 98/142 (removed 44) transitions.
// Phase 1: matrix 98 rows 89 cols
[2021-05-14 08:11:53] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-14 08:11:53] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 98 rows 89 cols
[2021-05-14 08:11:53] [INFO ] Computed 21 place invariants in 0 ms
[2021-05-14 08:11:54] [INFO ] State equation strengthened by 67 read => feed constraints.
[2021-05-14 08:11:54] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 89/206 places, 98/196 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ParamProductionCell-PT-3-12 automaton TGBA [mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p2:(AND (EQ s42 1) (EQ s60 1)), p1:(EQ s59 1), p0:(AND (EQ s10 1) (EQ s11 1) (EQ s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 65 reset in 122 ms.
Stack based approach found an accepted trace after 92 steps with 0 reset with depth 93 and stack size 93 in 1 ms.
FORMULA ParamProductionCell-PT-3-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-3-12 finished in 517 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 3 out of 206 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 206/206 places, 196/196 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 206 transition count 179
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 189 transition count 179
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 34 place count 189 transition count 164
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 64 place count 174 transition count 164
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 110 place count 151 transition count 141
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 112 place count 150 transition count 140
Applied a total of 112 rules in 12 ms. Remains 150 /206 variables (removed 56) and now considering 140/196 (removed 56) transitions.
// Phase 1: matrix 140 rows 150 cols
[2021-05-14 08:11:54] [INFO ] Computed 40 place invariants in 1 ms
[2021-05-14 08:11:54] [INFO ] Implicit Places using invariants in 92 ms returned [9, 10, 13, 23, 27, 28, 41, 49, 60, 72, 74, 75, 76, 106, 107, 109, 133, 134, 137]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 93 ms to find 19 implicit places.
[2021-05-14 08:11:54] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 140 rows 131 cols
[2021-05-14 08:11:54] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-14 08:11:54] [INFO ] Dead Transitions using invariants and state equation in 58 ms returned []
Starting structural reductions, iteration 1 : 131/206 places, 140/196 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 131 transition count 134
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 125 transition count 134
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 12 place count 125 transition count 131
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 18 place count 122 transition count 131
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 80 place count 91 transition count 100
Applied a total of 80 rules in 7 ms. Remains 91 /131 variables (removed 40) and now considering 100/140 (removed 40) transitions.
// Phase 1: matrix 100 rows 91 cols
[2021-05-14 08:11:54] [INFO ] Computed 21 place invariants in 3 ms
[2021-05-14 08:11:54] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 100 rows 91 cols
[2021-05-14 08:11:54] [INFO ] Computed 21 place invariants in 0 ms
[2021-05-14 08:11:54] [INFO ] State equation strengthened by 67 read => feed constraints.
[2021-05-14 08:11:54] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 91/206 places, 100/196 transitions.
Stuttering acceptance computed with spot in 30 ms :[true, (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-3-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (EQ s38 1) (EQ s42 1) (EQ s46 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 0 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-3-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-3-13 finished in 353 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0 U p1)||X((G(F(p2)) U p3))))], workingDir=/home/mcc/execution]
Support contains 7 out of 206 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 206/206 places, 196/196 transitions.
Applied a total of 0 rules in 1 ms. Remains 206 /206 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 206 cols
[2021-05-14 08:11:54] [INFO ] Computed 40 place invariants in 1 ms
[2021-05-14 08:11:54] [INFO ] Implicit Places using invariants in 114 ms returned [15, 17, 22, 36, 40, 41, 57, 69, 88, 89, 104, 106, 107, 147, 148, 178, 179, 184]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 115 ms to find 18 implicit places.
// Phase 1: matrix 196 rows 188 cols
[2021-05-14 08:11:54] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-14 08:11:54] [INFO ] Dead Transitions using invariants and state equation in 79 ms returned []
Starting structural reductions, iteration 1 : 188/206 places, 196/196 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 2 ms. Remains 186 /188 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 186 cols
[2021-05-14 08:11:54] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-14 08:11:54] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 194 rows 186 cols
[2021-05-14 08:11:54] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-14 08:11:54] [INFO ] State equation strengthened by 68 read => feed constraints.
[2021-05-14 08:11:55] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 186/206 places, 194/196 transitions.
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p3)), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ParamProductionCell-PT-3-15 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=1 dest: 3}, { cond=(NOT p3), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={0} source=2 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={0} source=2 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p3) (NOT p2)), acceptance={0} source=2 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=6 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(AND (EQ s90 1) (EQ s91 1) (EQ s95 1)), p0:(OR (EQ s14 0) (EQ s70 0)), p3:(OR (NEQ s14 1) (NEQ s70 1)), p2:(AND (EQ s134 1) (EQ s155 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 334 ms.
Product exploration explored 100000 steps with 50000 reset in 323 ms.
Knowledge obtained : [(NOT p1), p0, p3, (NOT p2)]
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p3)), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 50000 reset in 311 ms.
Product exploration explored 100000 steps with 50000 reset in 325 ms.
Applying partial POR strategy [false, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 250 ms :[(AND (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p3)), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 7 out of 186 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 186/186 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 186 transition count 194
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 13 Pre rules applied. Total rules applied 36 place count 186 transition count 196
Deduced a syphon composed of 49 places in 0 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 49 place count 186 transition count 196
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 56 place count 179 transition count 188
Deduced a syphon composed of 42 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 63 place count 179 transition count 188
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 78 places in 0 ms
Iterating global reduction 1 with 36 rules applied. Total rules applied 99 place count 179 transition count 188
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 122 place count 156 transition count 165
Deduced a syphon composed of 55 places in 0 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 145 place count 156 transition count 165
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 56 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 146 place count 156 transition count 165
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 147 place count 155 transition count 164
Deduced a syphon composed of 55 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 148 place count 155 transition count 164
Deduced a syphon composed of 55 places in 0 ms
Applied a total of 148 rules in 22 ms. Remains 155 /186 variables (removed 31) and now considering 164/194 (removed 30) transitions.
[2021-05-14 08:11:57] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 164 rows 155 cols
[2021-05-14 08:11:57] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-14 08:11:57] [INFO ] Dead Transitions using invariants and state equation in 66 ms returned []
Finished structural reductions, in 1 iterations. Remains : 155/186 places, 164/194 transitions.
Product exploration explored 100000 steps with 50000 reset in 1014 ms.
Product exploration explored 100000 steps with 50000 reset in 969 ms.
[2021-05-14 08:11:59] [INFO ] Flatten gal took : 9 ms
[2021-05-14 08:11:59] [INFO ] Flatten gal took : 9 ms
[2021-05-14 08:11:59] [INFO ] Time to serialize gal into /tmp/LTL1412224981100097158.gal : 3 ms
[2021-05-14 08:11:59] [INFO ] Time to serialize properties into /tmp/LTL1239446062030777605.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL1412224981100097158.gal, -t, CGAL, -LTL, /tmp/LTL1239446062030777605.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1412224981100097158.gal -t CGAL -LTL /tmp/LTL1239446062030777605.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((("((swivel==0)||(arm2_waiting_for_swivel_1==0))")U("(((arm2_retract_ext==1)&&(arm2_forward==1))&&(A2U_ext_run==1))"))||(X((G(F("((arm1_backward==1)&&(A1U_ret_rs==1))")))U("((swivel!=1)||(arm2_waiting_for_swivel_1!=1))")))))
Formula 0 simplified : !(("((swivel==0)||(arm2_waiting_for_swivel_1==0))" U "(((arm2_retract_ext==1)&&(arm2_forward==1))&&(A2U_ext_run==1))") | X(GF"((arm1_backward==1)&&(A1U_ret_rs==1))" U "((swivel!=1)||(arm2_waiting_for_swivel_1!=1))"))
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, t79, t80, t85, t89, t95, t96, t98, t99, t102, t107, t111, t115, t118, t125, t126, t128, t129, t131, t132, t137, t141, t148, t150, t151, t154, t155, t160, t164, t173, t177, t181, t186, t190, t194, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/143/51/194
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
695 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,6.97681,211476,1,0,341,860700,437,197,5341,568966,409
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ParamProductionCell-PT-3-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property ParamProductionCell-PT-3-15 finished in 12313 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620979927997

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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