Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 9.3K Apr 29 17:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Apr 29 17:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 29 17:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 29 17:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.8K May 9 08:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 9 08:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 9 08:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 08:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 08:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 2 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 174K May 10 09:34 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-LTLFireability-00
FORMULA_NAME ParamProductionCell-PT-3-LTLFireability-01
FORMULA_NAME ParamProductionCell-PT-3-LTLFireability-02
FORMULA_NAME ParamProductionCell-PT-3-LTLFireability-03
FORMULA_NAME ParamProductionCell-PT-3-LTLFireability-04
FORMULA_NAME ParamProductionCell-PT-3-LTLFireability-05
FORMULA_NAME ParamProductionCell-PT-3-LTLFireability-06
FORMULA_NAME ParamProductionCell-PT-3-LTLFireability-07
FORMULA_NAME ParamProductionCell-PT-3-LTLFireability-08
FORMULA_NAME ParamProductionCell-PT-3-LTLFireability-09
FORMULA_NAME ParamProductionCell-PT-3-LTLFireability-10
FORMULA_NAME ParamProductionCell-PT-3-LTLFireability-11
FORMULA_NAME ParamProductionCell-PT-3-LTLFireability-12
FORMULA_NAME ParamProductionCell-PT-3-LTLFireability-13
FORMULA_NAME ParamProductionCell-PT-3-LTLFireability-14
FORMULA_NAME ParamProductionCell-PT-3-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653050181636

Running Version 202205111006
[2022-05-20 12:36:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-20 12:36:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 12:36:24] [INFO ] Load time of PNML (sax parser for PT used): 215 ms
[2022-05-20 12:36:24] [INFO ] Transformed 231 places.
[2022-05-20 12:36:24] [INFO ] Transformed 202 transitions.
[2022-05-20 12:36:24] [INFO ] Found NUPN structural information;
[2022-05-20 12:36:24] [INFO ] Parsed PT model containing 231 places and 202 transitions in 450 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ParamProductionCell-PT-3-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-3-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-3-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-3-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 202/202 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 226 transition count 197
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 226 transition count 197
Applied a total of 10 rules in 87 ms. Remains 226 /231 variables (removed 5) and now considering 197/202 (removed 5) transitions.
// Phase 1: matrix 197 rows 226 cols
[2022-05-20 12:36:25] [INFO ] Computed 59 place invariants in 29 ms
[2022-05-20 12:36:25] [INFO ] Implicit Places using invariants in 736 ms returned [15, 16, 18, 19, 24, 31, 35, 36, 46, 47, 59, 64, 73, 98, 99, 114, 116, 118, 119, 160, 161, 163, 165, 166, 192, 201, 202, 206, 217]
Discarding 29 places :
Implicit Place search using SMT only with invariants took 813 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 197/231 places, 197/202 transitions.
Applied a total of 0 rules in 19 ms. Remains 197 /197 variables (removed 0) and now considering 197/197 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 197/231 places, 197/202 transitions.
Support contains 47 out of 197 places after structural reductions.
[2022-05-20 12:36:26] [INFO ] Flatten gal took : 103 ms
[2022-05-20 12:36:26] [INFO ] Flatten gal took : 44 ms
[2022-05-20 12:36:26] [INFO ] Input system was already deterministic with 197 transitions.
Support contains 43 out of 197 places (down from 47) after GAL structural reductions.
Finished random walk after 3504 steps, including 1 resets, run visited all 25 properties in 393 ms. (steps per millisecond=8 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((F(X(X(p0)))||p0)) U (p1 U G(p2))))'
Support contains 5 out of 197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 197/197 places, 197/197 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 197 transition count 175
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 175 transition count 175
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 44 place count 175 transition count 159
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 76 place count 159 transition count 159
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 77 place count 158 transition count 158
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 158 transition count 158
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 79 place count 158 transition count 157
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 80 place count 157 transition count 157
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 158 place count 118 transition count 118
Applied a total of 158 rules in 62 ms. Remains 118 /197 variables (removed 79) and now considering 118/197 (removed 79) transitions.
// Phase 1: matrix 118 rows 118 cols
[2022-05-20 12:36:27] [INFO ] Computed 30 place invariants in 2 ms
[2022-05-20 12:36:27] [INFO ] Implicit Places using invariants in 227 ms returned [18, 19, 32, 41, 42, 54, 63, 97, 100]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 229 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/197 places, 118/197 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 109 transition count 117
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 108 transition count 117
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 26 place count 96 transition count 105
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 28 place count 95 transition count 104
Applied a total of 28 rules in 16 ms. Remains 95 /109 variables (removed 14) and now considering 104/118 (removed 14) transitions.
// Phase 1: matrix 104 rows 95 cols
[2022-05-20 12:36:27] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-20 12:36:27] [INFO ] Implicit Places using invariants in 121 ms returned []
// Phase 1: matrix 104 rows 95 cols
[2022-05-20 12:36:27] [INFO ] Computed 21 place invariants in 4 ms
[2022-05-20 12:36:28] [INFO ] State equation strengthened by 67 read => feed constraints.
[2022-05-20 12:36:28] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 95/197 places, 104/197 transitions.
Finished structural reductions, in 2 iterations. Remains : 95/197 places, 104/197 transitions.
Stuttering acceptance computed with spot in 319 ms :[(NOT p2), (NOT p0), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(AND (EQ s38 1) (EQ s43 1)), p1:(EQ s26 1), p0:(AND (EQ s78 1) (EQ s88 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 2538 reset in 371 ms.
Product exploration explored 100000 steps with 2514 reset in 267 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND p2 p1 (NOT p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 p1 (NOT p0)))))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT p0)), (X p0), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 9 factoid took 648 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 237 ms :[(NOT p2), (NOT p0), (AND (NOT p0) (NOT p2) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 104 rows 95 cols
[2022-05-20 12:36:30] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-20 12:36:30] [INFO ] [Real]Absence check using 19 positive place invariants in 12 ms returned sat
[2022-05-20 12:36:30] [INFO ] [Real]Absence check using 19 positive and 2 generalized place invariants in 2 ms returned sat
[2022-05-20 12:36:30] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND p2 p1 (NOT p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 p1 (NOT p0))))), (G (NOT (AND (NOT p0) p1 p2)))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT p0)), (X p0), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (F (AND (NOT p0) p1 (NOT p2))), (F p0), (F p2), (F (AND (NOT p0) (NOT p1) p2)), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
Knowledge based reduction with 10 factoid took 973 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p2) (AND (NOT p0) p1)), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p2) (AND (NOT p0) p1)), (NOT p0), (AND (NOT p0) p1)]
// Phase 1: matrix 104 rows 95 cols
[2022-05-20 12:36:31] [INFO ] Computed 21 place invariants in 4 ms
[2022-05-20 12:36:31] [INFO ] [Real]Absence check using 19 positive place invariants in 13 ms returned sat
[2022-05-20 12:36:31] [INFO ] [Real]Absence check using 19 positive and 2 generalized place invariants in 4 ms returned sat
[2022-05-20 12:36:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 12:36:31] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2022-05-20 12:36:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 12:36:32] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2022-05-20 12:36:32] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 2 ms returned sat
[2022-05-20 12:36:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 12:36:32] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2022-05-20 12:36:32] [INFO ] State equation strengthened by 67 read => feed constraints.
[2022-05-20 12:36:32] [INFO ] [Nat]Added 67 Read/Feed constraints in 21 ms returned sat
[2022-05-20 12:36:32] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 4 ms to minimize.
[2022-05-20 12:36:32] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 1 ms to minimize.
[2022-05-20 12:36:32] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 3 ms to minimize.
[2022-05-20 12:36:32] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 3 ms to minimize.
[2022-05-20 12:36:32] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 1 ms to minimize.
[2022-05-20 12:36:32] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 0 ms to minimize.
[2022-05-20 12:36:32] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2022-05-20 12:36:32] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2022-05-20 12:36:32] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 0 ms to minimize.
[2022-05-20 12:36:32] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2022-05-20 12:36:32] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 764 ms
[2022-05-20 12:36:33] [INFO ] Computed and/alt/rep : 102/226/102 causal constraints (skipped 0 transitions) in 13 ms.
[2022-05-20 12:36:33] [INFO ] Added : 76 causal constraints over 17 iterations in 266 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 5 out of 95 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 95/95 places, 104/104 transitions.
Applied a total of 0 rules in 3 ms. Remains 95 /95 variables (removed 0) and now considering 104/104 (removed 0) transitions.
// Phase 1: matrix 104 rows 95 cols
[2022-05-20 12:36:33] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-20 12:36:33] [INFO ] Implicit Places using invariants in 102 ms returned []
// Phase 1: matrix 104 rows 95 cols
[2022-05-20 12:36:33] [INFO ] Computed 21 place invariants in 5 ms
[2022-05-20 12:36:33] [INFO ] State equation strengthened by 67 read => feed constraints.
[2022-05-20 12:36:33] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
// Phase 1: matrix 104 rows 95 cols
[2022-05-20 12:36:33] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-20 12:36:33] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 95/95 places, 104/104 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) p2))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 7 factoid took 584 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 3 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p2) (AND (NOT p0) p1)), (NOT p0), (AND (NOT p0) p1)]
Finished random walk after 724 steps, including 0 resets, run visited all 5 properties in 32 ms. (steps per millisecond=22 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) p2))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (F (AND p1 (NOT p0))), (F p0), (F p2), (F (AND (NOT p0) p2)), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2))))]
Knowledge based reduction with 7 factoid took 920 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 3 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p2) (AND (NOT p0) p1)), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p2) (AND (NOT p0) p1)), (NOT p0), (AND (NOT p0) p1)]
// Phase 1: matrix 104 rows 95 cols
[2022-05-20 12:36:35] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-20 12:36:35] [INFO ] [Real]Absence check using 19 positive place invariants in 12 ms returned sat
[2022-05-20 12:36:35] [INFO ] [Real]Absence check using 19 positive and 2 generalized place invariants in 4 ms returned sat
[2022-05-20 12:36:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 12:36:36] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2022-05-20 12:36:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 12:36:36] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2022-05-20 12:36:36] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 3 ms returned sat
[2022-05-20 12:36:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 12:36:36] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2022-05-20 12:36:36] [INFO ] State equation strengthened by 67 read => feed constraints.
[2022-05-20 12:36:36] [INFO ] [Nat]Added 67 Read/Feed constraints in 18 ms returned sat
[2022-05-20 12:36:36] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 2 ms to minimize.
[2022-05-20 12:36:36] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 1 ms to minimize.
[2022-05-20 12:36:36] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 0 ms to minimize.
[2022-05-20 12:36:36] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 0 ms to minimize.
[2022-05-20 12:36:36] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 0 ms to minimize.
[2022-05-20 12:36:36] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2022-05-20 12:36:36] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2022-05-20 12:36:36] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2022-05-20 12:36:37] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2022-05-20 12:36:37] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
[2022-05-20 12:36:37] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 816 ms
[2022-05-20 12:36:37] [INFO ] Computed and/alt/rep : 102/226/102 causal constraints (skipped 0 transitions) in 15 ms.
[2022-05-20 12:36:37] [INFO ] Added : 76 causal constraints over 17 iterations in 351 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p2) (AND (NOT p0) p1)), (NOT p0), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 2638 reset in 329 ms.
Product exploration explored 100000 steps with 2521 reset in 447 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p2) (AND (NOT p0) p1)), (NOT p0), (AND (NOT p0) p1)]
Support contains 5 out of 95 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 95/95 places, 104/104 transitions.
Applied a total of 0 rules in 8 ms. Remains 95 /95 variables (removed 0) and now considering 104/104 (removed 0) transitions.
[2022-05-20 12:36:38] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 104 rows 95 cols
[2022-05-20 12:36:38] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-20 12:36:39] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 95/95 places, 104/104 transitions.
Product exploration explored 100000 steps with 2643 reset in 552 ms.
Product exploration explored 100000 steps with 2536 reset in 388 ms.
Built C files in :
/tmp/ltsmin12891843328010370500
[2022-05-20 12:36:40] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12891843328010370500
Running compilation step : cd /tmp/ltsmin12891843328010370500;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 512 ms.
Running link step : cd /tmp/ltsmin12891843328010370500;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin12891843328010370500;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7246420846274715484.hoa' '--buchi-type=spotba'
LTSmin run took 1177 ms.
FORMULA ParamProductionCell-PT-3-LTLFireability-00 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-3-LTLFireability-00 finished in 14537 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 4 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 197/197 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 196 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 196 transition count 196
Applied a total of 2 rules in 8 ms. Remains 196 /197 variables (removed 1) and now considering 196/197 (removed 1) transitions.
// Phase 1: matrix 196 rows 196 cols
[2022-05-20 12:36:41] [INFO ] Computed 30 place invariants in 5 ms
[2022-05-20 12:36:42] [INFO ] Implicit Places using invariants in 158 ms returned [33, 34, 53, 65, 66, 86, 98, 169, 170]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 167 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/197 places, 196/197 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 10 ms. Remains 185 /187 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 185 cols
[2022-05-20 12:36:42] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-20 12:36:42] [INFO ] Implicit Places using invariants in 111 ms returned []
// Phase 1: matrix 194 rows 185 cols
[2022-05-20 12:36:42] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-20 12:36:42] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-20 12:36:42] [INFO ] Implicit Places using invariants and state equation in 421 ms returned []
Implicit Place search using SMT with State Equation took 536 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/197 places, 194/197 transitions.
Finished structural reductions, in 2 iterations. Remains : 185/197 places, 194/197 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(OR (EQ s157 0) (EQ s175 0)), p0:(AND (EQ s79 1) (EQ s128 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 318 ms.
Product exploration explored 100000 steps with 50000 reset in 395 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 7 factoid took 168 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA ParamProductionCell-PT-3-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ParamProductionCell-PT-3-LTLFireability-01 finished in 1765 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 2 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 197/197 transitions.
Applied a total of 0 rules in 3 ms. Remains 197 /197 variables (removed 0) and now considering 197/197 (removed 0) transitions.
// Phase 1: matrix 197 rows 197 cols
[2022-05-20 12:36:43] [INFO ] Computed 30 place invariants in 3 ms
[2022-05-20 12:36:43] [INFO ] Implicit Places using invariants in 243 ms returned [33, 34, 53, 65, 66, 98, 167, 170, 171]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 245 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/197 places, 197/197 transitions.
Applied a total of 0 rules in 3 ms. Remains 188 /188 variables (removed 0) and now considering 197/197 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 188/197 places, 197/197 transitions.
Stuttering acceptance computed with spot in 209 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (NEQ s81 1) (NEQ s107 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 104 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-3-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-3-LTLFireability-02 finished in 481 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 197/197 places, 197/197 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 197 transition count 175
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 175 transition count 175
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 44 place count 175 transition count 158
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 78 place count 158 transition count 158
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 79 place count 157 transition count 157
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 157 transition count 157
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 81 place count 157 transition count 156
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 82 place count 156 transition count 156
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 4 with 88 rules applied. Total rules applied 170 place count 112 transition count 112
Applied a total of 170 rules in 38 ms. Remains 112 /197 variables (removed 85) and now considering 112/197 (removed 85) transitions.
// Phase 1: matrix 112 rows 112 cols
[2022-05-20 12:36:44] [INFO ] Computed 30 place invariants in 1 ms
[2022-05-20 12:36:44] [INFO ] Implicit Places using invariants in 116 ms returned [18, 19, 32, 40, 51, 60, 94, 97, 98]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 118 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 103/197 places, 112/197 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 28 place count 89 transition count 98
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 0 with 2 rules applied. Total rules applied 30 place count 88 transition count 97
Applied a total of 30 rules in 12 ms. Remains 88 /103 variables (removed 15) and now considering 97/112 (removed 15) transitions.
// Phase 1: matrix 97 rows 88 cols
[2022-05-20 12:36:44] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-20 12:36:44] [INFO ] Implicit Places using invariants in 96 ms returned []
// Phase 1: matrix 97 rows 88 cols
[2022-05-20 12:36:44] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-20 12:36:44] [INFO ] State equation strengthened by 67 read => feed constraints.
[2022-05-20 12:36:44] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 88/197 places, 97/197 transitions.
Finished structural reductions, in 2 iterations. Remains : 88/197 places, 97/197 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s31 1) (EQ s33 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2947 reset in 186 ms.
Product exploration explored 100000 steps with 2942 reset in 256 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 221 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Finished random walk after 36 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=36 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
// Phase 1: matrix 97 rows 88 cols
[2022-05-20 12:36:45] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-20 12:36:45] [INFO ] [Real]Absence check using 18 positive place invariants in 7 ms returned sat
[2022-05-20 12:36:45] [INFO ] [Real]Absence check using 18 positive and 3 generalized place invariants in 3 ms returned sat
[2022-05-20 12:36:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 12:36:45] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2022-05-20 12:36:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 12:36:45] [INFO ] [Nat]Absence check using 18 positive place invariants in 7 ms returned sat
[2022-05-20 12:36:45] [INFO ] [Nat]Absence check using 18 positive and 3 generalized place invariants in 2 ms returned sat
[2022-05-20 12:36:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 12:36:45] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2022-05-20 12:36:45] [INFO ] State equation strengthened by 67 read => feed constraints.
[2022-05-20 12:36:45] [INFO ] [Nat]Added 67 Read/Feed constraints in 14 ms returned sat
[2022-05-20 12:36:45] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
[2022-05-20 12:36:45] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2022-05-20 12:36:46] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
[2022-05-20 12:36:46] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
[2022-05-20 12:36:46] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
[2022-05-20 12:36:46] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2022-05-20 12:36:46] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2022-05-20 12:36:46] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2022-05-20 12:36:46] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 0 ms to minimize.
[2022-05-20 12:36:46] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2022-05-20 12:36:46] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2022-05-20 12:36:46] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2022-05-20 12:36:46] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 0 ms to minimize.
[2022-05-20 12:36:46] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2022-05-20 12:36:46] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 4 ms to minimize.
[2022-05-20 12:36:46] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 4 ms to minimize.
[2022-05-20 12:36:46] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2022-05-20 12:36:46] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2022-05-20 12:36:47] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 0 ms to minimize.
[2022-05-20 12:36:47] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 1 ms to minimize.
[2022-05-20 12:36:47] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2022-05-20 12:36:47] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2022-05-20 12:36:47] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2022-05-20 12:36:47] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 0 ms to minimize.
[2022-05-20 12:36:47] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2022-05-20 12:36:47] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 1441 ms
[2022-05-20 12:36:47] [INFO ] Computed and/alt/rep : 95/227/95 causal constraints (skipped 0 transitions) in 9 ms.
[2022-05-20 12:36:47] [INFO ] Added : 80 causal constraints over 16 iterations in 310 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 97/97 transitions.
Applied a total of 0 rules in 7 ms. Remains 88 /88 variables (removed 0) and now considering 97/97 (removed 0) transitions.
// Phase 1: matrix 97 rows 88 cols
[2022-05-20 12:36:47] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-20 12:36:47] [INFO ] Implicit Places using invariants in 129 ms returned []
// Phase 1: matrix 97 rows 88 cols
[2022-05-20 12:36:47] [INFO ] Computed 21 place invariants in 6 ms
[2022-05-20 12:36:47] [INFO ] State equation strengthened by 67 read => feed constraints.
[2022-05-20 12:36:48] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
[2022-05-20 12:36:48] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 97 rows 88 cols
[2022-05-20 12:36:48] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-20 12:36:48] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 88/88 places, 97/97 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 160 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Finished random walk after 33 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=33 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 164 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
// Phase 1: matrix 97 rows 88 cols
[2022-05-20 12:36:48] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-20 12:36:48] [INFO ] [Real]Absence check using 18 positive place invariants in 11 ms returned sat
[2022-05-20 12:36:48] [INFO ] [Real]Absence check using 18 positive and 3 generalized place invariants in 3 ms returned sat
[2022-05-20 12:36:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 12:36:48] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2022-05-20 12:36:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 12:36:49] [INFO ] [Nat]Absence check using 18 positive place invariants in 6 ms returned sat
[2022-05-20 12:36:49] [INFO ] [Nat]Absence check using 18 positive and 3 generalized place invariants in 2 ms returned sat
[2022-05-20 12:36:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 12:36:49] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2022-05-20 12:36:49] [INFO ] State equation strengthened by 67 read => feed constraints.
[2022-05-20 12:36:49] [INFO ] [Nat]Added 67 Read/Feed constraints in 23 ms returned sat
[2022-05-20 12:36:49] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 1 ms to minimize.
[2022-05-20 12:36:49] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 0 ms to minimize.
[2022-05-20 12:36:49] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 1 ms to minimize.
[2022-05-20 12:36:49] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2022-05-20 12:36:49] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
[2022-05-20 12:36:49] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 2 ms to minimize.
[2022-05-20 12:36:49] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2022-05-20 12:36:49] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2022-05-20 12:36:49] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2022-05-20 12:36:49] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 0 ms to minimize.
[2022-05-20 12:36:49] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2022-05-20 12:36:49] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 4 ms to minimize.
[2022-05-20 12:36:49] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2022-05-20 12:36:49] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2022-05-20 12:36:49] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2022-05-20 12:36:50] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 0 ms to minimize.
[2022-05-20 12:36:50] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2022-05-20 12:36:50] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2022-05-20 12:36:50] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2022-05-20 12:36:50] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 0 ms to minimize.
[2022-05-20 12:36:50] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2022-05-20 12:36:50] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2022-05-20 12:36:50] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2022-05-20 12:36:50] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2022-05-20 12:36:50] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2022-05-20 12:36:50] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 1463 ms
[2022-05-20 12:36:50] [INFO ] Computed and/alt/rep : 95/227/95 causal constraints (skipped 0 transitions) in 10 ms.
[2022-05-20 12:36:50] [INFO ] Added : 80 causal constraints over 16 iterations in 272 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2938 reset in 144 ms.
Product exploration explored 100000 steps with 2935 reset in 226 ms.
Built C files in :
/tmp/ltsmin18123459763694283026
[2022-05-20 12:36:51] [INFO ] Computing symmetric may disable matrix : 97 transitions.
[2022-05-20 12:36:51] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:36:51] [INFO ] Computing symmetric may enable matrix : 97 transitions.
[2022-05-20 12:36:51] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:36:51] [INFO ] Computing Do-Not-Accords matrix : 97 transitions.
[2022-05-20 12:36:51] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:36:51] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18123459763694283026
Running compilation step : cd /tmp/ltsmin18123459763694283026;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 473 ms.
Running link step : cd /tmp/ltsmin18123459763694283026;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin18123459763694283026;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12025383507318257169.hoa' '--buchi-type=spotba'
LTSmin run took 224 ms.
FORMULA ParamProductionCell-PT-3-LTLFireability-03 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-3-LTLFireability-03 finished in 7852 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(F(X((F(p1)&&G(p2)&&p0)))) U p3)))'
Support contains 7 out of 197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 197/197 places, 197/197 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 197 transition count 176
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 176 transition count 176
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 42 place count 176 transition count 160
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 74 place count 160 transition count 160
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 75 place count 159 transition count 159
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 159 transition count 159
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 77 place count 159 transition count 158
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 78 place count 158 transition count 158
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 4 with 84 rules applied. Total rules applied 162 place count 116 transition count 116
Applied a total of 162 rules in 32 ms. Remains 116 /197 variables (removed 81) and now considering 116/197 (removed 81) transitions.
// Phase 1: matrix 116 rows 116 cols
[2022-05-20 12:36:52] [INFO ] Computed 30 place invariants in 1 ms
[2022-05-20 12:36:52] [INFO ] Implicit Places using invariants in 234 ms returned [33, 40, 41, 52, 61, 98, 101, 102]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 235 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 108/197 places, 116/197 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 108 transition count 115
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 107 transition count 115
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 28 place count 94 transition count 102
Applied a total of 28 rules in 12 ms. Remains 94 /108 variables (removed 14) and now considering 102/116 (removed 14) transitions.
// Phase 1: matrix 102 rows 94 cols
[2022-05-20 12:36:52] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 12:36:52] [INFO ] Implicit Places using invariants in 165 ms returned []
// Phase 1: matrix 102 rows 94 cols
[2022-05-20 12:36:52] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 12:36:52] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-20 12:36:52] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 522 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 94/197 places, 102/197 transitions.
Finished structural reductions, in 2 iterations. Remains : 94/197 places, 102/197 transitions.
Stuttering acceptance computed with spot in 368 ms :[(NOT p3), (NOT p1), (OR (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p0) (NOT p2)), (NOT p3), (NOT p2)]
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p3) (NOT p0)) (AND (NOT p3) (NOT p2))), acceptance={} source=0 dest: 2}, { cond=(NOT p3), acceptance={} source=0 dest: 3}, { cond=(NOT p3), acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(OR (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p2), acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=(OR (NOT p0) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(OR (AND (NOT p3) (NOT p0)) (AND (NOT p3) (NOT p2))), acceptance={} source=4 dest: 2}, { cond=(NOT p3), acceptance={} source=4 dest: 3}, { cond=(NOT p3), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 2}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p3:(AND (EQ s46 1) (EQ s56 1)), p1:(AND (EQ s16 1) (EQ s20 1)), p0:(AND (EQ s19 1) (EQ s23 1)), p2:(EQ s65 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 236 ms.
Stack based approach found an accepted trace after 185 steps with 3 reset with depth 108 and stack size 108 in 1 ms.
FORMULA ParamProductionCell-PT-3-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-3-LTLFireability-05 finished in 1440 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 197/197 places, 197/197 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 197 transition count 175
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 175 transition count 175
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 44 place count 175 transition count 158
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 78 place count 158 transition count 158
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 79 place count 157 transition count 157
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 157 transition count 157
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 81 place count 157 transition count 156
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 82 place count 156 transition count 156
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 4 with 88 rules applied. Total rules applied 170 place count 112 transition count 112
Applied a total of 170 rules in 32 ms. Remains 112 /197 variables (removed 85) and now considering 112/197 (removed 85) transitions.
// Phase 1: matrix 112 rows 112 cols
[2022-05-20 12:36:53] [INFO ] Computed 30 place invariants in 1 ms
[2022-05-20 12:36:53] [INFO ] Implicit Places using invariants in 160 ms returned [18, 19, 32, 39, 40, 51, 60, 94, 97, 98]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 166 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 102/197 places, 112/197 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 102 transition count 111
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 101 transition count 111
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 34 place count 85 transition count 95
Applied a total of 34 rules in 9 ms. Remains 85 /102 variables (removed 17) and now considering 95/112 (removed 17) transitions.
// Phase 1: matrix 95 rows 85 cols
[2022-05-20 12:36:53] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-20 12:36:53] [INFO ] Implicit Places using invariants in 89 ms returned []
// Phase 1: matrix 95 rows 85 cols
[2022-05-20 12:36:53] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-20 12:36:53] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-20 12:36:53] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 85/197 places, 95/197 transitions.
Finished structural reductions, in 2 iterations. Remains : 85/197 places, 95/197 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s16 1) (EQ s24 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 10477 reset in 135 ms.
Product exploration explored 100000 steps with 10448 reset in 151 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 112 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 128 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 95 rows 85 cols
[2022-05-20 12:36:54] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-20 12:36:54] [INFO ] [Real]Absence check using 18 positive place invariants in 7 ms returned sat
[2022-05-20 12:36:54] [INFO ] [Real]Absence check using 18 positive and 2 generalized place invariants in 5 ms returned sat
[2022-05-20 12:36:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 12:36:54] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2022-05-20 12:36:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 12:36:55] [INFO ] [Nat]Absence check using 18 positive place invariants in 6 ms returned sat
[2022-05-20 12:36:55] [INFO ] [Nat]Absence check using 18 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-20 12:36:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 12:36:55] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2022-05-20 12:36:55] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-20 12:36:55] [INFO ] [Nat]Added 68 Read/Feed constraints in 11 ms returned sat
[2022-05-20 12:36:55] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2022-05-20 12:36:55] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2022-05-20 12:36:55] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2022-05-20 12:36:55] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
[2022-05-20 12:36:55] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2022-05-20 12:36:55] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2022-05-20 12:36:55] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2022-05-20 12:36:55] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2022-05-20 12:36:55] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2022-05-20 12:36:55] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2022-05-20 12:36:55] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2022-05-20 12:36:55] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
[2022-05-20 12:36:55] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2022-05-20 12:36:55] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2022-05-20 12:36:55] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2022-05-20 12:36:55] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 0 ms to minimize.
[2022-05-20 12:36:55] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2022-05-20 12:36:55] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2022-05-20 12:36:55] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2022-05-20 12:36:55] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2022-05-20 12:36:56] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2022-05-20 12:36:56] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2022-05-20 12:36:56] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
[2022-05-20 12:36:56] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 1060 ms
[2022-05-20 12:36:56] [INFO ] Computed and/alt/rep : 93/218/93 causal constraints (skipped 0 transitions) in 10 ms.
[2022-05-20 12:36:56] [INFO ] Added : 82 causal constraints over 17 iterations in 217 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 95/95 transitions.
Applied a total of 0 rules in 3 ms. Remains 85 /85 variables (removed 0) and now considering 95/95 (removed 0) transitions.
// Phase 1: matrix 95 rows 85 cols
[2022-05-20 12:36:56] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-20 12:36:56] [INFO ] Implicit Places using invariants in 95 ms returned []
// Phase 1: matrix 95 rows 85 cols
[2022-05-20 12:36:56] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-20 12:36:56] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-20 12:36:56] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
[2022-05-20 12:36:56] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 95 rows 85 cols
[2022-05-20 12:36:56] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-20 12:36:56] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 85/85 places, 95/95 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 110 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 127 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 95 rows 85 cols
[2022-05-20 12:36:57] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-20 12:36:57] [INFO ] [Real]Absence check using 18 positive place invariants in 8 ms returned sat
[2022-05-20 12:36:57] [INFO ] [Real]Absence check using 18 positive and 2 generalized place invariants in 3 ms returned sat
[2022-05-20 12:36:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 12:36:57] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2022-05-20 12:36:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 12:36:57] [INFO ] [Nat]Absence check using 18 positive place invariants in 10 ms returned sat
[2022-05-20 12:36:57] [INFO ] [Nat]Absence check using 18 positive and 2 generalized place invariants in 3 ms returned sat
[2022-05-20 12:36:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 12:36:57] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2022-05-20 12:36:57] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-20 12:36:57] [INFO ] [Nat]Added 68 Read/Feed constraints in 14 ms returned sat
[2022-05-20 12:36:57] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 3 ms to minimize.
[2022-05-20 12:36:57] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2022-05-20 12:36:57] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2022-05-20 12:36:57] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 1 ms to minimize.
[2022-05-20 12:36:57] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
[2022-05-20 12:36:57] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2022-05-20 12:36:58] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 0 ms to minimize.
[2022-05-20 12:36:58] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 0 ms to minimize.
[2022-05-20 12:36:58] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2022-05-20 12:36:58] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2022-05-20 12:36:58] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2022-05-20 12:36:58] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
[2022-05-20 12:36:58] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 0 ms to minimize.
[2022-05-20 12:36:58] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2022-05-20 12:36:58] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2022-05-20 12:36:58] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2022-05-20 12:36:58] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2022-05-20 12:36:58] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2022-05-20 12:36:58] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2022-05-20 12:36:58] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2022-05-20 12:36:58] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2022-05-20 12:36:58] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 0 ms to minimize.
[2022-05-20 12:36:58] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2022-05-20 12:36:58] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 1413 ms
[2022-05-20 12:36:59] [INFO ] Computed and/alt/rep : 93/218/93 causal constraints (skipped 0 transitions) in 11 ms.
[2022-05-20 12:36:59] [INFO ] Added : 82 causal constraints over 17 iterations in 320 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 10490 reset in 222 ms.
Product exploration explored 100000 steps with 10509 reset in 253 ms.
Built C files in :
/tmp/ltsmin12975049095815785935
[2022-05-20 12:36:59] [INFO ] Computing symmetric may disable matrix : 95 transitions.
[2022-05-20 12:36:59] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:36:59] [INFO ] Computing symmetric may enable matrix : 95 transitions.
[2022-05-20 12:36:59] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:36:59] [INFO ] Computing Do-Not-Accords matrix : 95 transitions.
[2022-05-20 12:36:59] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:36:59] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12975049095815785935
Running compilation step : cd /tmp/ltsmin12975049095815785935;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 444 ms.
Running link step : cd /tmp/ltsmin12975049095815785935;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin12975049095815785935;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8886845364821584238.hoa' '--buchi-type=spotba'
LTSmin run took 2037 ms.
FORMULA ParamProductionCell-PT-3-LTLFireability-06 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-3-LTLFireability-06 finished in 8992 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!X(p0)) U (G(p2)&&p1))))'
Support contains 5 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 197/197 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 196 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 196 transition count 196
Applied a total of 2 rules in 5 ms. Remains 196 /197 variables (removed 1) and now considering 196/197 (removed 1) transitions.
// Phase 1: matrix 196 rows 196 cols
[2022-05-20 12:37:02] [INFO ] Computed 30 place invariants in 2 ms
[2022-05-20 12:37:02] [INFO ] Implicit Places using invariants in 204 ms returned [33, 34, 53, 65, 66, 86, 98, 166, 169]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 205 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/197 places, 196/197 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
[2022-05-20 12:37:02] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-20 12:37:02] [INFO ] Implicit Places using invariants in 153 ms returned []
// Phase 1: matrix 194 rows 185 cols
[2022-05-20 12:37:02] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-20 12:37:03] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-20 12:37:03] [INFO ] Implicit Places using invariants and state equation in 533 ms returned []
Implicit Place search using SMT with State Equation took 690 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/197 places, 194/197 transitions.
Finished structural reductions, in 2 iterations. Remains : 185/197 places, 194/197 transitions.
Stuttering acceptance computed with spot in 310 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), p0, (NOT p2), true, (AND (NOT p2) (NOT p0))]
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p1 p2), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 4}, { cond=(AND p2 p0), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s159 1) (EQ s166 1)), p2:(EQ s41 1), p0:(AND (EQ s83 1) (EQ s121 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 421 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-3-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-3-LTLFireability-07 finished in 1254 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p0 U p1)||F((F(X(p2))&&p2))))))'
Support contains 6 out of 197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 197/197 places, 197/197 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 197 transition count 178
Reduce places removed 19 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 21 rules applied. Total rules applied 40 place count 178 transition count 176
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 42 place count 176 transition count 176
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 42 place count 176 transition count 159
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 76 place count 159 transition count 159
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 77 place count 158 transition count 158
Iterating global reduction 3 with 1 rules applied. Total rules applied 78 place count 158 transition count 158
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 164 place count 115 transition count 115
Applied a total of 164 rules in 45 ms. Remains 115 /197 variables (removed 82) and now considering 115/197 (removed 82) transitions.
// Phase 1: matrix 115 rows 115 cols
[2022-05-20 12:37:03] [INFO ] Computed 30 place invariants in 1 ms
[2022-05-20 12:37:03] [INFO ] Implicit Places using invariants in 183 ms returned [18, 19, 32, 39, 40, 52, 97, 100, 101]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 186 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 106/197 places, 115/197 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 106 transition count 114
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 105 transition count 114
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 105 transition count 113
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 4 place count 104 transition count 113
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 28 place count 92 transition count 101
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 30 place count 91 transition count 100
Applied a total of 30 rules in 28 ms. Remains 91 /106 variables (removed 15) and now considering 100/115 (removed 15) transitions.
// Phase 1: matrix 100 rows 91 cols
[2022-05-20 12:37:03] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-20 12:37:04] [INFO ] Implicit Places using invariants in 95 ms returned []
// Phase 1: matrix 100 rows 91 cols
[2022-05-20 12:37:04] [INFO ] Computed 21 place invariants in 0 ms
[2022-05-20 12:37:04] [INFO ] State equation strengthened by 67 read => feed constraints.
[2022-05-20 12:37:04] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 91/197 places, 100/197 transitions.
Finished structural reductions, in 2 iterations. Remains : 91/197 places, 100/197 transitions.
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(OR (EQ s45 0) (EQ s46 0) (EQ s58 0)), p1:(AND (EQ s45 1) (EQ s50 1)), p0:(AND (EQ s79 1) (EQ s84 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 963 reset in 243 ms.
Product exploration explored 100000 steps with 981 reset in 164 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 366 ms. Reduced automaton from 3 states, 8 edges and 3 AP to 3 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 3701 steps, including 1 resets, run visited all 3 properties in 77 ms. (steps per millisecond=48 )
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) (NOT p2))), (F (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))), (F (AND p0 (NOT p1) (NOT p2)))]
Knowledge based reduction with 7 factoid took 435 ms. Reduced automaton from 3 states, 8 edges and 3 AP to 3 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 6 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 100/100 transitions.
Applied a total of 0 rules in 5 ms. Remains 91 /91 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 91 cols
[2022-05-20 12:37:06] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-20 12:37:06] [INFO ] Implicit Places using invariants in 120 ms returned []
// Phase 1: matrix 100 rows 91 cols
[2022-05-20 12:37:06] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-20 12:37:06] [INFO ] State equation strengthened by 67 read => feed constraints.
[2022-05-20 12:37:06] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
[2022-05-20 12:37:06] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 100 rows 91 cols
[2022-05-20 12:37:06] [INFO ] Computed 21 place invariants in 3 ms
[2022-05-20 12:37:06] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 91/91 places, 100/100 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 264 ms. Reduced automaton from 3 states, 8 edges and 3 AP to 3 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 139 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=34 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2) (NOT p1))), (F (OR (AND p0 (NOT p2)) (AND (NOT p2) p1))), (F (AND p0 (NOT p2) (NOT p1)))]
Knowledge based reduction with 7 factoid took 371 ms. Reduced automaton from 3 states, 8 edges and 3 AP to 3 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 1001 reset in 170 ms.
Product exploration explored 100000 steps with 981 reset in 164 ms.
Built C files in :
/tmp/ltsmin8388581685574100094
[2022-05-20 12:37:08] [INFO ] Computing symmetric may disable matrix : 100 transitions.
[2022-05-20 12:37:08] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:37:08] [INFO ] Computing symmetric may enable matrix : 100 transitions.
[2022-05-20 12:37:08] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:37:08] [INFO ] Computing Do-Not-Accords matrix : 100 transitions.
[2022-05-20 12:37:08] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:37:08] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8388581685574100094
Running compilation step : cd /tmp/ltsmin8388581685574100094;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 476 ms.
Running link step : cd /tmp/ltsmin8388581685574100094;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin8388581685574100094;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9601867299564697361.hoa' '--buchi-type=spotba'
LTSmin run took 1081 ms.
FORMULA ParamProductionCell-PT-3-LTLFireability-08 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-3-LTLFireability-08 finished in 6045 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 197/197 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 196 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 196 transition count 196
Applied a total of 2 rules in 4 ms. Remains 196 /197 variables (removed 1) and now considering 196/197 (removed 1) transitions.
// Phase 1: matrix 196 rows 196 cols
[2022-05-20 12:37:09] [INFO ] Computed 30 place invariants in 1 ms
[2022-05-20 12:37:09] [INFO ] Implicit Places using invariants in 167 ms returned [33, 34, 53, 65, 66, 86, 98, 166, 169, 170]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 169 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 186/197 places, 196/197 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 184 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 184 transition count 194
Applied a total of 4 rules in 3 ms. Remains 184 /186 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 184 cols
[2022-05-20 12:37:09] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-20 12:37:10] [INFO ] Implicit Places using invariants in 135 ms returned []
// Phase 1: matrix 194 rows 184 cols
[2022-05-20 12:37:10] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-20 12:37:10] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-20 12:37:10] [INFO ] Implicit Places using invariants and state equation in 401 ms returned []
Implicit Place search using SMT with State Equation took 538 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 184/197 places, 194/197 transitions.
Finished structural reductions, in 2 iterations. Remains : 184/197 places, 194/197 transitions.
Stuttering acceptance computed with spot in 142 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(NEQ s26 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 146 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-3-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-3-LTLFireability-10 finished in 873 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 2 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 197/197 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 196 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 196 transition count 196
Applied a total of 2 rules in 6 ms. Remains 196 /197 variables (removed 1) and now considering 196/197 (removed 1) transitions.
// Phase 1: matrix 196 rows 196 cols
[2022-05-20 12:37:10] [INFO ] Computed 30 place invariants in 2 ms
[2022-05-20 12:37:10] [INFO ] Implicit Places using invariants in 280 ms returned [33, 34, 53, 65, 66, 86, 98, 166, 169, 170]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 282 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 186/197 places, 196/197 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 184 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 184 transition count 194
Applied a total of 4 rules in 5 ms. Remains 184 /186 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 184 cols
[2022-05-20 12:37:10] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-20 12:37:11] [INFO ] Implicit Places using invariants in 197 ms returned []
// Phase 1: matrix 194 rows 184 cols
[2022-05-20 12:37:11] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-20 12:37:11] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-20 12:37:11] [INFO ] Implicit Places using invariants and state equation in 550 ms returned []
Implicit Place search using SMT with State Equation took 749 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 184/197 places, 194/197 transitions.
Finished structural reductions, in 2 iterations. Remains : 184/197 places, 194/197 transitions.
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p0:(AND (EQ s83 1) (EQ s146 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][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-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-3-LTLFireability-11 finished in 1233 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(G(X(p0)))||(X(F(p2))&&p1))))))'
Support contains 4 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 197/197 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 196 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 196 transition count 196
Applied a total of 2 rules in 8 ms. Remains 196 /197 variables (removed 1) and now considering 196/197 (removed 1) transitions.
// Phase 1: matrix 196 rows 196 cols
[2022-05-20 12:37:11] [INFO ] Computed 30 place invariants in 1 ms
[2022-05-20 12:37:12] [INFO ] Implicit Places using invariants in 267 ms returned [33, 34, 53, 65, 86, 98, 166, 170]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 269 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/197 places, 196/197 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 6 ms. Remains 186 /188 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 186 cols
[2022-05-20 12:37:12] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-20 12:37:12] [INFO ] Implicit Places using invariants in 172 ms returned []
// Phase 1: matrix 194 rows 186 cols
[2022-05-20 12:37:12] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 12:37:12] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-20 12:37:12] [INFO ] Implicit Places using invariants and state equation in 442 ms returned []
Implicit Place search using SMT with State Equation took 617 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 186/197 places, 194/197 transitions.
Finished structural reductions, in 2 iterations. Remains : 186/197 places, 194/197 transitions.
Stuttering acceptance computed with spot in 350 ms :[(OR (AND (NOT p0) (NOT p1)) (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))), (NOT p0), (AND (NOT p2) (NOT p0)), (NOT p0), true, (AND (NOT p2) (NOT p0)), (NOT p2)]
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={} source=4 dest: 7}], [{ cond=p0, acceptance={} source=5 dest: 5}, { cond=(NOT p0), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p2) p0), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=7 dest: 8}], [{ cond=(NOT p2), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p1:(AND (EQ s62 1) (EQ s63 1)), p2:(AND (EQ s62 1) (EQ s63 1)), p0:(AND (EQ s160 1) (EQ s168 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-3-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-3-LTLFireability-12 finished in 1289 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((X(X(X(G(p0))))||p1)))))'
Support contains 7 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 197/197 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 196 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 196 transition count 196
Applied a total of 2 rules in 5 ms. Remains 196 /197 variables (removed 1) and now considering 196/197 (removed 1) transitions.
// Phase 1: matrix 196 rows 196 cols
[2022-05-20 12:37:13] [INFO ] Computed 30 place invariants in 2 ms
[2022-05-20 12:37:13] [INFO ] Implicit Places using invariants in 173 ms returned [33, 34, 53, 65, 66, 86, 166, 169, 170]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 176 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/197 places, 196/197 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 4 ms. Remains 185 /187 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 185 cols
[2022-05-20 12:37:13] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-20 12:37:13] [INFO ] Implicit Places using invariants in 118 ms returned []
// Phase 1: matrix 194 rows 185 cols
[2022-05-20 12:37:13] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-20 12:37:13] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-20 12:37:14] [INFO ] Implicit Places using invariants and state equation in 547 ms returned []
Implicit Place search using SMT with State Equation took 667 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/197 places, 194/197 transitions.
Finished structural reductions, in 2 iterations. Remains : 185/197 places, 194/197 transitions.
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (OR (EQ s49 0) (EQ s55 0)) (OR (EQ s61 0) (EQ s68 0))), p1:(AND (EQ s90 1) (EQ s91 1) (EQ s95 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 539 reset in 263 ms.
Product exploration explored 100000 steps with 534 reset in 303 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 142 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 71 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=23 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 201 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 7 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 194/194 transitions.
Applied a total of 0 rules in 3 ms. Remains 185 /185 variables (removed 0) and now considering 194/194 (removed 0) transitions.
// Phase 1: matrix 194 rows 185 cols
[2022-05-20 12:37:15] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-20 12:37:15] [INFO ] Implicit Places using invariants in 141 ms returned []
// Phase 1: matrix 194 rows 185 cols
[2022-05-20 12:37:15] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-20 12:37:15] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-20 12:37:16] [INFO ] Implicit Places using invariants and state equation in 497 ms returned []
Implicit Place search using SMT with State Equation took 641 ms to find 0 implicit places.
// Phase 1: matrix 194 rows 185 cols
[2022-05-20 12:37:16] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-20 12:37:16] [INFO ] Dead Transitions using invariants and state equation in 237 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 185/185 places, 194/194 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 205 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 74 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=24 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 234 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 538 reset in 204 ms.
Product exploration explored 100000 steps with 542 reset in 180 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 7 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 194/194 transitions.
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 185 transition count 194
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 14 Pre rules applied. Total rules applied 34 place count 185 transition count 196
Deduced a syphon composed of 48 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 48 place count 185 transition count 196
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 55 place count 178 transition count 188
Deduced a syphon composed of 41 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 62 place count 178 transition count 188
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 84 places in 0 ms
Iterating global reduction 1 with 43 rules applied. Total rules applied 105 place count 178 transition count 188
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 131 place count 152 transition count 162
Deduced a syphon composed of 58 places in 0 ms
Iterating global reduction 1 with 26 rules applied. Total rules applied 157 place count 152 transition count 162
Deduced a syphon composed of 58 places in 0 ms
Applied a total of 157 rules in 28 ms. Remains 152 /185 variables (removed 33) and now considering 162/194 (removed 32) transitions.
[2022-05-20 12:37:18] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 162 rows 152 cols
[2022-05-20 12:37:18] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-20 12:37:18] [INFO ] Dead Transitions using invariants and state equation in 182 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 152/185 places, 162/194 transitions.
Finished structural reductions, in 1 iterations. Remains : 152/185 places, 162/194 transitions.
Product exploration explored 100000 steps with 1123 reset in 258 ms.
Product exploration explored 100000 steps with 1114 reset in 222 ms.
Built C files in :
/tmp/ltsmin6384551677655420646
[2022-05-20 12:37:18] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6384551677655420646
Running compilation step : cd /tmp/ltsmin6384551677655420646;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 500 ms.
Running link step : cd /tmp/ltsmin6384551677655420646;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin6384551677655420646;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased18143318590179668670.hoa' '--buchi-type=spotba'
LTSmin run took 6646 ms.
FORMULA ParamProductionCell-PT-3-LTLFireability-13 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-3-LTLFireability-13 finished in 12883 ms.
All properties solved by simple procedures.
Total runtime 61872 ms.

BK_STOP 1653050246230

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="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 r150-smll-165276998600276"
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 ;