Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 29K Feb 25 22:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 157K Feb 25 22:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 40K Feb 25 22:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 194K Feb 25 22:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 15K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 50K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 93K Feb 25 22:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 439K Feb 25 22:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 58K Feb 25 22:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 283K Feb 25 22:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 11K Feb 25 16:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 143K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Peterson-PT-3-LTLFireability-00
FORMULA_NAME Peterson-PT-3-LTLFireability-01
FORMULA_NAME Peterson-PT-3-LTLFireability-02
FORMULA_NAME Peterson-PT-3-LTLFireability-03
FORMULA_NAME Peterson-PT-3-LTLFireability-04
FORMULA_NAME Peterson-PT-3-LTLFireability-05
FORMULA_NAME Peterson-PT-3-LTLFireability-06
FORMULA_NAME Peterson-PT-3-LTLFireability-07
FORMULA_NAME Peterson-PT-3-LTLFireability-08
FORMULA_NAME Peterson-PT-3-LTLFireability-09
FORMULA_NAME Peterson-PT-3-LTLFireability-10
FORMULA_NAME Peterson-PT-3-LTLFireability-11
FORMULA_NAME Peterson-PT-3-LTLFireability-12
FORMULA_NAME Peterson-PT-3-LTLFireability-13
FORMULA_NAME Peterson-PT-3-LTLFireability-14
FORMULA_NAME Peterson-PT-3-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679044915731

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-3
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-17 09:21:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-17 09:21:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 09:21:59] [INFO ] Load time of PNML (sax parser for PT used): 140 ms
[2023-03-17 09:21:59] [INFO ] Transformed 244 places.
[2023-03-17 09:21:59] [INFO ] Transformed 332 transitions.
[2023-03-17 09:21:59] [INFO ] Found NUPN structural information;
[2023-03-17 09:21:59] [INFO ] Completing missing partition info from NUPN : creating a component with [TestAlone_1_2_3, TestAlone_2_2_3]
[2023-03-17 09:21:59] [INFO ] Parsed PT model containing 244 places and 332 transitions and 1016 arcs in 383 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Peterson-PT-3-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-3-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 161 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 35 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2023-03-17 09:21:59] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2023-03-17 09:21:59] [INFO ] Computed 15 place invariants in 22 ms
[2023-03-17 09:22:00] [INFO ] Implicit Places using invariants in 332 ms returned []
[2023-03-17 09:22:00] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-17 09:22:00] [INFO ] Invariant cache hit.
[2023-03-17 09:22:00] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-17 09:22:00] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 696 ms to find 0 implicit places.
[2023-03-17 09:22:00] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-17 09:22:00] [INFO ] Invariant cache hit.
[2023-03-17 09:22:00] [INFO ] Dead Transitions using invariants and state equation in 495 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1245 ms. Remains : 244/244 places, 332/332 transitions.
Support contains 161 out of 244 places after structural reductions.
[2023-03-17 09:22:01] [INFO ] Flatten gal took : 111 ms
[2023-03-17 09:22:01] [INFO ] Flatten gal took : 49 ms
[2023-03-17 09:22:01] [INFO ] Input system was already deterministic with 332 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 762 ms. (steps per millisecond=13 ) properties (out of 27) seen :22
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-17 09:22:02] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-17 09:22:02] [INFO ] Invariant cache hit.
[2023-03-17 09:22:02] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2023-03-17 09:22:02] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-17 09:22:02] [INFO ] After 229ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-17 09:22:03] [INFO ] [Nat]Absence check using 11 positive place invariants in 11 ms returned sat
[2023-03-17 09:22:03] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-17 09:22:03] [INFO ] After 312ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-17 09:22:03] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-17 09:22:03] [INFO ] After 140ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-17 09:22:03] [INFO ] Deduced a trap composed of 46 places in 163 ms of which 7 ms to minimize.
[2023-03-17 09:22:03] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 1 ms to minimize.
[2023-03-17 09:22:04] [INFO ] Deduced a trap composed of 45 places in 114 ms of which 1 ms to minimize.
[2023-03-17 09:22:04] [INFO ] Deduced a trap composed of 27 places in 132 ms of which 3 ms to minimize.
[2023-03-17 09:22:04] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 1 ms to minimize.
[2023-03-17 09:22:04] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 0 ms to minimize.
[2023-03-17 09:22:04] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 1 ms to minimize.
[2023-03-17 09:22:04] [INFO ] Deduced a trap composed of 27 places in 126 ms of which 0 ms to minimize.
[2023-03-17 09:22:04] [INFO ] Deduced a trap composed of 30 places in 125 ms of which 1 ms to minimize.
[2023-03-17 09:22:05] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 1 ms to minimize.
[2023-03-17 09:22:05] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 1 ms to minimize.
[2023-03-17 09:22:05] [INFO ] Deduced a trap composed of 16 places in 139 ms of which 0 ms to minimize.
[2023-03-17 09:22:05] [INFO ] Deduced a trap composed of 13 places in 175 ms of which 1 ms to minimize.
[2023-03-17 09:22:05] [INFO ] Deduced a trap composed of 31 places in 202 ms of which 1 ms to minimize.
[2023-03-17 09:22:05] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2273 ms
[2023-03-17 09:22:06] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 1 ms to minimize.
[2023-03-17 09:22:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
[2023-03-17 09:22:06] [INFO ] Deduced a trap composed of 34 places in 104 ms of which 0 ms to minimize.
[2023-03-17 09:22:06] [INFO ] Deduced a trap composed of 55 places in 104 ms of which 0 ms to minimize.
[2023-03-17 09:22:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 280 ms
[2023-03-17 09:22:06] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 1 ms to minimize.
[2023-03-17 09:22:06] [INFO ] Deduced a trap composed of 38 places in 109 ms of which 1 ms to minimize.
[2023-03-17 09:22:06] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 0 ms to minimize.
[2023-03-17 09:22:06] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 1 ms to minimize.
[2023-03-17 09:22:06] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 430 ms
[2023-03-17 09:22:06] [INFO ] After 3459ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 94 ms.
[2023-03-17 09:22:07] [INFO ] After 4102ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 32 ms.
Support contains 30 out of 244 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 244 transition count 272
Reduce places removed 60 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 69 rules applied. Total rules applied 129 place count 184 transition count 263
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 138 place count 175 transition count 263
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 138 place count 175 transition count 216
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 232 place count 128 transition count 216
Applied a total of 232 rules in 41 ms. Remains 128 /244 variables (removed 116) and now considering 216/332 (removed 116) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 128/244 places, 216/332 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 269 ms. (steps per millisecond=37 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Finished probabilistic random walk after 579781 steps, run visited all 5 properties in 2220 ms. (steps per millisecond=261 )
Probabilistic random walk after 579781 steps, saw 116100 distinct states, run finished after 2220 ms. (steps per millisecond=261 ) properties seen :5
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 12 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 31 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2023-03-17 09:22:10] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-17 09:22:10] [INFO ] Invariant cache hit.
[2023-03-17 09:22:10] [INFO ] Implicit Places using invariants in 265 ms returned [230, 231, 232, 233]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 269 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 24 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 327 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 319 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-PT-3-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s179 1) (EQ s193 1) (EQ s161 1) (EQ s192 1) (EQ s215 1) (EQ s197 1) (EQ s219 1) (EQ s187 1) (EQ s201 1) (EQ s169 1) (EQ s175 1) (EQ s157 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 1 steps with 0 reset in 3 ms.
FORMULA Peterson-PT-3-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-3-LTLFireability-00 finished in 745 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F(p1)))'
Support contains 48 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 8 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2023-03-17 09:22:11] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-17 09:22:11] [INFO ] Invariant cache hit.
[2023-03-17 09:22:11] [INFO ] Implicit Places using invariants in 152 ms returned [230, 231, 232, 233]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 161 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 10 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 181 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : Peterson-PT-3-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (OR (EQ s111 0) (EQ s132 0)) (OR (EQ s111 0) (EQ s131 0)) (OR (EQ s111 0) (EQ s130 0)) (OR (EQ s111 0) (EQ s129 0)) (OR (EQ s109 0) (EQ s113 0)) (...], 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 50000 reset in 685 ms.
Product exploration explored 100000 steps with 50000 reset in 780 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), true, (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 5 factoid took 99 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Peterson-PT-3-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-PT-3-LTLFireability-01 finished in 2006 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||(X((p1 U p2))&&G(p3)))))'
Support contains 52 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 5 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2023-03-17 09:22:13] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-17 09:22:13] [INFO ] Invariant cache hit.
[2023-03-17 09:22:13] [INFO ] Implicit Places using invariants in 117 ms returned []
[2023-03-17 09:22:13] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-17 09:22:13] [INFO ] Invariant cache hit.
[2023-03-17 09:22:13] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-17 09:22:13] [INFO ] Implicit Places using invariants and state equation in 471 ms returned []
Implicit Place search using SMT with State Equation took 599 ms to find 0 implicit places.
[2023-03-17 09:22:13] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-17 09:22:13] [INFO ] Invariant cache hit.
[2023-03-17 09:22:14] [INFO ] Dead Transitions using invariants and state equation in 497 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1103 ms. Remains : 244/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 273 ms :[(AND (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Running random walk in product with property : Peterson-PT-3-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p3), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p3 p2), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p3 (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p1))), acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p0) p3), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=1, aps=[p0:(AND (OR (EQ s110 0) (EQ s230 0)) (OR (EQ s111 0) (EQ s231 0)) (OR (EQ s112 0) (EQ s232 0)) (OR (EQ s113 0) (EQ s233 0))), p3:(AND (EQ s53 0) (EQ s59 0...], 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 10679 reset in 579 ms.
Stack based approach found an accepted trace after 1185 steps with 120 reset with depth 11 and stack size 11 in 12 ms.
FORMULA Peterson-PT-3-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-3-LTLFireability-02 finished in 1995 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(F(p0))&&F(p1))))'
Support contains 60 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 4 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2023-03-17 09:22:15] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-17 09:22:15] [INFO ] Invariant cache hit.
[2023-03-17 09:22:15] [INFO ] Implicit Places using invariants in 212 ms returned [230, 231, 232, 233]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 215 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 4 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 223 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 261 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p0), (NOT p1), (NOT p0)]
Running random walk in product with property : Peterson-PT-3-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (AND (EQ s211 1) (EQ s227 1)) (AND (EQ s216 1) (EQ s228 1)) (AND (EQ s211 1) (EQ s228 1)) (AND (EQ s216 1) (EQ s229 1)) (AND (EQ s211 1) (EQ s226 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][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 6098 reset in 663 ms.
Stack based approach found an accepted trace after 1130 steps with 72 reset with depth 31 and stack size 31 in 9 ms.
FORMULA Peterson-PT-3-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-3-LTLFireability-03 finished in 1186 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0) U X(G((p1 U X(p1))))))'
Support contains 48 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 3 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2023-03-17 09:22:16] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-17 09:22:16] [INFO ] Invariant cache hit.
[2023-03-17 09:22:16] [INFO ] Implicit Places using invariants in 130 ms returned [230, 231, 232, 233]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 131 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 3 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 137 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 352 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1), (NOT p1), true, (AND p0 (NOT p1)), (NOT p1), (NOT p1), (NOT p1), p0]
Running random walk in product with property : Peterson-PT-3-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 7}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 9}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=7 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 8}], [{ cond=(NOT p1), acceptance={} source=8 dest: 0}, { cond=(NOT p1), acceptance={} source=8 dest: 3}], [{ cond=p0, acceptance={} source=9 dest: 4}, { cond=(NOT p0), acceptance={} source=9 dest: 9}]], initial=2, aps=[p1:(OR (AND (EQ s170 1) (EQ s230 1)) (AND (EQ s146 1) (EQ s206 1)) (AND (EQ s145 1) (EQ s211 1)) (AND (EQ s148 1) (EQ s209 1)) (AND (EQ s171 1) (EQ s208 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 306 ms.
Product exploration explored 100000 steps with 1 reset in 357 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 p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), true, (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (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 9 factoid took 882 ms. Reduced automaton from 10 states, 24 edges and 2 AP (stutter sensitive) to 10 states, 24 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 477 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1), (NOT p1), true, (AND p0 (NOT p1)), (NOT p1), (NOT p1), (NOT p1), p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-17 09:22:19] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 240 cols
[2023-03-17 09:22:19] [INFO ] Computed 11 place invariants in 4 ms
[2023-03-17 09:22:19] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-17 09:22:19] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2023-03-17 09:22:19] [INFO ] After 259ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-17 09:22:19] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-17 09:22:19] [INFO ] After 159ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-17 09:22:19] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 1 ms to minimize.
[2023-03-17 09:22:20] [INFO ] Deduced a trap composed of 13 places in 149 ms of which 0 ms to minimize.
[2023-03-17 09:22:20] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 1 ms to minimize.
[2023-03-17 09:22:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 557 ms
[2023-03-17 09:22:20] [INFO ] Deduced a trap composed of 9 places in 154 ms of which 1 ms to minimize.
[2023-03-17 09:22:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 196 ms
[2023-03-17 09:22:20] [INFO ] After 1026ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 115 ms.
[2023-03-17 09:22:20] [INFO ] After 1502ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 10 ms.
Support contains 48 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 332/332 transitions.
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 240 transition count 269
Reduce places removed 63 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 72 rules applied. Total rules applied 135 place count 177 transition count 260
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 144 place count 168 transition count 260
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 144 place count 168 transition count 212
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 240 place count 120 transition count 212
Applied a total of 240 rules in 21 ms. Remains 120 /240 variables (removed 120) and now considering 212/332 (removed 120) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 120/240 places, 212/332 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Finished probabilistic random walk after 123203 steps, run visited all 2 properties in 493 ms. (steps per millisecond=249 )
Probabilistic random walk after 123203 steps, saw 24670 distinct states, run finished after 493 ms. (steps per millisecond=249 ) properties seen :2
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), true, (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (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 (AND (NOT p0) p1)), (F p0), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 9 factoid took 753 ms. Reduced automaton from 10 states, 24 edges and 2 AP (stutter sensitive) to 10 states, 24 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 441 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1), (NOT p1), true, (AND p0 (NOT p1)), (NOT p1), (NOT p1), (NOT p1), p0]
Stuttering acceptance computed with spot in 486 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1), (NOT p1), true, (AND p0 (NOT p1)), (NOT p1), (NOT p1), (NOT p1), p0]
[2023-03-17 09:22:23] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-17 09:22:23] [INFO ] Invariant cache hit.
[2023-03-17 09:22:23] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2023-03-17 09:22:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 09:22:23] [INFO ] [Real]Absence check using state equation in 294 ms returned sat
[2023-03-17 09:22:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 09:22:24] [INFO ] [Nat]Absence check using 11 positive place invariants in 11 ms returned sat
[2023-03-17 09:22:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 09:22:24] [INFO ] [Nat]Absence check using state equation in 281 ms returned sat
[2023-03-17 09:22:24] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-17 09:22:24] [INFO ] [Nat]Added 57 Read/Feed constraints in 26 ms returned sat
[2023-03-17 09:22:24] [INFO ] Deduced a trap composed of 9 places in 152 ms of which 1 ms to minimize.
[2023-03-17 09:22:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 202 ms
[2023-03-17 09:22:24] [INFO ] Computed and/alt/rep : 283/461/283 causal constraints (skipped 21 transitions) in 43 ms.
[2023-03-17 09:22:25] [INFO ] Added : 7 causal constraints over 2 iterations in 170 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 48 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 332/332 transitions.
Applied a total of 0 rules in 5 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2023-03-17 09:22:25] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-17 09:22:25] [INFO ] Invariant cache hit.
[2023-03-17 09:22:25] [INFO ] Implicit Places using invariants in 189 ms returned []
[2023-03-17 09:22:25] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-17 09:22:25] [INFO ] Invariant cache hit.
[2023-03-17 09:22:25] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-17 09:22:25] [INFO ] Implicit Places using invariants and state equation in 503 ms returned []
Implicit Place search using SMT with State Equation took 694 ms to find 0 implicit places.
[2023-03-17 09:22:25] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-17 09:22:25] [INFO ] Invariant cache hit.
[2023-03-17 09:22:26] [INFO ] Dead Transitions using invariants and state equation in 449 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1149 ms. Remains : 240/240 places, 332/332 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)), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), true, (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (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 9 factoid took 868 ms. Reduced automaton from 10 states, 24 edges and 2 AP (stutter sensitive) to 10 states, 24 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 491 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1), (NOT p1), true, (AND p0 (NOT p1)), (NOT p1), (NOT p1), (NOT p1), p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-17 09:22:27] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-17 09:22:27] [INFO ] Invariant cache hit.
[2023-03-17 09:22:28] [INFO ] After 144ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-17 09:22:28] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2023-03-17 09:22:28] [INFO ] After 290ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-17 09:22:28] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-17 09:22:28] [INFO ] After 146ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-17 09:22:28] [INFO ] Deduced a trap composed of 9 places in 226 ms of which 1 ms to minimize.
[2023-03-17 09:22:29] [INFO ] Deduced a trap composed of 16 places in 146 ms of which 1 ms to minimize.
[2023-03-17 09:22:29] [INFO ] Deduced a trap composed of 51 places in 159 ms of which 0 ms to minimize.
[2023-03-17 09:22:29] [INFO ] Deduced a trap composed of 20 places in 170 ms of which 1 ms to minimize.
[2023-03-17 09:22:29] [INFO ] Deduced a trap composed of 29 places in 129 ms of which 1 ms to minimize.
[2023-03-17 09:22:29] [INFO ] Deduced a trap composed of 30 places in 145 ms of which 2 ms to minimize.
[2023-03-17 09:22:30] [INFO ] Deduced a trap composed of 48 places in 112 ms of which 6 ms to minimize.
[2023-03-17 09:22:30] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 0 ms to minimize.
[2023-03-17 09:22:30] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 1 ms to minimize.
[2023-03-17 09:22:30] [INFO ] Deduced a trap composed of 49 places in 97 ms of which 1 ms to minimize.
[2023-03-17 09:22:30] [INFO ] Deduced a trap composed of 49 places in 89 ms of which 1 ms to minimize.
[2023-03-17 09:22:30] [INFO ] Deduced a trap composed of 17 places in 136 ms of which 1 ms to minimize.
[2023-03-17 09:22:30] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2179 ms
[2023-03-17 09:22:31] [INFO ] Deduced a trap composed of 26 places in 131 ms of which 1 ms to minimize.
[2023-03-17 09:22:31] [INFO ] Deduced a trap composed of 26 places in 157 ms of which 1 ms to minimize.
[2023-03-17 09:22:31] [INFO ] Deduced a trap composed of 45 places in 154 ms of which 1 ms to minimize.
[2023-03-17 09:22:31] [INFO ] Deduced a trap composed of 27 places in 151 ms of which 1 ms to minimize.
[2023-03-17 09:22:31] [INFO ] Deduced a trap composed of 26 places in 152 ms of which 1 ms to minimize.
[2023-03-17 09:22:31] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 969 ms
[2023-03-17 09:22:31] [INFO ] After 3473ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 169 ms.
[2023-03-17 09:22:32] [INFO ] After 4104ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 492 steps, including 146 resets, run visited all 2 properties in 13 ms. (steps per millisecond=37 )
Parikh walk visited 2 properties in 13 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), true, (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (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 (AND (NOT p0) p1)), (F p0), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 9 factoid took 1046 ms. Reduced automaton from 10 states, 24 edges and 2 AP (stutter sensitive) to 10 states, 24 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 482 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1), (NOT p1), true, (AND p0 (NOT p1)), (NOT p1), (NOT p1), (NOT p1), p0]
Stuttering acceptance computed with spot in 479 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1), (NOT p1), true, (AND p0 (NOT p1)), (NOT p1), (NOT p1), (NOT p1), p0]
[2023-03-17 09:22:34] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-17 09:22:34] [INFO ] Invariant cache hit.
[2023-03-17 09:22:34] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2023-03-17 09:22:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 09:22:34] [INFO ] [Real]Absence check using state equation in 304 ms returned sat
[2023-03-17 09:22:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 09:22:35] [INFO ] [Nat]Absence check using 11 positive place invariants in 10 ms returned sat
[2023-03-17 09:22:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 09:22:35] [INFO ] [Nat]Absence check using state equation in 265 ms returned sat
[2023-03-17 09:22:35] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-17 09:22:35] [INFO ] [Nat]Added 57 Read/Feed constraints in 26 ms returned sat
[2023-03-17 09:22:35] [INFO ] Deduced a trap composed of 9 places in 165 ms of which 1 ms to minimize.
[2023-03-17 09:22:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 211 ms
[2023-03-17 09:22:35] [INFO ] Computed and/alt/rep : 283/461/283 causal constraints (skipped 21 transitions) in 40 ms.
[2023-03-17 09:22:36] [INFO ] Added : 7 causal constraints over 2 iterations in 165 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 399 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1), (NOT p1), true, (AND p0 (NOT p1)), (NOT p1), (NOT p1), (NOT p1), p0]
Product exploration explored 100000 steps with 1 reset in 300 ms.
Product exploration explored 100000 steps with 2 reset in 538 ms.
Applying partial POR strategy [false, false, false, true, true, true, false, false, true, true]
Stuttering acceptance computed with spot in 470 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1), (NOT p1), true, (AND p0 (NOT p1)), (NOT p1), (NOT p1), (NOT p1), p0]
Support contains 48 out of 240 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 240/240 places, 332/332 transitions.
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 240 transition count 332
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 31 Pre rules applied. Total rules applied 45 place count 240 transition count 350
Deduced a syphon composed of 76 places in 0 ms
Iterating global reduction 1 with 31 rules applied. Total rules applied 76 place count 240 transition count 350
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 120 places in 0 ms
Iterating global reduction 1 with 44 rules applied. Total rules applied 120 place count 240 transition count 350
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 165 place count 195 transition count 305
Deduced a syphon composed of 75 places in 0 ms
Iterating global reduction 1 with 45 rules applied. Total rules applied 210 place count 195 transition count 305
Deduced a syphon composed of 75 places in 0 ms
Applied a total of 210 rules in 63 ms. Remains 195 /240 variables (removed 45) and now considering 305/332 (removed 27) transitions.
[2023-03-17 09:22:38] [INFO ] Redundant transitions in 33 ms returned []
[2023-03-17 09:22:38] [INFO ] Flow matrix only has 281 transitions (discarded 24 similar events)
// Phase 1: matrix 281 rows 195 cols
[2023-03-17 09:22:38] [INFO ] Computed 11 place invariants in 3 ms
[2023-03-17 09:22:38] [INFO ] Dead Transitions using invariants and state equation in 383 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 195/240 places, 305/332 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 492 ms. Remains : 195/240 places, 305/332 transitions.
Built C files in :
/tmp/ltsmin6260739956308926357
[2023-03-17 09:22:38] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6260739956308926357
Running compilation step : cd /tmp/ltsmin6260739956308926357;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1260 ms.
Running link step : cd /tmp/ltsmin6260739956308926357;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin6260739956308926357;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4949323350871527547.hoa' '--buchi-type=spotba'
LTSmin run took 168 ms.
FORMULA Peterson-PT-3-LTLFireability-04 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Peterson-PT-3-LTLFireability-04 finished in 23869 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 4 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 4 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2023-03-17 09:22:40] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2023-03-17 09:22:40] [INFO ] Computed 15 place invariants in 3 ms
[2023-03-17 09:22:40] [INFO ] Implicit Places using invariants in 169 ms returned [230, 231, 232, 233]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 179 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 7 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 190 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-PT-3-LTLFireability-06 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:(AND (EQ s53 0) (EQ s59 0) (EQ s58 0) (EQ s60 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 58 steps with 0 reset in 1 ms.
FORMULA Peterson-PT-3-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-3-LTLFireability-06 finished in 324 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(p1))))'
Support contains 16 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 6 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2023-03-17 09:22:40] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-17 09:22:40] [INFO ] Invariant cache hit.
[2023-03-17 09:22:40] [INFO ] Implicit Places using invariants in 250 ms returned [230, 231, 232, 233]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 252 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 12 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 271 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 239 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : Peterson-PT-3-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(AND (NEQ s49 1) (NEQ s51 1) (NEQ s50 1) (NEQ s52 1) (NEQ s55 1) (NEQ s54 1) (NEQ s56 1) (NEQ s45 1)), p0:(OR (AND (EQ s114 1) (EQ s233 1)) (AND (EQ s1...], 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Peterson-PT-3-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-3-LTLFireability-07 finished in 532 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 2 out of 244 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 0 with 94 rules applied. Total rules applied 94 place count 244 transition count 238
Reduce places removed 94 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 95 rules applied. Total rules applied 189 place count 150 transition count 237
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 190 place count 149 transition count 237
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 46 Pre rules applied. Total rules applied 190 place count 149 transition count 191
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 282 place count 103 transition count 191
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 304 place count 92 transition count 180
Applied a total of 304 rules in 35 ms. Remains 92 /244 variables (removed 152) and now considering 180/332 (removed 152) transitions.
[2023-03-17 09:22:41] [INFO ] Flow matrix only has 156 transitions (discarded 24 similar events)
// Phase 1: matrix 156 rows 92 cols
[2023-03-17 09:22:41] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-17 09:22:41] [INFO ] Implicit Places using invariants in 159 ms returned [84, 85, 86, 87]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 161 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 88/244 places, 180/332 transitions.
Applied a total of 0 rules in 12 ms. Remains 88 /88 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 210 ms. Remains : 88/244 places, 180/332 transitions.
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Peterson-PT-3-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s49 1), p1:(EQ s36 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 217 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 and stack size 9 in 0 ms.
FORMULA Peterson-PT-3-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-3-LTLFireability-08 finished in 615 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 244 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 244 transition count 236
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 1 with 96 rules applied. Total rules applied 192 place count 148 transition count 236
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 192 place count 148 transition count 188
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 288 place count 100 transition count 188
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 312 place count 88 transition count 176
Applied a total of 312 rules in 25 ms. Remains 88 /244 variables (removed 156) and now considering 176/332 (removed 156) transitions.
[2023-03-17 09:22:41] [INFO ] Flow matrix only has 152 transitions (discarded 24 similar events)
// Phase 1: matrix 152 rows 88 cols
[2023-03-17 09:22:41] [INFO ] Computed 15 place invariants in 2 ms
[2023-03-17 09:22:41] [INFO ] Implicit Places using invariants in 140 ms returned [81, 82, 83, 84]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 141 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/244 places, 176/332 transitions.
Applied a total of 0 rules in 9 ms. Remains 84 /84 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 175 ms. Remains : 84/244 places, 176/332 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : Peterson-PT-3-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s64 1) (EQ s72 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 249 ms.
Stack based approach found an accepted trace after 28 steps with 0 reset with depth 29 and stack size 29 in 0 ms.
FORMULA Peterson-PT-3-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-3-LTLFireability-09 finished in 494 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 1 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 5 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2023-03-17 09:22:42] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2023-03-17 09:22:42] [INFO ] Computed 15 place invariants in 2 ms
[2023-03-17 09:22:42] [INFO ] Implicit Places using invariants in 205 ms returned [230, 231, 232, 233]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 207 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 3 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 215 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Peterson-PT-3-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s159 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-3-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-3-LTLFireability-10 finished in 310 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((F(G(p0)) U p1)))))'
Support contains 2 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 5 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2023-03-17 09:22:42] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-17 09:22:42] [INFO ] Invariant cache hit.
[2023-03-17 09:22:42] [INFO ] Implicit Places using invariants in 177 ms returned [230, 231, 232, 233]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 179 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 2 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 187 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 198 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : Peterson-PT-3-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s53 1), p0:(EQ s163 1)], 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 0 reset in 223 ms.
Stack based approach found an accepted trace after 64 steps with 0 reset with depth 65 and stack size 65 in 0 ms.
FORMULA Peterson-PT-3-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-3-LTLFireability-11 finished in 628 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0)) U ((!p1 U X(X(!p2))) U p2)))'
Support contains 5 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 4 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2023-03-17 09:22:43] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-17 09:22:43] [INFO ] Invariant cache hit.
[2023-03-17 09:22:43] [INFO ] Implicit Places using invariants in 198 ms returned [230, 231, 232, 233]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 200 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 3 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 209 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 699 ms :[(NOT p2), (AND (NOT p0) p2), (AND (NOT p0) (NOT p2)), (AND p2 (NOT p0)), p2, (AND (NOT p0) p2), p2, (AND p2 (NOT p0)), (AND p0 p2), (NOT p2), (AND p0 p2), p2, true, (AND (NOT p0) p2), (NOT p0)]
Running random walk in product with property : Peterson-PT-3-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(NOT p2), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 6}, { cond=(AND p1 p0), acceptance={} source=1 dest: 7}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 8}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 9}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 10}], [{ cond=(NOT p0), acceptance={} source=3 dest: 11}, { cond=p0, acceptance={} source=3 dest: 13}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND p2 p1), acceptance={0} source=4 dest: 6}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=5 dest: 5}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=5 dest: 6}, { cond=(AND p2 p1 p0), acceptance={} source=5 dest: 7}], [{ cond=p2, acceptance={} source=6 dest: 11}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=7 dest: 11}, { cond=(AND p2 p0), acceptance={} source=7 dest: 13}], [{ cond=p0, acceptance={} source=8 dest: 11}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=9 dest: 8}, { cond=(NOT p2), acceptance={0} source=9 dest: 9}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=9 dest: 10}], [{ cond=(AND (NOT p1) p0), acceptance={} source=10 dest: 4}, { cond=(AND p1 p0), acceptance={} source=10 dest: 6}], [{ cond=p2, acceptance={} source=11 dest: 12}], [{ cond=true, acceptance={0} source=12 dest: 12}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=13 dest: 12}, { cond=(AND p2 p0), acceptance={} source=13 dest: 14}], [{ cond=(NOT p0), acceptance={} source=14 dest: 12}, { cond=p0, acceptance={} source=14 dest: 14}]], initial=0, aps=[p2:(AND (EQ s116 1) (EQ s135 1)), p1:(AND (EQ s168 1) (EQ s212 1)), p0:(EQ s54 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25065 reset in 523 ms.
Product exploration explored 100000 steps with 25041 reset in 604 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p2) (NOT p0))), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 p1 p0))))]
False Knowledge obtained : []
Knowledge based reduction with 31 factoid took 2796 ms. Reduced automaton from 15 states, 34 edges and 3 AP (stutter sensitive) to 15 states, 34 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 753 ms :[(NOT p2), (AND (NOT p0) p2), (AND (NOT p0) (NOT p2)), (AND p2 (NOT p0)), p2, (AND (NOT p0) p2), p2, (AND p2 (NOT p0)), (AND p0 p2), (NOT p2), (AND p0 p2), p2, true, (AND (NOT p0) p2), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 19) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-17 09:22:49] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 240 cols
[2023-03-17 09:22:49] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-17 09:22:49] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2023-03-17 09:22:49] [INFO ] After 404ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-17 09:22:49] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2023-03-17 09:22:49] [INFO ] After 236ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-17 09:22:49] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-17 09:22:49] [INFO ] After 93ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-17 09:22:50] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 2 ms to minimize.
[2023-03-17 09:22:50] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 1 ms to minimize.
[2023-03-17 09:22:50] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 1 ms to minimize.
[2023-03-17 09:22:50] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 2 ms to minimize.
[2023-03-17 09:22:50] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 1 ms to minimize.
[2023-03-17 09:22:50] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 0 ms to minimize.
[2023-03-17 09:22:50] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 2 ms to minimize.
[2023-03-17 09:22:50] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 842 ms
[2023-03-17 09:22:50] [INFO ] After 1041ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 74 ms.
[2023-03-17 09:22:50] [INFO ] After 1510ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 36 ms.
Support contains 5 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 332/332 transitions.
Drop transitions removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 0 with 94 rules applied. Total rules applied 94 place count 240 transition count 238
Reduce places removed 94 places and 0 transitions.
Iterating post reduction 1 with 94 rules applied. Total rules applied 188 place count 146 transition count 238
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 188 place count 146 transition count 190
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 284 place count 98 transition count 190
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
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 306 place count 87 transition count 179
Applied a total of 306 rules in 21 ms. Remains 87 /240 variables (removed 153) and now considering 179/332 (removed 153) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 87/240 places, 179/332 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-17 09:22:51] [INFO ] Flow matrix only has 155 transitions (discarded 24 similar events)
// Phase 1: matrix 155 rows 87 cols
[2023-03-17 09:22:51] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-17 09:22:51] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2023-03-17 09:22:51] [INFO ] After 151ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 09:22:51] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-03-17 09:22:51] [INFO ] After 86ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 09:22:51] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-17 09:22:51] [INFO ] After 23ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-17 09:22:51] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 3 ms to minimize.
[2023-03-17 09:22:51] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2023-03-17 09:22:51] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
[2023-03-17 09:22:51] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2023-03-17 09:22:51] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 0 ms to minimize.
[2023-03-17 09:22:51] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2023-03-17 09:22:51] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 387 ms
[2023-03-17 09:22:51] [INFO ] After 424ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-17 09:22:51] [INFO ] After 597ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 179/179 transitions.
Applied a total of 0 rules in 7 ms. Remains 87 /87 variables (removed 0) and now considering 179/179 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 87/87 places, 179/179 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 38976 steps, run visited all 1 properties in 103 ms. (steps per millisecond=378 )
Probabilistic random walk after 38976 steps, saw 8099 distinct states, run finished after 103 ms. (steps per millisecond=378 ) properties seen :1
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p2) (NOT p0))), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 p1 p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2)))), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1 p2)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1) p2)), (F (AND (NOT p0) (NOT p1) p2)), (F (AND p0 p1)), (F (AND (NOT p0) p1)), (F (AND p1 p2)), (F p2), (F (AND p0 p2)), (F (AND (NOT p0) p2)), (F (AND p1 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND p0 p1 p2)), (F (AND (NOT p1) p2)), (F p0)]
Knowledge based reduction with 31 factoid took 3386 ms. Reduced automaton from 15 states, 34 edges and 3 AP (stutter sensitive) to 15 states, 34 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 790 ms :[(NOT p2), (AND (NOT p0) p2), (AND (NOT p0) (NOT p2)), (AND p2 (NOT p0)), p2, (AND (NOT p0) p2), p2, (AND p2 (NOT p0)), (AND p0 p2), (NOT p2), (AND p0 p2), p2, true, (AND (NOT p0) p2), (NOT p0)]
Stuttering acceptance computed with spot in 782 ms :[(NOT p2), (AND (NOT p0) p2), (AND (NOT p0) (NOT p2)), (AND p2 (NOT p0)), p2, (AND (NOT p0) p2), p2, (AND p2 (NOT p0)), (AND p0 p2), (NOT p2), (AND p0 p2), p2, true, (AND (NOT p0) p2), (NOT p0)]
[2023-03-17 09:22:56] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 240 cols
[2023-03-17 09:22:56] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-17 09:22:57] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned unsat
Proved EG (NOT p2)
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p2) (NOT p0))), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 p1 p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2)))), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1 p2)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1) p2)), (F (AND (NOT p0) (NOT p1) p2)), (F (AND p0 p1)), (F (AND (NOT p0) p1)), (F (AND p1 p2)), (F p2), (F (AND p0 p2)), (F (AND (NOT p0) p2)), (F (AND p1 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND p0 p1 p2)), (F (AND (NOT p1) p2)), (F p0), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 31 factoid took 1633 ms. Reduced automaton from 15 states, 34 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Peterson-PT-3-LTLFireability-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-PT-3-LTLFireability-12 finished in 15936 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&(p1||G(p2)))))'
Support contains 6 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 4 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2023-03-17 09:22:59] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2023-03-17 09:22:59] [INFO ] Computed 15 place invariants in 2 ms
[2023-03-17 09:22:59] [INFO ] Implicit Places using invariants in 239 ms returned [230, 231, 232, 233]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 251 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 4 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 259 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 204 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (NOT p0)), (NOT p0)]
Running random walk in product with property : Peterson-PT-3-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1), acceptance={} source=2 dest: 4}], [{ cond=(OR (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p2), acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(AND (EQ s206 1) (EQ s227 1)), p1:(AND (EQ s116 1) (EQ s126 1) (EQ s201 1)), p2:(EQ s214 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-3-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-3-LTLFireability-13 finished in 490 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X(F(p1))))))'
Support contains 3 out of 244 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 0 with 95 rules applied. Total rules applied 95 place count 244 transition count 237
Reduce places removed 95 places and 0 transitions.
Iterating post reduction 1 with 95 rules applied. Total rules applied 190 place count 149 transition count 237
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 47 Pre rules applied. Total rules applied 190 place count 149 transition count 190
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 284 place count 102 transition count 190
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
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 306 place count 91 transition count 179
Applied a total of 306 rules in 21 ms. Remains 91 /244 variables (removed 153) and now considering 179/332 (removed 153) transitions.
[2023-03-17 09:22:59] [INFO ] Flow matrix only has 155 transitions (discarded 24 similar events)
// Phase 1: matrix 155 rows 91 cols
[2023-03-17 09:22:59] [INFO ] Computed 15 place invariants in 2 ms
[2023-03-17 09:22:59] [INFO ] Implicit Places using invariants in 148 ms returned [82, 83, 84, 85]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 150 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/244 places, 179/332 transitions.
Applied a total of 0 rules in 6 ms. Remains 87 /87 variables (removed 0) and now considering 179/179 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 179 ms. Remains : 87/244 places, 179/332 transitions.
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Peterson-PT-3-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s35 1), p1:(OR (EQ s49 0) (EQ s86 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 634 reset in 248 ms.
Stack based approach found an accepted trace after 835 steps with 5 reset with depth 151 and stack size 110 in 4 ms.
FORMULA Peterson-PT-3-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-3-LTLFireability-15 finished in 535 ms.
All properties solved by simple procedures.
Total runtime 61110 ms.

BK_STOP 1679044981051

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Peterson-PT-3"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is Peterson-PT-3, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r261-smll-167863536600612"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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