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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 404K
-rw-r--r-- 1 mcc users 9.2K Apr 29 17:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Apr 29 17:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 29 17:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K 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.2K May 9 08:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 149K 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-0-LTLFireability-00
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-01
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-02
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-03
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-04
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-05
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-06
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-07
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-08
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-09
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-10
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-11
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-12
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-13
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-14
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653049388650

Running Version 202205111006
[2022-05-20 12:23:11] [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:23:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 12:23:11] [INFO ] Load time of PNML (sax parser for PT used): 305 ms
[2022-05-20 12:23:11] [INFO ] Transformed 198 places.
[2022-05-20 12:23:11] [INFO ] Transformed 176 transitions.
[2022-05-20 12:23:11] [INFO ] Found NUPN structural information;
[2022-05-20 12:23:11] [INFO ] Parsed PT model containing 198 places and 176 transitions in 550 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ParamProductionCell-PT-0-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-0-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-0-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 54 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 176/176 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 193 transition count 171
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 193 transition count 171
Applied a total of 10 rules in 65 ms. Remains 193 /198 variables (removed 5) and now considering 171/176 (removed 5) transitions.
// Phase 1: matrix 171 rows 193 cols
[2022-05-20 12:23:12] [INFO ] Computed 49 place invariants in 33 ms
[2022-05-20 12:23:12] [INFO ] Implicit Places using invariants in 632 ms returned [15, 19, 35, 36, 42, 46, 47, 59, 79, 114, 116, 118, 119, 160, 165, 166]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 698 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 177/198 places, 171/176 transitions.
Applied a total of 0 rules in 14 ms. Remains 177 /177 variables (removed 0) and now considering 171/171 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 177/198 places, 171/176 transitions.
Support contains 54 out of 177 places after structural reductions.
[2022-05-20 12:23:13] [INFO ] Flatten gal took : 96 ms
[2022-05-20 12:23:13] [INFO ] Flatten gal took : 43 ms
[2022-05-20 12:23:13] [INFO ] Input system was already deterministic with 171 transitions.
Support contains 52 out of 177 places (down from 54) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 675 ms. (steps per millisecond=14 ) properties (out of 27) seen :26
Finished Best-First random walk after 232 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=77 )
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' '!((G(F(p0))||X(X(X((X(p2)||p1))))))'
Support contains 9 out of 177 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 171/171 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 176 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 176 transition count 170
Applied a total of 2 rules in 23 ms. Remains 176 /177 variables (removed 1) and now considering 170/171 (removed 1) transitions.
// Phase 1: matrix 170 rows 176 cols
[2022-05-20 12:23:14] [INFO ] Computed 33 place invariants in 4 ms
[2022-05-20 12:23:14] [INFO ] Implicit Places using invariants in 233 ms returned [15, 17, 29, 56, 57, 65, 70, 89, 90, 104, 146, 148]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 236 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 164/177 places, 170/171 transitions.
Applied a total of 0 rules in 6 ms. Remains 164 /164 variables (removed 0) and now considering 170/170 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 164/177 places, 170/171 transitions.
Stuttering acceptance computed with spot in 410 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-0-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(NOT p2), acceptance={} source=4 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=true, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(OR (AND (EQ s20 1) (EQ s21 1) (EQ s25 1)) (AND (EQ s80 1) (EQ s91 1))), p2:(AND (EQ s83 1) (EQ s86 1) (EQ s91 1)), p0:(AND (EQ s34 1) (EQ s38 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][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1888 reset in 491 ms.
Product exploration explored 100000 steps with 1886 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 (NOT p1) (NOT p2) (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 106 ms. Reduced automaton from 7 states, 9 edges and 3 AP to 7 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 259 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0)]
Finished random walk after 207 steps, including 0 resets, run visited all 4 properties in 12 ms. (steps per millisecond=17 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), true]
False Knowledge obtained : [(F p0), (F p1), (F p2), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 2 factoid took 365 ms. Reduced automaton from 7 states, 9 edges and 3 AP to 7 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 359 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 338 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0)]
// Phase 1: matrix 170 rows 164 cols
[2022-05-20 12:23:17] [INFO ] Computed 21 place invariants in 4 ms
[2022-05-20 12:23:17] [INFO ] [Real]Absence check using 20 positive place invariants in 15 ms returned sat
[2022-05-20 12:23:17] [INFO ] [Real]Absence check using 20 positive and 1 generalized place invariants in 3 ms returned sat
[2022-05-20 12:23:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 12:23:17] [INFO ] [Real]Absence check using state equation in 234 ms returned sat
[2022-05-20 12:23:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 12:23:18] [INFO ] [Nat]Absence check using 20 positive place invariants in 18 ms returned sat
[2022-05-20 12:23:18] [INFO ] [Nat]Absence check using 20 positive and 1 generalized place invariants in 10 ms returned sat
[2022-05-20 12:23:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 12:23:18] [INFO ] [Nat]Absence check using state equation in 249 ms returned sat
[2022-05-20 12:23:18] [INFO ] State equation strengthened by 59 read => feed constraints.
[2022-05-20 12:23:18] [INFO ] [Nat]Added 59 Read/Feed constraints in 42 ms returned sat
[2022-05-20 12:23:18] [INFO ] Deduced a trap composed of 5 places in 123 ms of which 5 ms to minimize.
[2022-05-20 12:23:18] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 2 ms to minimize.
[2022-05-20 12:23:19] [INFO ] Deduced a trap composed of 26 places in 112 ms of which 2 ms to minimize.
[2022-05-20 12:23:19] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 3 ms to minimize.
[2022-05-20 12:23:19] [INFO ] Deduced a trap composed of 30 places in 112 ms of which 2 ms to minimize.
[2022-05-20 12:23:19] [INFO ] Deduced a trap composed of 57 places in 74 ms of which 1 ms to minimize.
[2022-05-20 12:23:19] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 1 ms to minimize.
[2022-05-20 12:23:19] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 1 ms to minimize.
[2022-05-20 12:23:19] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 1 ms to minimize.
[2022-05-20 12:23:19] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2022-05-20 12:23:19] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 1 ms to minimize.
[2022-05-20 12:23:20] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 0 ms to minimize.
[2022-05-20 12:23:20] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 1 ms to minimize.
[2022-05-20 12:23:20] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 1 ms to minimize.
[2022-05-20 12:23:20] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 0 ms to minimize.
[2022-05-20 12:23:20] [INFO ] Deduced a trap composed of 46 places in 89 ms of which 0 ms to minimize.
[2022-05-20 12:23:20] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 1 ms to minimize.
[2022-05-20 12:23:20] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 1 ms to minimize.
[2022-05-20 12:23:20] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2022-05-20 12:23:20] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2139 ms
[2022-05-20 12:23:20] [INFO ] Computed and/alt/rep : 162/302/162 causal constraints (skipped 7 transitions) in 25 ms.
[2022-05-20 12:23:21] [INFO ] Added : 145 causal constraints over 29 iterations in 1087 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0) (NOT p2))
Support contains 9 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 170/170 transitions.
Applied a total of 0 rules in 7 ms. Remains 164 /164 variables (removed 0) and now considering 170/170 (removed 0) transitions.
// Phase 1: matrix 170 rows 164 cols
[2022-05-20 12:23:21] [INFO ] Computed 21 place invariants in 4 ms
[2022-05-20 12:23:21] [INFO ] Implicit Places using invariants in 147 ms returned []
// Phase 1: matrix 170 rows 164 cols
[2022-05-20 12:23:21] [INFO ] Computed 21 place invariants in 4 ms
[2022-05-20 12:23:22] [INFO ] State equation strengthened by 59 read => feed constraints.
[2022-05-20 12:23:22] [INFO ] Implicit Places using invariants and state equation in 494 ms returned []
Implicit Place search using SMT with State Equation took 645 ms to find 0 implicit places.
// Phase 1: matrix 170 rows 164 cols
[2022-05-20 12:23:22] [INFO ] Computed 21 place invariants in 7 ms
[2022-05-20 12:23:22] [INFO ] Dead Transitions using invariants and state equation in 251 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 164/164 places, 170/170 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 130 ms. Reduced automaton from 7 states, 9 edges and 3 AP to 7 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 356 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0)]
Finished random walk after 474 steps, including 0 resets, run visited all 4 properties in 12 ms. (steps per millisecond=39 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), true]
False Knowledge obtained : [(F p0), (F p1), (F p2), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 2 factoid took 253 ms. Reduced automaton from 7 states, 9 edges and 3 AP to 7 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 353 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 354 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0)]
// Phase 1: matrix 170 rows 164 cols
[2022-05-20 12:23:24] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-20 12:23:24] [INFO ] [Real]Absence check using 20 positive place invariants in 17 ms returned sat
[2022-05-20 12:23:24] [INFO ] [Real]Absence check using 20 positive and 1 generalized place invariants in 3 ms returned sat
[2022-05-20 12:23:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 12:23:24] [INFO ] [Real]Absence check using state equation in 256 ms returned sat
[2022-05-20 12:23:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 12:23:25] [INFO ] [Nat]Absence check using 20 positive place invariants in 17 ms returned sat
[2022-05-20 12:23:25] [INFO ] [Nat]Absence check using 20 positive and 1 generalized place invariants in 5 ms returned sat
[2022-05-20 12:23:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 12:23:25] [INFO ] [Nat]Absence check using state equation in 239 ms returned sat
[2022-05-20 12:23:25] [INFO ] State equation strengthened by 59 read => feed constraints.
[2022-05-20 12:23:25] [INFO ] [Nat]Added 59 Read/Feed constraints in 35 ms returned sat
[2022-05-20 12:23:25] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 1 ms to minimize.
[2022-05-20 12:23:25] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 0 ms to minimize.
[2022-05-20 12:23:25] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 1 ms to minimize.
[2022-05-20 12:23:25] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 1 ms to minimize.
[2022-05-20 12:23:25] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 1 ms to minimize.
[2022-05-20 12:23:26] [INFO ] Deduced a trap composed of 57 places in 90 ms of which 0 ms to minimize.
[2022-05-20 12:23:26] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 1 ms to minimize.
[2022-05-20 12:23:26] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 1 ms to minimize.
[2022-05-20 12:23:26] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 0 ms to minimize.
[2022-05-20 12:23:26] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 1 ms to minimize.
[2022-05-20 12:23:26] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 1 ms to minimize.
[2022-05-20 12:23:26] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 1 ms to minimize.
[2022-05-20 12:23:26] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 1 ms to minimize.
[2022-05-20 12:23:27] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 1 ms to minimize.
[2022-05-20 12:23:27] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 2 ms to minimize.
[2022-05-20 12:23:27] [INFO ] Deduced a trap composed of 46 places in 90 ms of which 1 ms to minimize.
[2022-05-20 12:23:27] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 0 ms to minimize.
[2022-05-20 12:23:27] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 1 ms to minimize.
[2022-05-20 12:23:27] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2022-05-20 12:23:27] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2266 ms
[2022-05-20 12:23:27] [INFO ] Computed and/alt/rep : 162/302/162 causal constraints (skipped 7 transitions) in 23 ms.
[2022-05-20 12:23:28] [INFO ] Added : 145 causal constraints over 29 iterations in 1052 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 369 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1885 reset in 281 ms.
Product exploration explored 100000 steps with 1889 reset in 469 ms.
Applying partial POR strategy [false, false, false, false, true, true, true]
Stuttering acceptance computed with spot in 240 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0)]
Support contains 9 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 170/170 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 164 transition count 170
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 13 Pre rules applied. Total rules applied 24 place count 164 transition count 170
Deduced a syphon composed of 37 places in 1 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 37 place count 164 transition count 170
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 43 place count 158 transition count 164
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 49 place count 158 transition count 164
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 62 places in 1 ms
Iterating global reduction 1 with 31 rules applied. Total rules applied 80 place count 158 transition count 164
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 97 place count 141 transition count 147
Deduced a syphon composed of 45 places in 1 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 114 place count 141 transition count 147
Deduced a syphon composed of 45 places in 0 ms
Applied a total of 114 rules in 40 ms. Remains 141 /164 variables (removed 23) and now considering 147/170 (removed 23) transitions.
[2022-05-20 12:23:30] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 147 rows 141 cols
[2022-05-20 12:23:30] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-20 12:23:30] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 141/164 places, 147/170 transitions.
Finished structural reductions, in 1 iterations. Remains : 141/164 places, 147/170 transitions.
Product exploration explored 100000 steps with 2937 reset in 589 ms.
Product exploration explored 100000 steps with 2938 reset in 334 ms.
Built C files in :
/tmp/ltsmin5283365296718411774
[2022-05-20 12:23:31] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5283365296718411774
Running compilation step : cd /tmp/ltsmin5283365296718411774;'/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 781 ms.
Running link step : cd /tmp/ltsmin5283365296718411774;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 66 ms.
Running LTSmin : cd /tmp/ltsmin5283365296718411774;'/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/stateBased12463469363487281653.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 9 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 170/170 transitions.
Applied a total of 0 rules in 5 ms. Remains 164 /164 variables (removed 0) and now considering 170/170 (removed 0) transitions.
// Phase 1: matrix 170 rows 164 cols
[2022-05-20 12:23:46] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-20 12:23:46] [INFO ] Implicit Places using invariants in 133 ms returned []
// Phase 1: matrix 170 rows 164 cols
[2022-05-20 12:23:46] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-20 12:23:46] [INFO ] State equation strengthened by 59 read => feed constraints.
[2022-05-20 12:23:46] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 445 ms to find 0 implicit places.
// Phase 1: matrix 170 rows 164 cols
[2022-05-20 12:23:46] [INFO ] Computed 21 place invariants in 14 ms
[2022-05-20 12:23:47] [INFO ] Dead Transitions using invariants and state equation in 268 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 164/164 places, 170/170 transitions.
Built C files in :
/tmp/ltsmin6986518704984423341
[2022-05-20 12:23:47] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6986518704984423341
Running compilation step : cd /tmp/ltsmin6986518704984423341;'/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 627 ms.
Running link step : cd /tmp/ltsmin6986518704984423341;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin6986518704984423341;'/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/stateBased2794980025960690181.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 12:24:02] [INFO ] Flatten gal took : 23 ms
[2022-05-20 12:24:02] [INFO ] Flatten gal took : 21 ms
[2022-05-20 12:24:02] [INFO ] Time to serialize gal into /tmp/LTL15553546844006801762.gal : 6 ms
[2022-05-20 12:24:02] [INFO ] Time to serialize properties into /tmp/LTL14991450134296001655.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15553546844006801762.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14991450134296001655.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1555354...268
Read 1 LTL properties
Checking formula 0 : !(((G(F("((table_right==1)&&(TL_rot_rs==1))")))||(X(X(X(((X("(((robot_left==1)&&(arm1_release_angle==1))&&(A2U_rot2_run==1))"))||("(((...274
Formula 0 simplified : !(GF"((table_right==1)&&(TL_rot_rs==1))" | XXX("(((press_upward==1)&&(press_at_middle_pos==1))&&(forge_run==1))" | "((arm2_release_a...255
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t14, t22, t26, t30, t34, t42, t46, t54, t58, t62, t65, t71, t72, t73, t75, t77, t79,...411
8 unique states visited
0 strongly connected components in search stack
8 transitions explored
7 items max in DFS search stack
977 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,9.83572,261280,1,0,1586,1.36702e+06,383,303,5023,1.07778e+06,3345
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ParamProductionCell-PT-0-LTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property ParamProductionCell-PT-0-LTLFireability-00 finished in 59363 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(G(!F(p0)) U p1))'
Support contains 4 out of 177 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 177/177 places, 171/171 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 177 transition count 156
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 162 transition count 156
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 30 place count 162 transition count 144
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 54 place count 150 transition count 144
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 149 transition count 143
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 149 transition count 143
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 104 place count 124 transition count 120
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 104 place count 124 transition count 119
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 107 place count 122 transition count 119
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 109 place count 121 transition count 118
Applied a total of 109 rules in 36 ms. Remains 121 /177 variables (removed 56) and now considering 118/171 (removed 53) transitions.
// Phase 1: matrix 118 rows 121 cols
[2022-05-20 12:24:13] [INFO ] Computed 30 place invariants in 3 ms
[2022-05-20 12:24:14] [INFO ] Implicit Places using invariants in 297 ms returned [0, 9, 10, 14, 19, 24, 36, 37, 43, 46, 56, 57, 59, 71, 100, 102]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 300 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/177 places, 118/171 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 105 transition count 115
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 102 transition count 115
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 102 transition count 114
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 8 place count 101 transition count 114
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 10 place count 99 transition count 112
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 99 transition count 112
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 76 place count 67 transition count 80
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 78 place count 66 transition count 79
Applied a total of 78 rules in 40 ms. Remains 66 /105 variables (removed 39) and now considering 79/118 (removed 39) transitions.
// Phase 1: matrix 79 rows 66 cols
[2022-05-20 12:24:14] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-20 12:24:14] [INFO ] Implicit Places using invariants in 136 ms returned []
// Phase 1: matrix 79 rows 66 cols
[2022-05-20 12:24:14] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-20 12:24:14] [INFO ] State equation strengthened by 58 read => feed constraints.
[2022-05-20 12:24:14] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 66/177 places, 79/171 transitions.
Finished structural reductions, in 2 iterations. Remains : 66/177 places, 79/171 transitions.
Stuttering acceptance computed with spot in 180 ms :[true, (NOT p0), p1, (AND (NOT p0) p1)]
Running random walk in product with property : ParamProductionCell-PT-0-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(AND (EQ s33 1) (EQ s50 1)), p1:(AND (EQ s55 1) (EQ s65 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 105 reset in 246 ms.
Stack based approach found an accepted trace after 245 steps with 3 reset with depth 92 and stack size 92 in 1 ms.
FORMULA ParamProductionCell-PT-0-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-0-LTLFireability-01 finished in 1102 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!X(p0) U (F(p1)&&X(p2))))'
Support contains 6 out of 177 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 171/171 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 176 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 176 transition count 170
Applied a total of 2 rules in 9 ms. Remains 176 /177 variables (removed 1) and now considering 170/171 (removed 1) transitions.
// Phase 1: matrix 170 rows 176 cols
[2022-05-20 12:24:14] [INFO ] Computed 33 place invariants in 6 ms
[2022-05-20 12:24:15] [INFO ] Implicit Places using invariants in 164 ms returned [15, 17, 29, 37, 56, 57, 65, 70, 89, 92, 104, 148]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 167 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 164/177 places, 170/171 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 162 transition count 168
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 162 transition count 168
Applied a total of 4 rules in 7 ms. Remains 162 /164 variables (removed 2) and now considering 168/170 (removed 2) transitions.
// Phase 1: matrix 168 rows 162 cols
[2022-05-20 12:24:15] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-20 12:24:15] [INFO ] Implicit Places using invariants in 98 ms returned []
// Phase 1: matrix 168 rows 162 cols
[2022-05-20 12:24:15] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-20 12:24:15] [INFO ] State equation strengthened by 59 read => feed constraints.
[2022-05-20 12:24:15] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 162/177 places, 168/171 transitions.
Finished structural reductions, in 2 iterations. Remains : 162/177 places, 168/171 transitions.
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), true]
Running random walk in product with property : ParamProductionCell-PT-0-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s20 1) (EQ s24 1)), p0:(AND (EQ s81 1) (EQ s126 1)), p2:(AND (EQ s134 1) (EQ s136 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1093 reset in 271 ms.
Product exploration explored 100000 steps with 1093 reset in 376 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT p1)), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), true, (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 522 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 4 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 180 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), true]
Finished random walk after 132 steps, including 0 resets, run visited all 4 properties in 7 ms. (steps per millisecond=18 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT p1)), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), true, (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (AND p0 (NOT p2))), (F p1), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2))))]
Knowledge based reduction with 10 factoid took 577 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 4 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), true]
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), true]
// Phase 1: matrix 168 rows 162 cols
[2022-05-20 12:24:17] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-20 12:24:18] [INFO ] [Real]Absence check using 21 positive place invariants in 17 ms returned sat
[2022-05-20 12:24:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 12:24:18] [INFO ] [Real]Absence check using state equation in 237 ms returned sat
[2022-05-20 12:24:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 12:24:18] [INFO ] [Nat]Absence check using 21 positive place invariants in 18 ms returned sat
[2022-05-20 12:24:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 12:24:18] [INFO ] [Nat]Absence check using state equation in 192 ms returned sat
[2022-05-20 12:24:18] [INFO ] State equation strengthened by 59 read => feed constraints.
[2022-05-20 12:24:18] [INFO ] [Nat]Added 59 Read/Feed constraints in 23 ms returned sat
[2022-05-20 12:24:18] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 1 ms to minimize.
[2022-05-20 12:24:18] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 0 ms to minimize.
[2022-05-20 12:24:18] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 1 ms to minimize.
[2022-05-20 12:24:19] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 0 ms to minimize.
[2022-05-20 12:24:19] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 0 ms to minimize.
[2022-05-20 12:24:19] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 0 ms to minimize.
[2022-05-20 12:24:19] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 1 ms to minimize.
[2022-05-20 12:24:19] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 0 ms to minimize.
[2022-05-20 12:24:19] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2022-05-20 12:24:19] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 0 ms to minimize.
[2022-05-20 12:24:19] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 1 ms to minimize.
[2022-05-20 12:24:19] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 0 ms to minimize.
[2022-05-20 12:24:19] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2022-05-20 12:24:19] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
[2022-05-20 12:24:19] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 0 ms to minimize.
[2022-05-20 12:24:20] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 1 ms to minimize.
[2022-05-20 12:24:20] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 0 ms to minimize.
[2022-05-20 12:24:20] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 1505 ms
[2022-05-20 12:24:20] [INFO ] Computed and/alt/rep : 167/278/167 causal constraints (skipped 0 transitions) in 20 ms.
[2022-05-20 12:24:21] [INFO ] Added : 163 causal constraints over 33 iterations in 866 ms. Result :sat
Could not prove EG (NOT p1)
// Phase 1: matrix 168 rows 162 cols
[2022-05-20 12:24:21] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-20 12:24:21] [INFO ] [Real]Absence check using 21 positive place invariants in 14 ms returned sat
[2022-05-20 12:24:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 12:24:21] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2022-05-20 12:24:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 12:24:21] [INFO ] [Nat]Absence check using 21 positive place invariants in 12 ms returned sat
[2022-05-20 12:24:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 12:24:21] [INFO ] [Nat]Absence check using state equation in 122 ms returned sat
[2022-05-20 12:24:21] [INFO ] State equation strengthened by 59 read => feed constraints.
[2022-05-20 12:24:21] [INFO ] [Nat]Added 59 Read/Feed constraints in 15 ms returned sat
[2022-05-20 12:24:21] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 1 ms to minimize.
[2022-05-20 12:24:21] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 10 ms to minimize.
[2022-05-20 12:24:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 153 ms
[2022-05-20 12:24:21] [INFO ] Computed and/alt/rep : 167/278/167 causal constraints (skipped 0 transitions) in 12 ms.
[2022-05-20 12:24:22] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 1 ms to minimize.
[2022-05-20 12:24:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2022-05-20 12:24:22] [INFO ] Added : 81 causal constraints over 17 iterations in 526 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 6 out of 162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 168/168 transitions.
Applied a total of 0 rules in 3 ms. Remains 162 /162 variables (removed 0) and now considering 168/168 (removed 0) transitions.
// Phase 1: matrix 168 rows 162 cols
[2022-05-20 12:24:22] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-20 12:24:22] [INFO ] Implicit Places using invariants in 198 ms returned []
// Phase 1: matrix 168 rows 162 cols
[2022-05-20 12:24:22] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-20 12:24:22] [INFO ] State equation strengthened by 59 read => feed constraints.
[2022-05-20 12:24:22] [INFO ] Implicit Places using invariants and state equation in 404 ms returned []
Implicit Place search using SMT with State Equation took 604 ms to find 0 implicit places.
// Phase 1: matrix 168 rows 162 cols
[2022-05-20 12:24:22] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-20 12:24:23] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 162/162 places, 168/168 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT p1)), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), true, (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 410 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 4 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), true]
Finished random walk after 1766 steps, including 0 resets, run visited all 4 properties in 12 ms. (steps per millisecond=147 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT p1)), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), true, (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (AND p0 (NOT p2))), (F p1), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2))))]
Knowledge based reduction with 10 factoid took 481 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 4 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), true]
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), true]
// Phase 1: matrix 168 rows 162 cols
[2022-05-20 12:24:24] [INFO ] Computed 21 place invariants in 5 ms
[2022-05-20 12:24:24] [INFO ] [Real]Absence check using 21 positive place invariants in 12 ms returned sat
[2022-05-20 12:24:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 12:24:24] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2022-05-20 12:24:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 12:24:24] [INFO ] [Nat]Absence check using 21 positive place invariants in 18 ms returned sat
[2022-05-20 12:24:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 12:24:25] [INFO ] [Nat]Absence check using state equation in 175 ms returned sat
[2022-05-20 12:24:25] [INFO ] State equation strengthened by 59 read => feed constraints.
[2022-05-20 12:24:25] [INFO ] [Nat]Added 59 Read/Feed constraints in 19 ms returned sat
[2022-05-20 12:24:25] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 1 ms to minimize.
[2022-05-20 12:24:25] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 1 ms to minimize.
[2022-05-20 12:24:25] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 0 ms to minimize.
[2022-05-20 12:24:25] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2022-05-20 12:24:25] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 0 ms to minimize.
[2022-05-20 12:24:25] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 0 ms to minimize.
[2022-05-20 12:24:25] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 0 ms to minimize.
[2022-05-20 12:24:25] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 1 ms to minimize.
[2022-05-20 12:24:25] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 0 ms to minimize.
[2022-05-20 12:24:25] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 1 ms to minimize.
[2022-05-20 12:24:26] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 1 ms to minimize.
[2022-05-20 12:24:26] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 0 ms to minimize.
[2022-05-20 12:24:26] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 0 ms to minimize.
[2022-05-20 12:24:26] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 0 ms to minimize.
[2022-05-20 12:24:26] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 0 ms to minimize.
[2022-05-20 12:24:26] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 0 ms to minimize.
[2022-05-20 12:24:26] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 0 ms to minimize.
[2022-05-20 12:24:26] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 1365 ms
[2022-05-20 12:24:26] [INFO ] Computed and/alt/rep : 167/278/167 causal constraints (skipped 0 transitions) in 12 ms.
[2022-05-20 12:24:27] [INFO ] Added : 163 causal constraints over 33 iterations in 723 ms. Result :sat
Could not prove EG (NOT p1)
// Phase 1: matrix 168 rows 162 cols
[2022-05-20 12:24:27] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-20 12:24:27] [INFO ] [Real]Absence check using 21 positive place invariants in 15 ms returned sat
[2022-05-20 12:24:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 12:24:27] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2022-05-20 12:24:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 12:24:27] [INFO ] [Nat]Absence check using 21 positive place invariants in 11 ms returned sat
[2022-05-20 12:24:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 12:24:27] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2022-05-20 12:24:27] [INFO ] State equation strengthened by 59 read => feed constraints.
[2022-05-20 12:24:27] [INFO ] [Nat]Added 59 Read/Feed constraints in 19 ms returned sat
[2022-05-20 12:24:27] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 1 ms to minimize.
[2022-05-20 12:24:27] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 1 ms to minimize.
[2022-05-20 12:24:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 164 ms
[2022-05-20 12:24:27] [INFO ] Computed and/alt/rep : 167/278/167 causal constraints (skipped 0 transitions) in 19 ms.
[2022-05-20 12:24:28] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 0 ms to minimize.
[2022-05-20 12:24:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2022-05-20 12:24:28] [INFO ] Added : 81 causal constraints over 17 iterations in 652 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), true]
Product exploration explored 100000 steps with 1088 reset in 461 ms.
Product exploration explored 100000 steps with 1089 reset in 427 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), true]
Support contains 6 out of 162 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 162/162 places, 168/168 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 162 transition count 168
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 10 Pre rules applied. Total rules applied 20 place count 162 transition count 168
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 30 place count 162 transition count 168
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 34 place count 158 transition count 164
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 38 place count 158 transition count 164
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 53 places in 0 ms
Iterating global reduction 1 with 27 rules applied. Total rules applied 65 place count 158 transition count 164
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 80 place count 143 transition count 149
Deduced a syphon composed of 38 places in 1 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 95 place count 143 transition count 149
Deduced a syphon composed of 38 places in 1 ms
Applied a total of 95 rules in 31 ms. Remains 143 /162 variables (removed 19) and now considering 149/168 (removed 19) transitions.
[2022-05-20 12:24:29] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 149 rows 143 cols
[2022-05-20 12:24:29] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-20 12:24:30] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 143/162 places, 149/168 transitions.
Finished structural reductions, in 1 iterations. Remains : 143/162 places, 149/168 transitions.
Product exploration explored 100000 steps with 1630 reset in 324 ms.
Product exploration explored 100000 steps with 1632 reset in 580 ms.
Built C files in :
/tmp/ltsmin7889163809190941552
[2022-05-20 12:24:30] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7889163809190941552
Running compilation step : cd /tmp/ltsmin7889163809190941552;'/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 513 ms.
Running link step : cd /tmp/ltsmin7889163809190941552;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin7889163809190941552;'/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/stateBased738392581444352488.hoa' '--buchi-type=spotba'
LTSmin run took 357 ms.
FORMULA ParamProductionCell-PT-0-LTLFireability-02 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-0-LTLFireability-02 finished in 16963 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((X(p1)||F(p1))&&p0))))'
Support contains 6 out of 177 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 171/171 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 176 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 176 transition count 170
Applied a total of 2 rules in 3 ms. Remains 176 /177 variables (removed 1) and now considering 170/171 (removed 1) transitions.
// Phase 1: matrix 170 rows 176 cols
[2022-05-20 12:24:31] [INFO ] Computed 33 place invariants in 2 ms
[2022-05-20 12:24:32] [INFO ] Implicit Places using invariants in 200 ms returned [17, 22, 29, 37, 56, 57, 65, 70, 89, 90, 92, 104, 146, 148]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 201 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 162/177 places, 170/171 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 160 transition count 168
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 160 transition count 168
Applied a total of 4 rules in 3 ms. Remains 160 /162 variables (removed 2) and now considering 168/170 (removed 2) transitions.
// Phase 1: matrix 168 rows 160 cols
[2022-05-20 12:24:32] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-20 12:24:32] [INFO ] Implicit Places using invariants in 104 ms returned []
// Phase 1: matrix 168 rows 160 cols
[2022-05-20 12:24:32] [INFO ] Computed 19 place invariants in 2 ms
[2022-05-20 12:24:32] [INFO ] State equation strengthened by 59 read => feed constraints.
[2022-05-20 12:24:32] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 447 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 160/177 places, 168/171 transitions.
Finished structural reductions, in 2 iterations. Remains : 160/177 places, 168/171 transitions.
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : ParamProductionCell-PT-0-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s2 1) (EQ s159 1) (EQ s14 1) (EQ s71 1)), p1:(AND (EQ s12 1) (EQ s15 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-0-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-0-LTLFireability-03 finished in 847 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((!p0 U X(!((X(p1)||p2)&&F(p2))))))'
Support contains 6 out of 177 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 171/171 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 176 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 176 transition count 170
Applied a total of 2 rules in 6 ms. Remains 176 /177 variables (removed 1) and now considering 170/171 (removed 1) transitions.
// Phase 1: matrix 170 rows 176 cols
[2022-05-20 12:24:32] [INFO ] Computed 33 place invariants in 1 ms
[2022-05-20 12:24:33] [INFO ] Implicit Places using invariants in 311 ms returned [15, 17, 22, 29, 37, 56, 57, 89, 90, 92, 104, 146, 148]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 313 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 163/177 places, 170/171 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 161 transition count 168
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 161 transition count 168
Applied a total of 4 rules in 6 ms. Remains 161 /163 variables (removed 2) and now considering 168/170 (removed 2) transitions.
// Phase 1: matrix 168 rows 161 cols
[2022-05-20 12:24:33] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-20 12:24:33] [INFO ] Implicit Places using invariants in 164 ms returned []
// Phase 1: matrix 168 rows 161 cols
[2022-05-20 12:24:33] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-20 12:24:33] [INFO ] State equation strengthened by 59 read => feed constraints.
[2022-05-20 12:24:33] [INFO ] Implicit Places using invariants and state equation in 475 ms returned []
Implicit Place search using SMT with State Equation took 641 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 161/177 places, 168/171 transitions.
Finished structural reductions, in 2 iterations. Remains : 161/177 places, 168/171 transitions.
Stuttering acceptance computed with spot in 374 ms :[p2, p2, p2, true, (AND p2 p1), (AND p1 p2), (AND p2 p1), p2]
Running random walk in product with property : ParamProductionCell-PT-0-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(AND p0 p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p2 p1), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 7}], [{ cond=(AND p0 p2 p1), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=5 dest: 6}], [{ cond=(AND p2 p1), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=6 dest: 4}], [{ cond=p2, acceptance={} source=7 dest: 3}, { cond=(NOT p2), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(AND (EQ s86 1) (EQ s107 1)), p2:(AND (EQ s3 1) (EQ s58 1)), p1:(AND (EQ s63 1) (EQ s67 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20441 reset in 289 ms.
Product exploration explored 100000 steps with 20467 reset in 329 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 p0) (NOT p2) (NOT p1)), (X p2), (X (NOT (AND p0 p2))), (X (AND (NOT p0) p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 p2)))), true, (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p2 p1))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 15 factoid took 1299 ms. Reduced automaton from 8 states, 20 edges and 3 AP to 8 states, 20 edges and 3 AP.
Stuttering acceptance computed with spot in 390 ms :[p2, p2, p2, true, (AND p2 p1), (AND p1 p2), (AND p2 p1), p2]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 610 ms. (steps per millisecond=16 ) properties (out of 12) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 4) seen :1
Running SMT prover for 3 properties.
// Phase 1: matrix 168 rows 161 cols
[2022-05-20 12:24:37] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-20 12:24:37] [INFO ] [Real]Absence check using 19 positive place invariants in 13 ms returned sat
[2022-05-20 12:24:37] [INFO ] [Real]Absence check using 19 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-20 12:24:37] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:1
[2022-05-20 12:24:37] [INFO ] [Nat]Absence check using 19 positive place invariants in 12 ms returned sat
[2022-05-20 12:24:38] [INFO ] [Nat]Absence check using 19 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-20 12:24:38] [INFO ] After 68ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X p2), (X (NOT (AND p0 p2))), (X (AND (NOT p0) p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 p2)))), true, (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p2 p1)))), (G (NOT (AND p0 p1 p2))), (G (NOT (AND (NOT p0) p1 p2))), (G (NOT (AND p1 p2)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (AND p1 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND (NOT p0) p2)), (F (AND p0 (NOT p2))), (F p0), (F (AND p0 p2)), (F p2), (F (AND p0 p1 (NOT p2))), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 18 factoid took 1643 ms. Reduced automaton from 8 states, 20 edges and 3 AP to 8 states, 16 edges and 3 AP.
Stuttering acceptance computed with spot in 261 ms :[p2, p2, p2, true, (AND p1 p2), (AND p2 p1 p0), (AND p2 p1), p2]
Stuttering acceptance computed with spot in 253 ms :[p2, p2, p2, true, (AND p1 p2), (AND p2 p1 p0), (AND p2 p1), p2]
Support contains 6 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 168/168 transitions.
Applied a total of 0 rules in 5 ms. Remains 161 /161 variables (removed 0) and now considering 168/168 (removed 0) transitions.
// Phase 1: matrix 168 rows 161 cols
[2022-05-20 12:24:40] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-20 12:24:40] [INFO ] Implicit Places using invariants in 113 ms returned []
// Phase 1: matrix 168 rows 161 cols
[2022-05-20 12:24:40] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-20 12:24:40] [INFO ] State equation strengthened by 59 read => feed constraints.
[2022-05-20 12:24:40] [INFO ] Implicit Places using invariants and state equation in 411 ms returned []
Implicit Place search using SMT with State Equation took 526 ms to find 0 implicit places.
// Phase 1: matrix 168 rows 161 cols
[2022-05-20 12:24:40] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-20 12:24:40] [INFO ] Dead Transitions using invariants and state equation in 205 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 161/161 places, 168/168 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 p2) (NOT p1)), (X p2), (X (NOT (AND p0 p2))), (X (AND (NOT p0) p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 p2)))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 12 factoid took 902 ms. Reduced automaton from 8 states, 16 edges and 3 AP to 8 states, 16 edges and 3 AP.
Stuttering acceptance computed with spot in 306 ms :[p2, p2, p2, true, (AND p1 p2), (AND p2 p1 p0), (AND p2 p1), p2]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 9) seen :7
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :1
Finished Best-First random walk after 200 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=200 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X p2), (X (NOT (AND p0 p2))), (X (AND (NOT p0) p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 p2)))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND (NOT p0) p2)), (F p1), (F (AND p0 (NOT p2))), (F p0), (F (AND p0 p2)), (F p2), (F (AND p0 p1)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 12 factoid took 1011 ms. Reduced automaton from 8 states, 16 edges and 3 AP to 8 states, 16 edges and 3 AP.
Stuttering acceptance computed with spot in 378 ms :[p2, p2, p2, true, (AND p1 p2), (AND p2 p1 p0), (AND p2 p1), p2]
Stuttering acceptance computed with spot in 371 ms :[p2, p2, p2, true, (AND p1 p2), (AND p2 p1 p0), (AND p2 p1), p2]
Stuttering acceptance computed with spot in 371 ms :[p2, p2, p2, true, (AND p1 p2), (AND p2 p1 p0), (AND p2 p1), p2]
Product exploration explored 100000 steps with 20410 reset in 305 ms.
Product exploration explored 100000 steps with 20500 reset in 349 ms.
Applying partial POR strategy [false, false, false, true, false, false, false, true]
Stuttering acceptance computed with spot in 267 ms :[p2, p2, p2, true, (AND p1 p2), (AND p2 p1 p0), (AND p2 p1), p2]
Support contains 6 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 168/168 transitions.
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 161 transition count 168
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 10 Pre rules applied. Total rules applied 27 place count 161 transition count 168
Deduced a syphon composed of 37 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 37 place count 161 transition count 168
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 43 place count 155 transition count 162
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 49 place count 155 transition count 162
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 1 with 41 rules applied. Total rules applied 90 place count 155 transition count 162
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 113 place count 132 transition count 139
Deduced a syphon composed of 49 places in 1 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 136 place count 132 transition count 139
Deduced a syphon composed of 49 places in 1 ms
Applied a total of 136 rules in 22 ms. Remains 132 /161 variables (removed 29) and now considering 139/168 (removed 29) transitions.
[2022-05-20 12:24:45] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 139 rows 132 cols
[2022-05-20 12:24:45] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-20 12:24:45] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 132/161 places, 139/168 transitions.
Finished structural reductions, in 1 iterations. Remains : 132/161 places, 139/168 transitions.
Product exploration explored 100000 steps with 20464 reset in 234 ms.
Product exploration explored 100000 steps with 20478 reset in 340 ms.
Built C files in :
/tmp/ltsmin15952662090498168500
[2022-05-20 12:24:46] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15952662090498168500
Running compilation step : cd /tmp/ltsmin15952662090498168500;'/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 546 ms.
Running link step : cd /tmp/ltsmin15952662090498168500;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin15952662090498168500;'/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/stateBased10317728793757254274.hoa' '--buchi-type=spotba'
LTSmin run took 250 ms.
FORMULA ParamProductionCell-PT-0-LTLFireability-04 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-0-LTLFireability-04 finished in 14535 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p1)&&p0)))'
Support contains 4 out of 177 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 177/177 places, 171/171 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 177 transition count 156
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 162 transition count 156
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 30 place count 162 transition count 145
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 52 place count 151 transition count 145
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 150 transition count 144
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 150 transition count 144
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 98 place count 127 transition count 123
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 98 place count 127 transition count 122
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 101 place count 125 transition count 122
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 103 place count 124 transition count 121
Applied a total of 103 rules in 17 ms. Remains 124 /177 variables (removed 53) and now considering 121/171 (removed 50) transitions.
// Phase 1: matrix 121 rows 124 cols
[2022-05-20 12:24:47] [INFO ] Computed 30 place invariants in 1 ms
[2022-05-20 12:24:47] [INFO ] Implicit Places using invariants in 182 ms returned [0, 9, 10, 14, 19, 24, 36, 37, 43, 46, 56, 57, 59, 71, 102]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 183 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/177 places, 121/171 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 109 transition count 119
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 107 transition count 119
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 107 transition count 117
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 105 transition count 117
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 10 place count 103 transition count 115
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 103 transition count 115
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 66 place count 76 transition count 88
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 75 transition count 87
Applied a total of 68 rules in 11 ms. Remains 75 /109 variables (removed 34) and now considering 87/121 (removed 34) transitions.
// Phase 1: matrix 87 rows 75 cols
[2022-05-20 12:24:47] [INFO ] Computed 15 place invariants in 0 ms
[2022-05-20 12:24:47] [INFO ] Implicit Places using invariants in 90 ms returned []
// Phase 1: matrix 87 rows 75 cols
[2022-05-20 12:24:47] [INFO ] Computed 15 place invariants in 0 ms
[2022-05-20 12:24:47] [INFO ] State equation strengthened by 58 read => feed constraints.
[2022-05-20 12:24:47] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 75/177 places, 87/171 transitions.
Finished structural reductions, in 2 iterations. Remains : 75/177 places, 87/171 transitions.
Stuttering acceptance computed with spot in 67 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ParamProductionCell-PT-0-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s57 1) (EQ s59 1)), p1:(AND (EQ s31 1) (EQ s64 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 120 ms.
Stack based approach found an accepted trace after 108 steps with 0 reset with depth 109 and stack size 109 in 0 ms.
FORMULA ParamProductionCell-PT-0-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-0-LTLFireability-05 finished in 655 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U F(G(!F(p1))))&&G((F(p1) U !p0))))'
Support contains 5 out of 177 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 177/177 places, 171/171 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 177 transition count 158
Reduce places removed 13 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 15 rules applied. Total rules applied 28 place count 164 transition count 156
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 30 place count 162 transition count 156
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 30 place count 162 transition count 144
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 54 place count 150 transition count 144
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 55 place count 149 transition count 143
Iterating global reduction 3 with 1 rules applied. Total rules applied 56 place count 149 transition count 143
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 100 place count 126 transition count 122
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 100 place count 126 transition count 121
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 103 place count 124 transition count 121
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 105 place count 123 transition count 120
Applied a total of 105 rules in 16 ms. Remains 123 /177 variables (removed 54) and now considering 120/171 (removed 51) transitions.
// Phase 1: matrix 120 rows 123 cols
[2022-05-20 12:24:47] [INFO ] Computed 30 place invariants in 1 ms
[2022-05-20 12:24:48] [INFO ] Implicit Places using invariants in 183 ms returned [0, 9, 10, 14, 19, 24, 36, 37, 43, 46, 58, 60, 102, 104]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 184 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/177 places, 120/171 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 109 transition count 117
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 106 transition count 117
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 106 transition count 116
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 8 place count 105 transition count 116
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 62 place count 78 transition count 89
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 64 place count 77 transition count 88
Applied a total of 64 rules in 9 ms. Remains 77 /109 variables (removed 32) and now considering 88/120 (removed 32) transitions.
// Phase 1: matrix 88 rows 77 cols
[2022-05-20 12:24:48] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-20 12:24:48] [INFO ] Implicit Places using invariants in 94 ms returned []
// Phase 1: matrix 88 rows 77 cols
[2022-05-20 12:24:48] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-20 12:24:48] [INFO ] State equation strengthened by 58 read => feed constraints.
[2022-05-20 12:24:48] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 77/177 places, 88/171 transitions.
Finished structural reductions, in 2 iterations. Remains : 77/177 places, 88/171 transitions.
Stuttering acceptance computed with spot in 129 ms :[(OR p1 p0), p1, (NOT p1), p0]
Running random walk in product with property : ParamProductionCell-PT-0-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s44 1) (EQ s54 1)), p0:(AND (EQ s33 1) (EQ s37 1) (EQ s72 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 112 ms.
Stack based approach found an accepted trace after 155 steps with 0 reset with depth 156 and stack size 156 in 1 ms.
FORMULA ParamProductionCell-PT-0-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-0-LTLFireability-06 finished in 716 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U X(X(p1))))))'
Support contains 4 out of 177 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 171/171 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 176 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 176 transition count 170
Applied a total of 2 rules in 3 ms. Remains 176 /177 variables (removed 1) and now considering 170/171 (removed 1) transitions.
// Phase 1: matrix 170 rows 176 cols
[2022-05-20 12:24:48] [INFO ] Computed 33 place invariants in 1 ms
[2022-05-20 12:24:48] [INFO ] Implicit Places using invariants in 192 ms returned [15, 17, 22, 29, 37, 56, 65, 70, 89, 90, 92, 104, 148]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 193 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 163/177 places, 170/171 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 161 transition count 168
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 161 transition count 168
Applied a total of 4 rules in 3 ms. Remains 161 /163 variables (removed 2) and now considering 168/170 (removed 2) transitions.
// Phase 1: matrix 168 rows 161 cols
[2022-05-20 12:24:48] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-20 12:24:48] [INFO ] Implicit Places using invariants in 106 ms returned []
// Phase 1: matrix 168 rows 161 cols
[2022-05-20 12:24:48] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-20 12:24:49] [INFO ] State equation strengthened by 59 read => feed constraints.
[2022-05-20 12:24:49] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 161/177 places, 168/171 transitions.
Finished structural reductions, in 2 iterations. Remains : 161/177 places, 168/171 transitions.
Stuttering acceptance computed with spot in 208 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : ParamProductionCell-PT-0-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}, { cond=p0, acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}, { cond=p0, acceptance={0} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 3}, { cond=p0, acceptance={0} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s133 1) (EQ s152 1)), p1:(AND (EQ s51 1) (EQ s52 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]]
Product exploration explored 100000 steps with 400 reset in 147 ms.
Stack based approach found an accepted trace after 1055 steps with 4 reset with depth 233 and stack size 233 in 2 ms.
FORMULA ParamProductionCell-PT-0-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-0-LTLFireability-07 finished in 988 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||X((G(p2)&&p1))))'
Support contains 8 out of 177 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 171/171 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 176 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 176 transition count 170
Applied a total of 2 rules in 3 ms. Remains 176 /177 variables (removed 1) and now considering 170/171 (removed 1) transitions.
// Phase 1: matrix 170 rows 176 cols
[2022-05-20 12:24:49] [INFO ] Computed 33 place invariants in 1 ms
[2022-05-20 12:24:49] [INFO ] Implicit Places using invariants in 213 ms returned [15, 22, 29, 37, 56, 57, 65, 70, 89, 90, 92, 104, 146]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 214 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 163/177 places, 170/171 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 161 transition count 168
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 161 transition count 168
Applied a total of 4 rules in 3 ms. Remains 161 /163 variables (removed 2) and now considering 168/170 (removed 2) transitions.
// Phase 1: matrix 168 rows 161 cols
[2022-05-20 12:24:49] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-20 12:24:49] [INFO ] Implicit Places using invariants in 105 ms returned []
// Phase 1: matrix 168 rows 161 cols
[2022-05-20 12:24:49] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-20 12:24:50] [INFO ] State equation strengthened by 59 read => feed constraints.
[2022-05-20 12:24:50] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 161/177 places, 168/171 transitions.
Finished structural reductions, in 2 iterations. Remains : 161/177 places, 168/171 transitions.
Stuttering acceptance computed with spot in 119 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : ParamProductionCell-PT-0-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 2}]], initial=1, aps=[p2:(AND (EQ s16 1) (EQ s19 1)), p0:(OR (AND (EQ s91 1) (EQ s97 1)) (EQ s80 0) (EQ s142 0)), p1:(AND (EQ s134 1) (EQ s138 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]]
Product exploration explored 100000 steps with 50000 reset in 235 ms.
Product exploration explored 100000 steps with 50000 reset in 251 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) p0 (NOT p1)), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (NOT (AND (NOT p0) p1 p2))), true, (X (X (NOT p2)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p1 p2)))
Knowledge based reduction with 5 factoid took 94 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA ParamProductionCell-PT-0-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ParamProductionCell-PT-0-LTLFireability-10 finished in 1303 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 177 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 171/171 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 176 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 176 transition count 170
Applied a total of 2 rules in 3 ms. Remains 176 /177 variables (removed 1) and now considering 170/171 (removed 1) transitions.
// Phase 1: matrix 170 rows 176 cols
[2022-05-20 12:24:50] [INFO ] Computed 33 place invariants in 1 ms
[2022-05-20 12:24:51] [INFO ] Implicit Places using invariants in 194 ms returned [15, 17, 22, 37, 56, 57, 65, 70, 89, 90, 92, 104, 146, 148]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 195 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 162/177 places, 170/171 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 160 transition count 168
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 160 transition count 168
Applied a total of 4 rules in 3 ms. Remains 160 /162 variables (removed 2) and now considering 168/170 (removed 2) transitions.
// Phase 1: matrix 168 rows 160 cols
[2022-05-20 12:24:51] [INFO ] Computed 19 place invariants in 0 ms
[2022-05-20 12:24:51] [INFO ] Implicit Places using invariants in 84 ms returned []
// Phase 1: matrix 168 rows 160 cols
[2022-05-20 12:24:51] [INFO ] Computed 19 place invariants in 0 ms
[2022-05-20 12:24:51] [INFO ] State equation strengthened by 59 read => feed constraints.
[2022-05-20 12:24:51] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 160/177 places, 168/171 transitions.
Finished structural reductions, in 2 iterations. Remains : 160/177 places, 168/171 transitions.
Stuttering acceptance computed with spot in 184 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-0-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (NEQ s17 1) (NEQ s26 1) (NEQ s29 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 127 steps with 0 reset in 1 ms.
FORMULA ParamProductionCell-PT-0-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-0-LTLFireability-11 finished in 778 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p1)&&p0)))'
Support contains 2 out of 177 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 177/177 places, 171/171 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 177 transition count 156
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 162 transition count 156
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 30 place count 162 transition count 144
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 54 place count 150 transition count 144
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 149 transition count 143
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 149 transition count 143
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 104 place count 124 transition count 120
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 104 place count 124 transition count 119
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 107 place count 122 transition count 119
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 109 place count 121 transition count 118
Applied a total of 109 rules in 15 ms. Remains 121 /177 variables (removed 56) and now considering 118/171 (removed 53) transitions.
// Phase 1: matrix 118 rows 121 cols
[2022-05-20 12:24:51] [INFO ] Computed 30 place invariants in 1 ms
[2022-05-20 12:24:51] [INFO ] Implicit Places using invariants in 201 ms returned [0, 9, 10, 14, 19, 24, 37, 43, 46, 56, 57, 59, 71, 100, 102]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 202 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 106/177 places, 118/171 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 106 transition count 116
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 104 transition count 116
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 104 transition count 115
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 103 transition count 115
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 8 place count 101 transition count 113
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 101 transition count 113
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 70 place count 71 transition count 83
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 72 place count 70 transition count 82
Applied a total of 72 rules in 11 ms. Remains 70 /106 variables (removed 36) and now considering 82/118 (removed 36) transitions.
// Phase 1: matrix 82 rows 70 cols
[2022-05-20 12:24:51] [INFO ] Computed 15 place invariants in 1 ms
[2022-05-20 12:24:52] [INFO ] Implicit Places using invariants in 82 ms returned []
// Phase 1: matrix 82 rows 70 cols
[2022-05-20 12:24:52] [INFO ] Computed 15 place invariants in 0 ms
[2022-05-20 12:24:52] [INFO ] State equation strengthened by 58 read => feed constraints.
[2022-05-20 12:24:52] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 70/177 places, 82/171 transitions.
Finished structural reductions, in 2 iterations. Remains : 70/177 places, 82/171 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ParamProductionCell-PT-0-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(AND (EQ s22 1) (EQ s24 1)), p0:(AND (EQ s22 1) (EQ s24 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1217 reset in 113 ms.
Product exploration explored 100000 steps with 1223 reset in 131 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 248 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 82 rows 70 cols
[2022-05-20 12:24:52] [INFO ] Computed 15 place invariants in 0 ms
[2022-05-20 12:24:52] [INFO ] After 22ms 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 p1) (NOT p0)), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 8 factoid took 317 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
// Phase 1: matrix 82 rows 70 cols
[2022-05-20 12:24:53] [INFO ] Computed 15 place invariants in 1 ms
[2022-05-20 12:24:53] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned sat
[2022-05-20 12:24:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 12:24:53] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2022-05-20 12:24:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 12:24:53] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2022-05-20 12:24:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 12:24:53] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2022-05-20 12:24:53] [INFO ] State equation strengthened by 58 read => feed constraints.
[2022-05-20 12:24:53] [INFO ] [Nat]Added 58 Read/Feed constraints in 16 ms returned sat
[2022-05-20 12:24:53] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
[2022-05-20 12:24:53] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2022-05-20 12:24:53] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 1 ms to minimize.
[2022-05-20 12:24:53] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2022-05-20 12:24:53] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2022-05-20 12:24:53] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 0 ms to minimize.
[2022-05-20 12:24:53] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2022-05-20 12:24:53] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2022-05-20 12:24:54] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 0 ms to minimize.
[2022-05-20 12:24:54] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2022-05-20 12:24:54] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2022-05-20 12:24:54] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 0 ms to minimize.
[2022-05-20 12:24:54] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2022-05-20 12:24:54] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2022-05-20 12:24:54] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2022-05-20 12:24:54] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 724 ms
[2022-05-20 12:24:54] [INFO ] Computed and/alt/rep : 81/205/81 causal constraints (skipped 0 transitions) in 9 ms.
[2022-05-20 12:24:54] [INFO ] Added : 75 causal constraints over 16 iterations in 268 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 70 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 70/70 places, 82/82 transitions.
Applied a total of 0 rules in 4 ms. Remains 70 /70 variables (removed 0) and now considering 82/82 (removed 0) transitions.
// Phase 1: matrix 82 rows 70 cols
[2022-05-20 12:24:54] [INFO ] Computed 15 place invariants in 1 ms
[2022-05-20 12:24:54] [INFO ] Implicit Places using invariants in 138 ms returned []
// Phase 1: matrix 82 rows 70 cols
[2022-05-20 12:24:54] [INFO ] Computed 15 place invariants in 2 ms
[2022-05-20 12:24:54] [INFO ] State equation strengthened by 58 read => feed constraints.
[2022-05-20 12:24:54] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
[2022-05-20 12:24:55] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 82 rows 70 cols
[2022-05-20 12:24:55] [INFO ] Computed 15 place invariants in 1 ms
[2022-05-20 12:24:55] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 70/70 places, 82/82 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 144 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 47 ms :[(NOT p0)]
Finished random walk after 83 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=83 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 167 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 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
// Phase 1: matrix 82 rows 70 cols
[2022-05-20 12:24:55] [INFO ] Computed 15 place invariants in 1 ms
[2022-05-20 12:24:55] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned sat
[2022-05-20 12:24:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 12:24:55] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2022-05-20 12:24:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 12:24:55] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2022-05-20 12:24:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 12:24:55] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2022-05-20 12:24:55] [INFO ] State equation strengthened by 58 read => feed constraints.
[2022-05-20 12:24:55] [INFO ] [Nat]Added 58 Read/Feed constraints in 15 ms returned sat
[2022-05-20 12:24:56] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 0 ms to minimize.
[2022-05-20 12:24:56] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2022-05-20 12:24:56] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 1 ms to minimize.
[2022-05-20 12:24:56] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2022-05-20 12:24:56] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2022-05-20 12:24:56] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2022-05-20 12:24:56] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2022-05-20 12:24:56] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
[2022-05-20 12:24:56] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 0 ms to minimize.
[2022-05-20 12:24:56] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2022-05-20 12:24:56] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2022-05-20 12:24:56] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2022-05-20 12:24:56] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2022-05-20 12:24:56] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2022-05-20 12:24:56] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 2 ms to minimize.
[2022-05-20 12:24:56] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 820 ms
[2022-05-20 12:24:56] [INFO ] Computed and/alt/rep : 81/205/81 causal constraints (skipped 0 transitions) in 10 ms.
[2022-05-20 12:24:57] [INFO ] Added : 75 causal constraints over 16 iterations in 204 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1215 reset in 111 ms.
Product exploration explored 100000 steps with 1229 reset in 128 ms.
Built C files in :
/tmp/ltsmin6050418513087086898
[2022-05-20 12:24:57] [INFO ] Computing symmetric may disable matrix : 82 transitions.
[2022-05-20 12:24:57] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:24:57] [INFO ] Computing symmetric may enable matrix : 82 transitions.
[2022-05-20 12:24:57] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:24:57] [INFO ] Computing Do-Not-Accords matrix : 82 transitions.
[2022-05-20 12:24:57] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:24:57] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6050418513087086898
Running compilation step : cd /tmp/ltsmin6050418513087086898;'/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 243 ms.
Running link step : cd /tmp/ltsmin6050418513087086898;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin6050418513087086898;'/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/stateBased17732365128028185354.hoa' '--buchi-type=spotba'
LTSmin run took 229 ms.
FORMULA ParamProductionCell-PT-0-LTLFireability-12 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-0-LTLFireability-12 finished in 6093 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 177 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 177/177 places, 171/171 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 177 transition count 156
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 162 transition count 156
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 30 place count 162 transition count 144
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 54 place count 150 transition count 144
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 102 place count 125 transition count 121
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 102 place count 125 transition count 120
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 105 place count 123 transition count 120
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 107 place count 122 transition count 119
Applied a total of 107 rules in 17 ms. Remains 122 /177 variables (removed 55) and now considering 119/171 (removed 52) transitions.
// Phase 1: matrix 119 rows 122 cols
[2022-05-20 12:24:57] [INFO ] Computed 30 place invariants in 1 ms
[2022-05-20 12:24:57] [INFO ] Implicit Places using invariants in 131 ms returned [0, 9, 10, 14, 19, 24, 36, 37, 43, 46, 56, 57, 71, 101, 103]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 134 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 107/177 places, 119/171 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 107 transition count 117
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 105 transition count 116
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 104 transition count 116
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 54 place count 80 transition count 92
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 56 place count 79 transition count 91
Applied a total of 56 rules in 10 ms. Remains 79 /107 variables (removed 28) and now considering 91/119 (removed 28) transitions.
// Phase 1: matrix 91 rows 79 cols
[2022-05-20 12:24:57] [INFO ] Computed 15 place invariants in 0 ms
[2022-05-20 12:24:58] [INFO ] Implicit Places using invariants in 69 ms returned []
// Phase 1: matrix 91 rows 79 cols
[2022-05-20 12:24:58] [INFO ] Computed 15 place invariants in 0 ms
[2022-05-20 12:24:58] [INFO ] State equation strengthened by 58 read => feed constraints.
[2022-05-20 12:24:58] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 79/177 places, 91/171 transitions.
Finished structural reductions, in 2 iterations. Remains : 79/177 places, 91/171 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-0-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s32 1) (EQ s51 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 126 reset in 112 ms.
Stack based approach found an accepted trace after 93 steps with 0 reset with depth 94 and stack size 94 in 0 ms.
FORMULA ParamProductionCell-PT-0-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-0-LTLFireability-13 finished in 591 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(G(p0))||F(X(p1)))))'
Support contains 4 out of 177 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 171/171 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 176 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 176 transition count 170
Applied a total of 2 rules in 7 ms. Remains 176 /177 variables (removed 1) and now considering 170/171 (removed 1) transitions.
// Phase 1: matrix 170 rows 176 cols
[2022-05-20 12:24:58] [INFO ] Computed 33 place invariants in 1 ms
[2022-05-20 12:24:58] [INFO ] Implicit Places using invariants in 220 ms returned [17, 22, 29, 37, 56, 57, 65, 70, 89, 90, 92, 104, 146, 148]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 221 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 162/177 places, 170/171 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 160 transition count 168
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 160 transition count 168
Applied a total of 4 rules in 3 ms. Remains 160 /162 variables (removed 2) and now considering 168/170 (removed 2) transitions.
// Phase 1: matrix 168 rows 160 cols
[2022-05-20 12:24:58] [INFO ] Computed 19 place invariants in 0 ms
[2022-05-20 12:24:58] [INFO ] Implicit Places using invariants in 109 ms returned []
// Phase 1: matrix 168 rows 160 cols
[2022-05-20 12:24:58] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-20 12:24:58] [INFO ] State equation strengthened by 59 read => feed constraints.
[2022-05-20 12:24:59] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 426 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 160/177 places, 168/171 transitions.
Finished structural reductions, in 2 iterations. Remains : 160/177 places, 168/171 transitions.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ParamProductionCell-PT-0-LTLFireability-14 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}]], initial=1, aps=[p0:(OR (EQ s13 0) (EQ s70 0)), p1:(AND (EQ s12 1) (EQ s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 712 reset in 172 ms.
Product exploration explored 100000 steps with 719 reset in 155 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 (NOT (AND (NOT p0) (NOT p1)))), (X (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 5 factoid took 167 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 101 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=50 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (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 5 factoid took 220 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 168/168 transitions.
Applied a total of 0 rules in 2 ms. Remains 160 /160 variables (removed 0) and now considering 168/168 (removed 0) transitions.
// Phase 1: matrix 168 rows 160 cols
[2022-05-20 12:25:00] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-20 12:25:00] [INFO ] Implicit Places using invariants in 156 ms returned []
// Phase 1: matrix 168 rows 160 cols
[2022-05-20 12:25:00] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-20 12:25:00] [INFO ] State equation strengthened by 59 read => feed constraints.
[2022-05-20 12:25:00] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 561 ms to find 0 implicit places.
// Phase 1: matrix 168 rows 160 cols
[2022-05-20 12:25:00] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-20 12:25:00] [INFO ] Dead Transitions using invariants and state equation in 219 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 160/160 places, 168/168 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 (NOT (AND (NOT p0) (NOT p1)))), (X (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 5 factoid took 224 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 105 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=35 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (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 5 factoid took 281 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 719 reset in 213 ms.
Product exploration explored 100000 steps with 717 reset in 242 ms.
Applying partial POR strategy [true, false]
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 160/160 places, 168/168 transitions.
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 160 transition count 168
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 27 place count 160 transition count 168
Deduced a syphon composed of 38 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 38 place count 160 transition count 168
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 43 place count 155 transition count 163
Deduced a syphon composed of 33 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 48 place count 155 transition count 163
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 75 places in 0 ms
Iterating global reduction 1 with 42 rules applied. Total rules applied 90 place count 155 transition count 163
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 113 place count 132 transition count 140
Deduced a syphon composed of 52 places in 0 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 136 place count 132 transition count 140
Deduced a syphon composed of 52 places in 0 ms
Applied a total of 136 rules in 16 ms. Remains 132 /160 variables (removed 28) and now considering 140/168 (removed 28) transitions.
[2022-05-20 12:25:02] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 140 rows 132 cols
[2022-05-20 12:25:02] [INFO ] Computed 19 place invariants in 0 ms
[2022-05-20 12:25:02] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 132/160 places, 140/168 transitions.
Finished structural reductions, in 1 iterations. Remains : 132/160 places, 140/168 transitions.
Product exploration explored 100000 steps with 1474 reset in 173 ms.
Product exploration explored 100000 steps with 1457 reset in 197 ms.
Built C files in :
/tmp/ltsmin15295452828527195964
[2022-05-20 12:25:03] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15295452828527195964
Running compilation step : cd /tmp/ltsmin15295452828527195964;'/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 363 ms.
Running link step : cd /tmp/ltsmin15295452828527195964;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin15295452828527195964;'/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/stateBased9119238665988029412.hoa' '--buchi-type=spotba'
LTSmin run took 676 ms.
FORMULA ParamProductionCell-PT-0-LTLFireability-14 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-0-LTLFireability-14 finished in 5672 ms.
All properties solved by simple procedures.
Total runtime 112972 ms.

BK_STOP 1653049504261

--------------------
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-0"
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-0, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r150-smll-165276998600252"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ParamProductionCell-PT-0.tgz
mv ParamProductionCell-PT-0 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;