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.r168-tall-165277017300892.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 ProductionCell-PT-none, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277017300892
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 308K
-rw-r--r-- 1 mcc users 8.0K Apr 29 13:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 29 13:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 29 13:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 29 13:08 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 3.6K May 9 08:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 43K 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 ProductionCell-PT-none-LTLFireability-00
FORMULA_NAME ProductionCell-PT-none-LTLFireability-01
FORMULA_NAME ProductionCell-PT-none-LTLFireability-02
FORMULA_NAME ProductionCell-PT-none-LTLFireability-03
FORMULA_NAME ProductionCell-PT-none-LTLFireability-04
FORMULA_NAME ProductionCell-PT-none-LTLFireability-05
FORMULA_NAME ProductionCell-PT-none-LTLFireability-06
FORMULA_NAME ProductionCell-PT-none-LTLFireability-07
FORMULA_NAME ProductionCell-PT-none-LTLFireability-08
FORMULA_NAME ProductionCell-PT-none-LTLFireability-09
FORMULA_NAME ProductionCell-PT-none-LTLFireability-10
FORMULA_NAME ProductionCell-PT-none-LTLFireability-11
FORMULA_NAME ProductionCell-PT-none-LTLFireability-12
FORMULA_NAME ProductionCell-PT-none-LTLFireability-13
FORMULA_NAME ProductionCell-PT-none-LTLFireability-14
FORMULA_NAME ProductionCell-PT-none-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652980870737

Running Version 202205111006
[2022-05-19 17:21: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-19 17:21:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 17:21:12] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2022-05-19 17:21:12] [INFO ] Transformed 176 places.
[2022-05-19 17:21:12] [INFO ] Transformed 134 transitions.
[2022-05-19 17:21:12] [INFO ] Found NUPN structural information;
[2022-05-19 17:21:12] [INFO ] Parsed PT model containing 176 places and 134 transitions in 179 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ProductionCell-PT-none-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ProductionCell-PT-none-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ProductionCell-PT-none-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ProductionCell-PT-none-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 134/134 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 174 transition count 132
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 174 transition count 132
Applied a total of 4 rules in 42 ms. Remains 174 /176 variables (removed 2) and now considering 132/134 (removed 2) transitions.
// Phase 1: matrix 132 rows 174 cols
[2022-05-19 17:21:12] [INFO ] Computed 50 place invariants in 12 ms
[2022-05-19 17:21:12] [INFO ] Implicit Places using invariants in 203 ms returned [36, 42, 58, 128]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 230 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/176 places, 132/134 transitions.
Applied a total of 0 rules in 6 ms. Remains 170 /170 variables (removed 0) and now considering 132/132 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 170/176 places, 132/134 transitions.
Support contains 50 out of 170 places after structural reductions.
[2022-05-19 17:21:12] [INFO ] Flatten gal took : 40 ms
[2022-05-19 17:21:12] [INFO ] Flatten gal took : 16 ms
[2022-05-19 17:21:12] [INFO ] Input system was already deterministic with 132 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 391 ms. (steps per millisecond=25 ) properties (out of 33) seen :30
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 132 rows 170 cols
[2022-05-19 17:21:13] [INFO ] Computed 46 place invariants in 13 ms
[2022-05-19 17:21:13] [INFO ] [Real]Absence check using 31 positive place invariants in 5 ms returned sat
[2022-05-19 17:21:13] [INFO ] [Real]Absence check using 31 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-19 17:21:13] [INFO ] After 151ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:1
[2022-05-19 17:21:13] [INFO ] [Nat]Absence check using 31 positive place invariants in 6 ms returned sat
[2022-05-19 17:21:13] [INFO ] [Nat]Absence check using 31 positive and 15 generalized place invariants in 5 ms returned sat
[2022-05-19 17:21:13] [INFO ] After 66ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2022-05-19 17:21:13] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 3 ms to minimize.
[2022-05-19 17:21:13] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 1 ms to minimize.
[2022-05-19 17:21:13] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2022-05-19 17:21:13] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2022-05-19 17:21:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 236 ms
[2022-05-19 17:21:13] [INFO ] After 313ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :0
[2022-05-19 17:21:13] [INFO ] After 375ms 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.
Successfully simplified 3 atomic propositions for a total of 12 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA ProductionCell-PT-none-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 25 stabilizing places and 30 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((!((F(p0)||G(p1)) U p2)||p0)))'
Support contains 6 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 132/132 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 169 transition count 131
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 169 transition count 131
Applied a total of 2 rules in 16 ms. Remains 169 /170 variables (removed 1) and now considering 131/132 (removed 1) transitions.
// Phase 1: matrix 131 rows 169 cols
[2022-05-19 17:21:14] [INFO ] Computed 46 place invariants in 5 ms
[2022-05-19 17:21:14] [INFO ] Implicit Places using invariants in 97 ms returned [130, 134]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 98 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 167/170 places, 131/132 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 166 transition count 129
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 166 transition count 129
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 165 transition count 128
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 165 transition count 128
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 164 transition count 127
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 164 transition count 127
Applied a total of 6 rules in 13 ms. Remains 164 /167 variables (removed 3) and now considering 127/131 (removed 4) transitions.
// Phase 1: matrix 127 rows 164 cols
[2022-05-19 17:21:14] [INFO ] Computed 44 place invariants in 2 ms
[2022-05-19 17:21:14] [INFO ] Implicit Places using invariants in 85 ms returned []
// Phase 1: matrix 127 rows 164 cols
[2022-05-19 17:21:14] [INFO ] Computed 44 place invariants in 2 ms
[2022-05-19 17:21:14] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 164/170 places, 127/132 transitions.
Finished structural reductions, in 2 iterations. Remains : 164/170 places, 127/132 transitions.
Stuttering acceptance computed with spot in 543 ms :[true, (OR p1 p0), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND p0 p2), (OR (AND p1 p2) (AND p0 p2)), p0, p2]
Running random walk in product with property : ProductionCell-PT-none-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 6}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(AND p0 p2), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 7}], [{ cond=(AND p0 p2), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=5 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 7}], [{ cond=p0, acceptance={} source=6 dest: 0}, { cond=(NOT p0), acceptance={} source=6 dest: 6}], [{ cond=p2, acceptance={} source=7 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=7 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=7 dest: 7}]], initial=2, aps=[p0:(EQ s40 1), p1:(AND (EQ s10 1) (EQ s13 1) (EQ s59 1)), p2:(AND (EQ s79 1) (EQ s129 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 951 steps with 0 reset in 15 ms.
FORMULA ProductionCell-PT-none-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ProductionCell-PT-none-LTLFireability-02 finished in 950 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(false U p0)&&X((F(p1)&&p2))))'
Support contains 7 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 132/132 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 169 transition count 131
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 169 transition count 131
Applied a total of 2 rules in 5 ms. Remains 169 /170 variables (removed 1) and now considering 131/132 (removed 1) transitions.
// Phase 1: matrix 131 rows 169 cols
[2022-05-19 17:21:15] [INFO ] Computed 46 place invariants in 3 ms
[2022-05-19 17:21:15] [INFO ] Implicit Places using invariants in 79 ms returned [59, 129, 130, 134]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 81 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 165/170 places, 131/132 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 164 transition count 129
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 164 transition count 129
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 163 transition count 128
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 163 transition count 128
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 162 transition count 127
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 162 transition count 127
Applied a total of 6 rules in 9 ms. Remains 162 /165 variables (removed 3) and now considering 127/131 (removed 4) transitions.
// Phase 1: matrix 127 rows 162 cols
[2022-05-19 17:21:15] [INFO ] Computed 42 place invariants in 2 ms
[2022-05-19 17:21:15] [INFO ] Implicit Places using invariants in 76 ms returned []
// Phase 1: matrix 127 rows 162 cols
[2022-05-19 17:21:15] [INFO ] Computed 42 place invariants in 6 ms
[2022-05-19 17:21:15] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 162/170 places, 127/132 transitions.
Finished structural reductions, in 2 iterations. Remains : 162/170 places, 127/132 transitions.
Stuttering acceptance computed with spot in 141 ms :[(NOT p1), (OR (NOT p2) (NOT p1)), true, (OR (NOT p2) (NOT p1) p0)]
Running random walk in product with property : ProductionCell-PT-none-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(OR (EQ s7 0) (EQ s62 0) (EQ s97 0) (EQ s107 0)), p2:(EQ s127 0), p0:(AND (EQ s12 1) (EQ s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 362 ms.
Product exploration explored 100000 steps with 50000 reset in 277 ms.
Computed a total of 21 stabilizing places and 25 stable transitions
Computed a total of 21 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (NOT (AND p2 (NOT p1)))), (X p2), true, (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p2)
Knowledge based reduction with 5 factoid took 90 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA ProductionCell-PT-none-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ProductionCell-PT-none-LTLFireability-03 finished in 1183 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X((G(p0)||p1)))||F(G((F(p2)||p3)))))'
Support contains 7 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 132/132 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 169 transition count 131
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 169 transition count 131
Applied a total of 2 rules in 8 ms. Remains 169 /170 variables (removed 1) and now considering 131/132 (removed 1) transitions.
// Phase 1: matrix 131 rows 169 cols
[2022-05-19 17:21:16] [INFO ] Computed 46 place invariants in 2 ms
[2022-05-19 17:21:16] [INFO ] Implicit Places using invariants in 74 ms returned [59, 129, 134]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 77 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 166/170 places, 131/132 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 165 transition count 129
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 165 transition count 129
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 164 transition count 128
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 164 transition count 128
Applied a total of 4 rules in 5 ms. Remains 164 /166 variables (removed 2) and now considering 128/131 (removed 3) transitions.
// Phase 1: matrix 128 rows 164 cols
[2022-05-19 17:21:16] [INFO ] Computed 43 place invariants in 4 ms
[2022-05-19 17:21:16] [INFO ] Implicit Places using invariants in 68 ms returned []
// Phase 1: matrix 128 rows 164 cols
[2022-05-19 17:21:16] [INFO ] Computed 43 place invariants in 2 ms
[2022-05-19 17:21:16] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 164/170 places, 128/132 transitions.
Finished structural reductions, in 2 iterations. Remains : 164/170 places, 128/132 transitions.
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2))]
Running random walk in product with property : ProductionCell-PT-none-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND p3 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}]], initial=4, aps=[p1:(EQ s125 1), p0:(OR (EQ s81 0) (EQ s101 0) (EQ s116 0) (EQ s128 0)), p3:(AND (EQ s60 1) (EQ s73 1)), p2:(AND (EQ s81 1) (EQ s101 1) (EQ s116 1) (EQ s12...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 130 reset in 174 ms.
Stack based approach found an accepted trace after 542 steps with 0 reset with depth 543 and stack size 510 in 4 ms.
FORMULA ProductionCell-PT-none-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ProductionCell-PT-none-LTLFireability-04 finished in 681 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G((F(p0)&&p1)))||F(p2)))'
Support contains 4 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 132/132 transitions.
Reduce places removed 1 places and 1 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 169 transition count 129
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 167 transition count 129
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 4 place count 167 transition count 101
Deduced a syphon composed of 28 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 57 rules applied. Total rules applied 61 place count 138 transition count 101
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 61 place count 138 transition count 100
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 63 place count 137 transition count 100
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 64 place count 136 transition count 99
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 136 transition count 99
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 79 place count 129 transition count 92
Applied a total of 79 rules in 30 ms. Remains 129 /170 variables (removed 41) and now considering 92/132 (removed 40) transitions.
// Phase 1: matrix 92 rows 129 cols
[2022-05-19 17:21:16] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-19 17:21:17] [INFO ] Implicit Places using invariants in 87 ms returned [20, 21, 71, 72, 73, 74, 92, 93, 96]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 88 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 120/170 places, 92/132 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 119 transition count 90
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 119 transition count 90
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 118 transition count 89
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 118 transition count 89
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 116 transition count 87
Applied a total of 8 rules in 9 ms. Remains 116 /120 variables (removed 4) and now considering 87/92 (removed 5) transitions.
// Phase 1: matrix 87 rows 116 cols
[2022-05-19 17:21:17] [INFO ] Computed 36 place invariants in 0 ms
[2022-05-19 17:21:17] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 87 rows 116 cols
[2022-05-19 17:21:17] [INFO ] Computed 36 place invariants in 7 ms
[2022-05-19 17:21:17] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 116/170 places, 87/132 transitions.
Finished structural reductions, in 2 iterations. Remains : 116/170 places, 87/132 transitions.
Stuttering acceptance computed with spot in 65 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : ProductionCell-PT-none-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s55 0), p2:(EQ s3 1), p0:(AND (OR (EQ s11 0) (EQ s16 0)) (EQ s55 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 187 reset in 228 ms.
Product exploration explored 100000 steps with 184 reset in 327 ms.
Computed a total of 14 stabilizing places and 18 stable transitions
Computed a total of 14 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 353 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 66 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0))]
Finished random walk after 546 steps, including 0 resets, run visited all 4 properties in 19 ms. (steps per millisecond=28 )
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F (NOT (AND p1 (NOT p2)))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 9 factoid took 453 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 63 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 77 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0))]
Support contains 4 out of 116 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 116/116 places, 87/87 transitions.
Applied a total of 0 rules in 7 ms. Remains 116 /116 variables (removed 0) and now considering 87/87 (removed 0) transitions.
// Phase 1: matrix 87 rows 116 cols
[2022-05-19 17:21:18] [INFO ] Computed 36 place invariants in 1 ms
[2022-05-19 17:21:18] [INFO ] Implicit Places using invariants in 69 ms returned []
// Phase 1: matrix 87 rows 116 cols
[2022-05-19 17:21:19] [INFO ] Computed 36 place invariants in 0 ms
[2022-05-19 17:21:19] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2022-05-19 17:21:19] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 87 rows 116 cols
[2022-05-19 17:21:19] [INFO ] Computed 36 place invariants in 1 ms
[2022-05-19 17:21:19] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 116/116 places, 87/87 transitions.
Computed a total of 14 stabilizing places and 18 stable transitions
Computed a total of 14 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (AND p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 310 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 126 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0))]
Finished random walk after 526 steps, including 0 resets, run visited all 4 properties in 12 ms. (steps per millisecond=43 )
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (AND p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F (NOT (AND p1 (NOT p2)))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 9 factoid took 406 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 66 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 66 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 73 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 180 reset in 168 ms.
Product exploration explored 100000 steps with 176 reset in 188 ms.
Built C files in :
/tmp/ltsmin4672202795730213266
[2022-05-19 17:21:20] [INFO ] Computing symmetric may disable matrix : 87 transitions.
[2022-05-19 17:21:20] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 17:21:20] [INFO ] Computing symmetric may enable matrix : 87 transitions.
[2022-05-19 17:21:20] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 17:21:20] [INFO ] Computing Do-Not-Accords matrix : 87 transitions.
[2022-05-19 17:21:20] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 17:21:20] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4672202795730213266
Running compilation step : cd /tmp/ltsmin4672202795730213266;'/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 275 ms.
Running link step : cd /tmp/ltsmin4672202795730213266;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin4672202795730213266;'/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/stateBased12871625136818499643.hoa' '--buchi-type=spotba'
LTSmin run took 540 ms.
FORMULA ProductionCell-PT-none-LTLFireability-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ProductionCell-PT-none-LTLFireability-05 finished in 4572 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((((p0 U p1)||p2)&&(X(F(p0))||p3)))))'
Support contains 4 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 132/132 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 169 transition count 131
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 169 transition count 131
Applied a total of 2 rules in 6 ms. Remains 169 /170 variables (removed 1) and now considering 131/132 (removed 1) transitions.
// Phase 1: matrix 131 rows 169 cols
[2022-05-19 17:21:21] [INFO ] Computed 46 place invariants in 2 ms
[2022-05-19 17:21:21] [INFO ] Implicit Places using invariants in 79 ms returned [59, 129, 130, 134]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 80 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 165/170 places, 131/132 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 164 transition count 129
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 164 transition count 129
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 163 transition count 128
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 163 transition count 128
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 162 transition count 127
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 162 transition count 127
Applied a total of 6 rules in 6 ms. Remains 162 /165 variables (removed 3) and now considering 127/131 (removed 4) transitions.
// Phase 1: matrix 127 rows 162 cols
[2022-05-19 17:21:21] [INFO ] Computed 42 place invariants in 2 ms
[2022-05-19 17:21:21] [INFO ] Implicit Places using invariants in 70 ms returned []
// Phase 1: matrix 127 rows 162 cols
[2022-05-19 17:21:21] [INFO ] Computed 42 place invariants in 1 ms
[2022-05-19 17:21:21] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 162/170 places, 127/132 transitions.
Finished structural reductions, in 2 iterations. Remains : 162/170 places, 127/132 transitions.
Stuttering acceptance computed with spot in 165 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3))), true, (NOT p1), (NOT p0)]
Running random walk in product with property : ProductionCell-PT-none-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p2 p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(OR (AND p2 (NOT p3)) (AND p1 (NOT p3)) (AND p0 (NOT p3))), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s83 1), p1:(EQ s35 1), p0:(AND (EQ s11 1) (EQ s144 1)), p3:(EQ s35 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ProductionCell-PT-none-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ProductionCell-PT-none-LTLFireability-06 finished in 472 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((false U p0))||G(((p0 U p1)&&F(p2)))))'
Support contains 6 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 132/132 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 169 transition count 131
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 169 transition count 131
Applied a total of 2 rules in 3 ms. Remains 169 /170 variables (removed 1) and now considering 131/132 (removed 1) transitions.
// Phase 1: matrix 131 rows 169 cols
[2022-05-19 17:21:22] [INFO ] Computed 46 place invariants in 2 ms
[2022-05-19 17:21:22] [INFO ] Implicit Places using invariants in 76 ms returned [59, 129, 130, 134]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 85 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 165/170 places, 131/132 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 164 transition count 129
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 164 transition count 129
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 163 transition count 128
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 163 transition count 128
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 162 transition count 127
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 162 transition count 127
Applied a total of 6 rules in 5 ms. Remains 162 /165 variables (removed 3) and now considering 127/131 (removed 4) transitions.
// Phase 1: matrix 127 rows 162 cols
[2022-05-19 17:21:22] [INFO ] Computed 42 place invariants in 1 ms
[2022-05-19 17:21:22] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 127 rows 162 cols
[2022-05-19 17:21:22] [INFO ] Computed 42 place invariants in 1 ms
[2022-05-19 17:21:22] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 162/170 places, 127/132 transitions.
Finished structural reductions, in 2 iterations. Remains : 162/170 places, 127/132 transitions.
Stuttering acceptance computed with spot in 207 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (OR (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : ProductionCell-PT-none-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(OR p1 p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={} source=5 dest: 4}, { cond=(OR p1 p0), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=6 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(EQ s112 1), p0:(AND (EQ s15 1) (EQ s51 1) (EQ s59 1)), p2:(AND (EQ s53 1) (EQ s136 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ProductionCell-PT-none-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ProductionCell-PT-none-LTLFireability-07 finished in 509 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(G(X((G((false U G(p1)))||p0))))))'
Support contains 4 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 132/132 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 169 transition count 131
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 169 transition count 131
Applied a total of 2 rules in 5 ms. Remains 169 /170 variables (removed 1) and now considering 131/132 (removed 1) transitions.
// Phase 1: matrix 131 rows 169 cols
[2022-05-19 17:21:22] [INFO ] Computed 46 place invariants in 2 ms
[2022-05-19 17:21:22] [INFO ] Implicit Places using invariants in 79 ms returned [59, 129, 130]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 80 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 166/170 places, 131/132 transitions.
Applied a total of 0 rules in 1 ms. Remains 166 /166 variables (removed 0) and now considering 131/131 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 166/170 places, 131/132 transitions.
Stuttering acceptance computed with spot in 149 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ProductionCell-PT-none-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(AND (EQ s66 1) (EQ s131 1)), p0:(OR (EQ s60 0) (EQ s88 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 184 steps with 0 reset in 1 ms.
FORMULA ProductionCell-PT-none-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ProductionCell-PT-none-LTLFireability-09 finished in 255 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F(!(X(G(!F(p0))) U !(G(p1)||p2)))))'
Support contains 3 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 132/132 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 169 transition count 131
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 169 transition count 131
Applied a total of 2 rules in 7 ms. Remains 169 /170 variables (removed 1) and now considering 131/132 (removed 1) transitions.
// Phase 1: matrix 131 rows 169 cols
[2022-05-19 17:21:22] [INFO ] Computed 46 place invariants in 2 ms
[2022-05-19 17:21:22] [INFO ] Implicit Places using invariants in 79 ms returned [59, 129, 130, 134]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 90 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 165/170 places, 131/132 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 164 transition count 129
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 164 transition count 129
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 163 transition count 128
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 163 transition count 128
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 162 transition count 127
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 162 transition count 127
Applied a total of 6 rules in 5 ms. Remains 162 /165 variables (removed 3) and now considering 127/131 (removed 4) transitions.
// Phase 1: matrix 127 rows 162 cols
[2022-05-19 17:21:22] [INFO ] Computed 42 place invariants in 1 ms
[2022-05-19 17:21:22] [INFO ] Implicit Places using invariants in 77 ms returned []
// Phase 1: matrix 127 rows 162 cols
[2022-05-19 17:21:22] [INFO ] Computed 42 place invariants in 1 ms
[2022-05-19 17:21:23] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 162/170 places, 127/132 transitions.
Finished structural reductions, in 2 iterations. Remains : 162/170 places, 127/132 transitions.
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : ProductionCell-PT-none-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(OR p2 p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={1} source=0 dest: 2}], [{ cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={1} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={1} source=2 dest: 2}, { cond=(AND p2 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={1} source=3 dest: 3}]], initial=0, aps=[p2:(EQ s0 1), p1:(NEQ s95 1), p0:(EQ s80 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 283 reset in 190 ms.
Product exploration explored 100000 steps with 283 reset in 198 ms.
Computed a total of 21 stabilizing places and 25 stable transitions
Computed a total of 21 stabilizing places and 25 stable transitions
Detected a total of 21/162 stabilizing places and 25/127 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X (NOT (AND p2 (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0))))), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (OR p2 p1))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (AND p2 p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (OR (AND p2 (NOT p0)) (AND p1 (NOT p0))))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0)))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (OR p2 p1))), (X (X (NOT (OR p2 p1))))]
Knowledge based reduction with 15 factoid took 793 ms. Reduced automaton from 4 states, 14 edges and 3 AP to 3 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 127 rows 162 cols
[2022-05-19 17:21:24] [INFO ] Computed 42 place invariants in 2 ms
[2022-05-19 17:21:24] [INFO ] [Real]Absence check using 33 positive place invariants in 7 ms returned sat
[2022-05-19 17:21:24] [INFO ] [Real]Absence check using 33 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-19 17:21:24] [INFO ] After 52ms 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 p2 p1 (NOT p0)), (X (NOT (AND p2 (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0))))), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (OR p2 p1))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (AND p2 p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1) p2)))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (OR (AND p2 (NOT p0)) (AND p1 (NOT p0))))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0)))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (OR p2 p1))), (X (X (NOT (OR p2 p1)))), (F (NOT (AND (NOT p0) p1 p2))), (F (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 16 factoid took 1014 ms. Reduced automaton from 3 states, 8 edges and 3 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (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)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 127/127 transitions.
Applied a total of 0 rules in 1 ms. Remains 162 /162 variables (removed 0) and now considering 127/127 (removed 0) transitions.
// Phase 1: matrix 127 rows 162 cols
[2022-05-19 17:21:25] [INFO ] Computed 42 place invariants in 1 ms
[2022-05-19 17:21:26] [INFO ] Implicit Places using invariants in 73 ms returned []
// Phase 1: matrix 127 rows 162 cols
[2022-05-19 17:21:26] [INFO ] Computed 42 place invariants in 1 ms
[2022-05-19 17:21:26] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
// Phase 1: matrix 127 rows 162 cols
[2022-05-19 17:21:26] [INFO ] Computed 42 place invariants in 2 ms
[2022-05-19 17:21:26] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 162/162 places, 127/127 transitions.
Computed a total of 21 stabilizing places and 25 stable transitions
Computed a total of 21 stabilizing places and 25 stable transitions
Detected a total of 21/162 stabilizing places and 25/127 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND (NOT p0) p1 p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 7 factoid took 370 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 3 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND (NOT p0) p1 p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) p2 p1))), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p2) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 506 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 285 reset in 190 ms.
Product exploration explored 100000 steps with 293 reset in 200 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 162 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 162/162 places, 127/127 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 162 transition count 127
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 25 Pre rules applied. Total rules applied 5 place count 162 transition count 129
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 1 with 25 rules applied. Total rules applied 30 place count 162 transition count 129
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 160 transition count 127
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 160 transition count 127
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 44 place count 160 transition count 127
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 45 place count 159 transition count 126
Deduced a syphon composed of 37 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 159 transition count 126
Deduced a syphon composed of 37 places in 0 ms
Applied a total of 46 rules in 23 ms. Remains 159 /162 variables (removed 3) and now considering 126/127 (removed 1) transitions.
[2022-05-19 17:21:28] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 126 rows 159 cols
[2022-05-19 17:21:28] [INFO ] Computed 42 place invariants in 1 ms
[2022-05-19 17:21:28] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 159/162 places, 126/127 transitions.
Finished structural reductions, in 1 iterations. Remains : 159/162 places, 126/127 transitions.
Product exploration explored 100000 steps with 345 reset in 251 ms.
Product exploration explored 100000 steps with 344 reset in 251 ms.
Built C files in :
/tmp/ltsmin6990818646576630439
[2022-05-19 17:21:28] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6990818646576630439
Running compilation step : cd /tmp/ltsmin6990818646576630439;'/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 226 ms.
Running link step : cd /tmp/ltsmin6990818646576630439;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin6990818646576630439;'/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/stateBased12115730140962951543.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 127/127 transitions.
Applied a total of 0 rules in 2 ms. Remains 162 /162 variables (removed 0) and now considering 127/127 (removed 0) transitions.
// Phase 1: matrix 127 rows 162 cols
[2022-05-19 17:21:43] [INFO ] Computed 42 place invariants in 2 ms
[2022-05-19 17:21:43] [INFO ] Implicit Places using invariants in 82 ms returned []
// Phase 1: matrix 127 rows 162 cols
[2022-05-19 17:21:43] [INFO ] Computed 42 place invariants in 0 ms
[2022-05-19 17:21:44] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
// Phase 1: matrix 127 rows 162 cols
[2022-05-19 17:21:44] [INFO ] Computed 42 place invariants in 1 ms
[2022-05-19 17:21:44] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 162/162 places, 127/127 transitions.
Built C files in :
/tmp/ltsmin14940661999199549207
[2022-05-19 17:21:44] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14940661999199549207
Running compilation step : cd /tmp/ltsmin14940661999199549207;'/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 220 ms.
Running link step : cd /tmp/ltsmin14940661999199549207;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin14940661999199549207;'/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/stateBased10430696904029459299.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 17:21:59] [INFO ] Flatten gal took : 9 ms
[2022-05-19 17:21:59] [INFO ] Flatten gal took : 9 ms
[2022-05-19 17:21:59] [INFO ] Time to serialize gal into /tmp/LTL13668230628232218351.gal : 2 ms
[2022-05-19 17:21:59] [INFO ] Time to serialize properties into /tmp/LTL13674916707737044653.ltl : 1 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/LTL13668230628232218351.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13674916707737044653.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/LTL1366823...268
Read 1 LTL properties
Checking formula 0 : !((F(F(!((X(G(!(F("(p86==1)")))))U(!((G("(p101!=1)"))||("(p0==1)"))))))))
Formula 0 simplified : !F!(XG!F"(p86==1)" U !("(p0==1)" | G"(p101!=1)"))
Reverse transition relation is NOT exact ! Due to transitions t15, t27, t30, t37, t42, t45, t51, t58, t83, t119, t126, Intersection with reachable at each...219
Detected timeout of ITS tools.
[2022-05-19 17:22:14] [INFO ] Flatten gal took : 12 ms
[2022-05-19 17:22:14] [INFO ] Applying decomposition
[2022-05-19 17:22:14] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph16367289288571473062.txt' '-o' '/tmp/graph16367289288571473062.bin' '-w' '/tmp/graph16367289288571473062.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16367289288571473062.bin' '-l' '-1' '-v' '-w' '/tmp/graph16367289288571473062.weights' '-q' '0' '-e' '0.001'
[2022-05-19 17:22:14] [INFO ] Decomposing Gal with order
[2022-05-19 17:22:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 17:22:14] [INFO ] Removed a total of 48 redundant transitions.
[2022-05-19 17:22:14] [INFO ] Flatten gal took : 67 ms
[2022-05-19 17:22:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2022-05-19 17:22:14] [INFO ] Time to serialize gal into /tmp/LTL11521775168798797832.gal : 18 ms
[2022-05-19 17:22:14] [INFO ] Time to serialize properties into /tmp/LTL3638676982808380982.ltl : 1 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/LTL11521775168798797832.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3638676982808380982.ltl' '-c' '-stutter-deadlock'

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/LTL1152177...246
Read 1 LTL properties
Checking formula 0 : !((F(F(!((X(G(!(F("(i7.i0.u26.p86==1)")))))U(!((G("(i5.u31.p101!=1)"))||("(i13.i0.u33.p0==1)"))))))))
Formula 0 simplified : !F!(XG!F"(i7.i0.u26.p86==1)" U !("(i13.i0.u33.p0==1)" | G"(i5.u31.p101!=1)"))
Reverse transition relation is NOT exact ! Due to transitions t119, u4.t42, u4.t45, u4.t51, i2.u5.t37, i6.i1.t126, i7.t15, i8.u14.t58, i8.u17.t30, i8.u35.t...275
5 unique states visited
3 strongly connected components in search stack
7 transitions explored
5 items max in DFS search stack
126 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,1.29938,52820,1,0,92659,870,2442,78124,463,2764,156749
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ProductionCell-PT-none-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ProductionCell-PT-none-LTLFireability-10 finished in 53328 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U !F(X(X(p1)))))'
Support contains 3 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 132/132 transitions.
Applied a total of 0 rules in 3 ms. Remains 170 /170 variables (removed 0) and now considering 132/132 (removed 0) transitions.
// Phase 1: matrix 132 rows 170 cols
[2022-05-19 17:22:16] [INFO ] Computed 46 place invariants in 2 ms
[2022-05-19 17:22:16] [INFO ] Implicit Places using invariants in 91 ms returned [59, 130, 131, 135]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 99 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 166/170 places, 132/132 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 165 transition count 130
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 165 transition count 130
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 164 transition count 129
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 164 transition count 129
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 163 transition count 128
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 163 transition count 128
Applied a total of 6 rules in 17 ms. Remains 163 /166 variables (removed 3) and now considering 128/132 (removed 4) transitions.
// Phase 1: matrix 128 rows 163 cols
[2022-05-19 17:22:16] [INFO ] Computed 42 place invariants in 1 ms
[2022-05-19 17:22:16] [INFO ] Implicit Places using invariants in 68 ms returned []
// Phase 1: matrix 128 rows 163 cols
[2022-05-19 17:22:16] [INFO ] Computed 42 place invariants in 1 ms
[2022-05-19 17:22:16] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 163/170 places, 128/132 transitions.
Finished structural reductions, in 2 iterations. Remains : 163/170 places, 128/132 transitions.
Stuttering acceptance computed with spot in 105 ms :[p1, p1, true, p1]
Running random walk in product with property : ProductionCell-PT-none-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 3}]], initial=3, aps=[p1:(EQ s115 1), p0:(AND (EQ s105 1) (EQ s108 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 227 steps with 0 reset in 2 ms.
FORMULA ProductionCell-PT-none-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ProductionCell-PT-none-LTLFireability-11 finished in 451 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 132/132 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 169 transition count 131
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 169 transition count 131
Applied a total of 2 rules in 4 ms. Remains 169 /170 variables (removed 1) and now considering 131/132 (removed 1) transitions.
// Phase 1: matrix 131 rows 169 cols
[2022-05-19 17:22:16] [INFO ] Computed 46 place invariants in 3 ms
[2022-05-19 17:22:16] [INFO ] Implicit Places using invariants in 75 ms returned [59, 129, 130, 134]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 78 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 165/170 places, 131/132 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 164 transition count 129
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 164 transition count 129
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 163 transition count 128
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 163 transition count 128
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 162 transition count 127
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 162 transition count 127
Applied a total of 6 rules in 4 ms. Remains 162 /165 variables (removed 3) and now considering 127/131 (removed 4) transitions.
// Phase 1: matrix 127 rows 162 cols
[2022-05-19 17:22:16] [INFO ] Computed 42 place invariants in 1 ms
[2022-05-19 17:22:16] [INFO ] Implicit Places using invariants in 68 ms returned []
// Phase 1: matrix 127 rows 162 cols
[2022-05-19 17:22:16] [INFO ] Computed 42 place invariants in 1 ms
[2022-05-19 17:22:16] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 162/170 places, 127/132 transitions.
Finished structural reductions, in 2 iterations. Remains : 162/170 places, 127/132 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ProductionCell-PT-none-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s12 1) (EQ s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 338 reset in 168 ms.
Stack based approach found an accepted trace after 710 steps with 2 reset with depth 81 and stack size 81 in 2 ms.
FORMULA ProductionCell-PT-none-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ProductionCell-PT-none-LTLFireability-13 finished in 502 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((F(X(p1))||p0))))'
Support contains 3 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 132/132 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 169 transition count 131
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 169 transition count 131
Applied a total of 2 rules in 5 ms. Remains 169 /170 variables (removed 1) and now considering 131/132 (removed 1) transitions.
// Phase 1: matrix 131 rows 169 cols
[2022-05-19 17:22:17] [INFO ] Computed 46 place invariants in 1 ms
[2022-05-19 17:22:17] [INFO ] Implicit Places using invariants in 95 ms returned [59, 129, 130, 134]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 110 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 165/170 places, 131/132 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 164 transition count 129
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 164 transition count 129
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 163 transition count 128
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 163 transition count 128
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 162 transition count 127
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 162 transition count 127
Applied a total of 6 rules in 13 ms. Remains 162 /165 variables (removed 3) and now considering 127/131 (removed 4) transitions.
// Phase 1: matrix 127 rows 162 cols
[2022-05-19 17:22:17] [INFO ] Computed 42 place invariants in 1 ms
[2022-05-19 17:22:17] [INFO ] Implicit Places using invariants in 75 ms returned []
// Phase 1: matrix 127 rows 162 cols
[2022-05-19 17:22:17] [INFO ] Computed 42 place invariants in 1 ms
[2022-05-19 17:22:17] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 162/170 places, 127/132 transitions.
Finished structural reductions, in 2 iterations. Remains : 162/170 places, 127/132 transitions.
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ProductionCell-PT-none-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s28 0) (EQ s34 0)), p1:(EQ s95 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 229 ms.
Product exploration explored 100000 steps with 50000 reset in 237 ms.
Computed a total of 21 stabilizing places and 25 stable transitions
Computed a total of 21 stabilizing places and 25 stable transitions
Detected a total of 21/162 stabilizing places and 25/127 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 68 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA ProductionCell-PT-none-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ProductionCell-PT-none-LTLFireability-15 finished in 971 ms.
All properties solved by simple procedures.
Total runtime 66160 ms.

BK_STOP 1652980938096

--------------------
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="ProductionCell-PT-none"
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 ProductionCell-PT-none, 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 r168-tall-165277017300892"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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