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.r265-smll-167863540300612.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 ltsminxred
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 r265-smll-167863540300612
=====================================================================

--------------------
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 1679132283737

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-3
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-18 09:38:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 09:38:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 09:38:06] [INFO ] Load time of PNML (sax parser for PT used): 94 ms
[2023-03-18 09:38:06] [INFO ] Transformed 244 places.
[2023-03-18 09:38:06] [INFO ] Transformed 332 transitions.
[2023-03-18 09:38:06] [INFO ] Found NUPN structural information;
[2023-03-18 09:38:06] [INFO ] Completing missing partition info from NUPN : creating a component with [TestAlone_1_2_3, TestAlone_2_2_3]
[2023-03-18 09:38:06] [INFO ] Parsed PT model containing 244 places and 332 transitions and 1016 arcs in 203 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 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 25 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2023-03-18 09:38:06] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2023-03-18 09:38:06] [INFO ] Computed 15 place invariants in 27 ms
[2023-03-18 09:38:07] [INFO ] Implicit Places using invariants in 328 ms returned []
[2023-03-18 09:38:07] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-18 09:38:07] [INFO ] Invariant cache hit.
[2023-03-18 09:38:07] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-18 09:38:07] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 688 ms to find 0 implicit places.
[2023-03-18 09:38:07] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-18 09:38:07] [INFO ] Invariant cache hit.
[2023-03-18 09:38:07] [INFO ] Dead Transitions using invariants and state equation in 422 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1137 ms. Remains : 244/244 places, 332/332 transitions.
Support contains 161 out of 244 places after structural reductions.
[2023-03-18 09:38:08] [INFO ] Flatten gal took : 81 ms
[2023-03-18 09:38:08] [INFO ] Flatten gal took : 35 ms
[2023-03-18 09:38:08] [INFO ] Input system was already deterministic with 332 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 683 ms. (steps per millisecond=14 ) properties (out of 27) seen :22
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) 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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-18 09:38:09] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-18 09:38:09] [INFO ] Invariant cache hit.
[2023-03-18 09:38:09] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2023-03-18 09:38:09] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-18 09:38:09] [INFO ] After 209ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-18 09:38:09] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2023-03-18 09:38:09] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-18 09:38:10] [INFO ] After 244ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-18 09:38:10] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-18 09:38:10] [INFO ] After 116ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-18 09:38:10] [INFO ] Deduced a trap composed of 46 places in 141 ms of which 7 ms to minimize.
[2023-03-18 09:38:10] [INFO ] Deduced a trap composed of 9 places in 155 ms of which 1 ms to minimize.
[2023-03-18 09:38:10] [INFO ] Deduced a trap composed of 45 places in 126 ms of which 1 ms to minimize.
[2023-03-18 09:38:10] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 2 ms to minimize.
[2023-03-18 09:38:10] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 2 ms to minimize.
[2023-03-18 09:38:11] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 1 ms to minimize.
[2023-03-18 09:38:11] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 0 ms to minimize.
[2023-03-18 09:38:11] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 1 ms to minimize.
[2023-03-18 09:38:11] [INFO ] Deduced a trap composed of 30 places in 105 ms of which 0 ms to minimize.
[2023-03-18 09:38:11] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 1 ms to minimize.
[2023-03-18 09:38:11] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 1 ms to minimize.
[2023-03-18 09:38:11] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 0 ms to minimize.
[2023-03-18 09:38:11] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 1 ms to minimize.
[2023-03-18 09:38:12] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 1 ms to minimize.
[2023-03-18 09:38:12] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1920 ms
[2023-03-18 09:38:12] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 1 ms to minimize.
[2023-03-18 09:38:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2023-03-18 09:38:12] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 1 ms to minimize.
[2023-03-18 09:38:12] [INFO ] Deduced a trap composed of 55 places in 85 ms of which 1 ms to minimize.
[2023-03-18 09:38:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 214 ms
[2023-03-18 09:38:12] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 0 ms to minimize.
[2023-03-18 09:38:12] [INFO ] Deduced a trap composed of 38 places in 86 ms of which 0 ms to minimize.
[2023-03-18 09:38:12] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 0 ms to minimize.
[2023-03-18 09:38:12] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 1 ms to minimize.
[2023-03-18 09:38:12] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 366 ms
[2023-03-18 09:38:12] [INFO ] After 2851ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 104 ms.
[2023-03-18 09:38:12] [INFO ] After 3377ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 33 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 43 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 43 ms. Remains : 128/244 places, 216/332 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Finished probabilistic random walk after 579781 steps, run visited all 5 properties in 1871 ms. (steps per millisecond=309 )
Probabilistic random walk after 579781 steps, saw 116100 distinct states, run finished after 1871 ms. (steps per millisecond=309 ) 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 19 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2023-03-18 09:38:15] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-18 09:38:15] [INFO ] Invariant cache hit.
[2023-03-18 09:38:15] [INFO ] Implicit Places using invariants in 164 ms returned [230, 231, 232, 233]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 166 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 16 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 202 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 228 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 1 ms.
FORMULA Peterson-PT-3-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-3-LTLFireability-00 finished in 503 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 5 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2023-03-18 09:38:16] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-18 09:38:16] [INFO ] Invariant cache hit.
[2023-03-18 09:38:16] [INFO ] Implicit Places using invariants in 129 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 5 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 143 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 146 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 569 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 97 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 1665 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-18 09:38:17] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-18 09:38:17] [INFO ] Invariant cache hit.
[2023-03-18 09:38:18] [INFO ] Implicit Places using invariants in 108 ms returned []
[2023-03-18 09:38:18] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-18 09:38:18] [INFO ] Invariant cache hit.
[2023-03-18 09:38:18] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-18 09:38:18] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
[2023-03-18 09:38:18] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-18 09:38:18] [INFO ] Invariant cache hit.
[2023-03-18 09:38:18] [INFO ] Dead Transitions using invariants and state equation in 343 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 752 ms. Remains : 244/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 333 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 10684 reset in 340 ms.
Stack based approach found an accepted trace after 992 steps with 113 reset with depth 19 and stack size 19 in 7 ms.
FORMULA Peterson-PT-3-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-3-LTLFireability-02 finished in 1456 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-18 09:38:19] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-18 09:38:19] [INFO ] Invariant cache hit.
[2023-03-18 09:38:19] [INFO ] Implicit Places using invariants in 159 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 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 171 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 204 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 6175 reset in 404 ms.
Stack based approach found an accepted trace after 681 steps with 38 reset with depth 19 and stack size 19 in 4 ms.
FORMULA Peterson-PT-3-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-3-LTLFireability-03 finished in 804 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-18 09:38:20] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-18 09:38:20] [INFO ] Invariant cache hit.
[2023-03-18 09:38:20] [INFO ] Implicit Places using invariants in 128 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 366 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 2 reset in 281 ms.
Product exploration explored 100000 steps with 8 reset in 342 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 602 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 354 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 185 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 55 ms. (steps per millisecond=181 ) properties (out of 2) 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 2) seen :0
Running SMT prover for 2 properties.
[2023-03-18 09:38:22] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 240 cols
[2023-03-18 09:38:22] [INFO ] Computed 11 place invariants in 4 ms
[2023-03-18 09:38:22] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 09:38:22] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2023-03-18 09:38:22] [INFO ] After 176ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 09:38:22] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-18 09:38:23] [INFO ] After 108ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-18 09:38:23] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 0 ms to minimize.
[2023-03-18 09:38:23] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 1 ms to minimize.
[2023-03-18 09:38:23] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 2 ms to minimize.
[2023-03-18 09:38:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 384 ms
[2023-03-18 09:38:23] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 1 ms to minimize.
[2023-03-18 09:38:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2023-03-18 09:38:23] [INFO ] After 715ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 81 ms.
[2023-03-18 09:38:23] [INFO ] After 1076ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 11 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 22 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 162 ms. (steps per millisecond=61 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Finished probabilistic random walk after 123203 steps, run visited all 2 properties in 531 ms. (steps per millisecond=232 )
Probabilistic random walk after 123203 steps, saw 24670 distinct states, run finished after 532 ms. (steps per millisecond=231 ) 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 739 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 353 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 341 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-18 09:38:25] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-18 09:38:26] [INFO ] Invariant cache hit.
[2023-03-18 09:38:26] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2023-03-18 09:38:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 09:38:26] [INFO ] [Real]Absence check using state equation in 188 ms returned sat
[2023-03-18 09:38:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 09:38:26] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2023-03-18 09:38:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 09:38:26] [INFO ] [Nat]Absence check using state equation in 192 ms returned sat
[2023-03-18 09:38:26] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-18 09:38:27] [INFO ] [Nat]Added 57 Read/Feed constraints in 17 ms returned sat
[2023-03-18 09:38:27] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 0 ms to minimize.
[2023-03-18 09:38:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2023-03-18 09:38:27] [INFO ] Computed and/alt/rep : 283/461/283 causal constraints (skipped 21 transitions) in 25 ms.
[2023-03-18 09:38:27] [INFO ] Added : 7 causal constraints over 2 iterations in 108 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 3 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2023-03-18 09:38:27] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-18 09:38:27] [INFO ] Invariant cache hit.
[2023-03-18 09:38:27] [INFO ] Implicit Places using invariants in 160 ms returned []
[2023-03-18 09:38:27] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-18 09:38:27] [INFO ] Invariant cache hit.
[2023-03-18 09:38:27] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-18 09:38:27] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 502 ms to find 0 implicit places.
[2023-03-18 09:38:27] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-18 09:38:27] [INFO ] Invariant cache hit.
[2023-03-18 09:38:28] [INFO ] Dead Transitions using invariants and state equation in 284 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 790 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 592 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 349 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 121 ms. (steps per millisecond=82 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-18 09:38:29] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-18 09:38:29] [INFO ] Invariant cache hit.
[2023-03-18 09:38:29] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 09:38:29] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-18 09:38:29] [INFO ] After 195ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 09:38:29] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-18 09:38:29] [INFO ] After 94ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-18 09:38:29] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 1 ms to minimize.
[2023-03-18 09:38:30] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 1 ms to minimize.
[2023-03-18 09:38:30] [INFO ] Deduced a trap composed of 51 places in 95 ms of which 1 ms to minimize.
[2023-03-18 09:38:30] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 1 ms to minimize.
[2023-03-18 09:38:30] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 1 ms to minimize.
[2023-03-18 09:38:30] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 1 ms to minimize.
[2023-03-18 09:38:30] [INFO ] Deduced a trap composed of 48 places in 74 ms of which 3 ms to minimize.
[2023-03-18 09:38:30] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 0 ms to minimize.
[2023-03-18 09:38:30] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 1 ms to minimize.
[2023-03-18 09:38:30] [INFO ] Deduced a trap composed of 49 places in 64 ms of which 0 ms to minimize.
[2023-03-18 09:38:30] [INFO ] Deduced a trap composed of 49 places in 58 ms of which 0 ms to minimize.
[2023-03-18 09:38:31] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 1 ms to minimize.
[2023-03-18 09:38:31] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1356 ms
[2023-03-18 09:38:31] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 0 ms to minimize.
[2023-03-18 09:38:31] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 0 ms to minimize.
[2023-03-18 09:38:31] [INFO ] Deduced a trap composed of 45 places in 90 ms of which 1 ms to minimize.
[2023-03-18 09:38:31] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 1 ms to minimize.
[2023-03-18 09:38:31] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 1 ms to minimize.
[2023-03-18 09:38:31] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 606 ms
[2023-03-18 09:38:31] [INFO ] After 2171ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 112 ms.
[2023-03-18 09:38:31] [INFO ] After 2584ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 392 steps, including 114 resets, run visited all 2 properties in 9 ms. (steps per millisecond=43 )
Parikh walk visited 2 properties in 9 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 709 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 335 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 345 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-18 09:38:33] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-18 09:38:33] [INFO ] Invariant cache hit.
[2023-03-18 09:38:33] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2023-03-18 09:38:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 09:38:33] [INFO ] [Real]Absence check using state equation in 192 ms returned sat
[2023-03-18 09:38:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 09:38:34] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2023-03-18 09:38:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 09:38:34] [INFO ] [Nat]Absence check using state equation in 191 ms returned sat
[2023-03-18 09:38:34] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-18 09:38:34] [INFO ] [Nat]Added 57 Read/Feed constraints in 16 ms returned sat
[2023-03-18 09:38:34] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2023-03-18 09:38:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2023-03-18 09:38:34] [INFO ] Computed and/alt/rep : 283/461/283 causal constraints (skipped 21 transitions) in 25 ms.
[2023-03-18 09:38:34] [INFO ] Added : 7 causal constraints over 2 iterations in 106 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 349 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 278 ms.
Product exploration explored 100000 steps with 1 reset in 325 ms.
Applying partial POR strategy [false, false, false, true, true, true, false, false, true, true]
Stuttering acceptance computed with spot in 331 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 1 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 42 ms. Remains 195 /240 variables (removed 45) and now considering 305/332 (removed 27) transitions.
[2023-03-18 09:38:36] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-18 09:38:36] [INFO ] Flow matrix only has 281 transitions (discarded 24 similar events)
// Phase 1: matrix 281 rows 195 cols
[2023-03-18 09:38:36] [INFO ] Computed 11 place invariants in 3 ms
[2023-03-18 09:38:36] [INFO ] Dead Transitions using invariants and state equation in 228 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 297 ms. Remains : 195/240 places, 305/332 transitions.
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 4 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2023-03-18 09:38:36] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 240 cols
[2023-03-18 09:38:36] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-18 09:38:36] [INFO ] Implicit Places using invariants in 135 ms returned []
[2023-03-18 09:38:36] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-18 09:38:36] [INFO ] Invariant cache hit.
[2023-03-18 09:38:36] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-18 09:38:37] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 512 ms to find 0 implicit places.
[2023-03-18 09:38:37] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-18 09:38:37] [INFO ] Invariant cache hit.
[2023-03-18 09:38:37] [INFO ] Dead Transitions using invariants and state equation in 275 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 793 ms. Remains : 240/240 places, 332/332 transitions.
Treatment of property Peterson-PT-3-LTLFireability-04 finished in 17320 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 3 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2023-03-18 09:38:37] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2023-03-18 09:38:37] [INFO ] Computed 15 place invariants in 2 ms
[2023-03-18 09:38:37] [INFO ] Implicit Places using invariants in 151 ms returned [230, 231, 232, 233]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 153 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 161 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 87 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 64 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-3-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-3-LTLFireability-06 finished in 266 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 3 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2023-03-18 09:38:37] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-18 09:38:37] [INFO ] Invariant cache hit.
[2023-03-18 09:38:37] [INFO ] Implicit Places using invariants in 139 ms returned [230, 231, 232, 233]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 141 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 148 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 126 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 0 ms.
FORMULA Peterson-PT-3-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-3-LTLFireability-07 finished in 290 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 23 ms. Remains 92 /244 variables (removed 152) and now considering 180/332 (removed 152) transitions.
[2023-03-18 09:38:38] [INFO ] Flow matrix only has 156 transitions (discarded 24 similar events)
// Phase 1: matrix 156 rows 92 cols
[2023-03-18 09:38:38] [INFO ] Computed 15 place invariants in 2 ms
[2023-03-18 09:38:38] [INFO ] Implicit Places using invariants in 101 ms returned [84, 85, 86, 87]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 104 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 7 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 134 ms. Remains : 88/244 places, 180/332 transitions.
Stuttering acceptance computed with spot in 113 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 1 reset in 126 ms.
Stack based approach found an accepted trace after 17 steps with 0 reset with depth 18 and stack size 18 in 0 ms.
FORMULA Peterson-PT-3-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-3-LTLFireability-08 finished in 388 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 19 ms. Remains 88 /244 variables (removed 156) and now considering 176/332 (removed 156) transitions.
[2023-03-18 09:38:38] [INFO ] Flow matrix only has 152 transitions (discarded 24 similar events)
// Phase 1: matrix 152 rows 88 cols
[2023-03-18 09:38:38] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-18 09:38:38] [INFO ] Implicit Places using invariants in 129 ms returned [81, 82, 83, 84]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 130 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 5 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 154 ms. Remains : 84/244 places, 176/332 transitions.
Stuttering acceptance computed with spot in 35 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 136 ms.
Stack based approach found an accepted trace after 10 steps with 0 reset with depth 11 and stack size 11 in 0 ms.
FORMULA Peterson-PT-3-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-3-LTLFireability-09 finished in 338 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 2 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2023-03-18 09:38:38] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2023-03-18 09:38:38] [INFO ] Computed 15 place invariants in 2 ms
[2023-03-18 09:38:38] [INFO ] Implicit Places using invariants in 183 ms returned [230, 231, 232, 233]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 184 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 190 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 80 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 283 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 2 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2023-03-18 09:38:39] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-18 09:38:39] [INFO ] Invariant cache hit.
[2023-03-18 09:38:39] [INFO ] Implicit Places using invariants in 175 ms returned [230, 231, 232, 233]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 176 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 182 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 190 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 132 ms.
Stack based approach found an accepted trace after 306 steps with 0 reset with depth 307 and stack size 307 in 1 ms.
FORMULA Peterson-PT-3-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-3-LTLFireability-11 finished in 524 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 3 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2023-03-18 09:38:39] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-18 09:38:39] [INFO ] Invariant cache hit.
[2023-03-18 09:38:39] [INFO ] Implicit Places using invariants in 168 ms returned [230, 231, 232, 233]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 169 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 175 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 540 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 25014 reset in 302 ms.
Stack based approach found an accepted trace after 10676 steps with 2660 reset with depth 7 and stack size 7 in 40 ms.
FORMULA Peterson-PT-3-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-3-LTLFireability-12 finished in 1083 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 2 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2023-03-18 09:38:40] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-18 09:38:40] [INFO ] Invariant cache hit.
[2023-03-18 09:38:40] [INFO ] Implicit Places using invariants in 170 ms returned [230, 231, 232, 233]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 172 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 176 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 163 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 358 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 14 ms. Remains 91 /244 variables (removed 153) and now considering 179/332 (removed 153) transitions.
[2023-03-18 09:38:41] [INFO ] Flow matrix only has 155 transitions (discarded 24 similar events)
// Phase 1: matrix 155 rows 91 cols
[2023-03-18 09:38:41] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-18 09:38:41] [INFO ] Implicit Places using invariants in 132 ms returned [82, 83, 84, 85]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 133 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 4 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 153 ms. Remains : 87/244 places, 179/332 transitions.
Stuttering acceptance computed with spot in 70 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 670 reset in 145 ms.
Stack based approach found an accepted trace after 763 steps with 3 reset with depth 174 and stack size 141 in 2 ms.
FORMULA Peterson-PT-3-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-3-LTLFireability-15 finished in 387 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))))))'
Found a Lengthening insensitive property : Peterson-PT-3-LTLFireability-04
Stuttering acceptance computed with spot in 330 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 244 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 244/244 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 244 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 181 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 172 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 172 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 124 transition count 212
Applied a total of 240 rules in 12 ms. Remains 124 /244 variables (removed 120) and now considering 212/332 (removed 120) transitions.
[2023-03-18 09:38:41] [INFO ] Flow matrix only has 188 transitions (discarded 24 similar events)
// Phase 1: matrix 188 rows 124 cols
[2023-03-18 09:38:41] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-18 09:38:41] [INFO ] Implicit Places using invariants in 110 ms returned [117, 118, 119, 120]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 111 ms to find 4 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 120/244 places, 212/332 transitions.
Applied a total of 0 rules in 3 ms. Remains 120 /120 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 128 ms. Remains : 120/244 places, 212/332 transitions.
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 s92 1) (EQ s117 1)) (AND (EQ s79 1) (EQ s103 1)) (AND (EQ s78 1) (EQ s108 1)) (AND (EQ s81 1) (EQ s106 1)) (AND (EQ s93 1) (EQ s105 1)) (A...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], 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 283 ms.
Product exploration explored 100000 steps with 6 reset in 308 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 584 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 337 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 152 ms. (steps per millisecond=65 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) 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-18 09:38:43] [INFO ] Flow matrix only has 188 transitions (discarded 24 similar events)
// Phase 1: matrix 188 rows 120 cols
[2023-03-18 09:38:43] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-18 09:38:43] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 09:38:43] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-18 09:38:43] [INFO ] After 118ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 09:38:43] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-18 09:38:44] [INFO ] After 63ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-18 09:38:44] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 0 ms to minimize.
[2023-03-18 09:38:44] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2023-03-18 09:38:44] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 0 ms to minimize.
[2023-03-18 09:38:44] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2023-03-18 09:38:44] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 0 ms to minimize.
[2023-03-18 09:38:44] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 0 ms to minimize.
[2023-03-18 09:38:44] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 369 ms
[2023-03-18 09:38:44] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 0 ms to minimize.
[2023-03-18 09:38:44] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2023-03-18 09:38:44] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 0 ms to minimize.
[2023-03-18 09:38:44] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2023-03-18 09:38:44] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 0 ms to minimize.
[2023-03-18 09:38:44] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2023-03-18 09:38:44] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 0 ms to minimize.
[2023-03-18 09:38:44] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2023-03-18 09:38:44] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 502 ms
[2023-03-18 09:38:44] [INFO ] After 994ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 67 ms.
[2023-03-18 09:38:45] [INFO ] After 1240ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 8 ms.
Support contains 48 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 212/212 transitions.
Applied a total of 0 rules in 5 ms. Remains 120 /120 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 120/120 places, 212/212 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Finished probabilistic random walk after 123203 steps, run visited all 2 properties in 501 ms. (steps per millisecond=245 )
Probabilistic random walk after 123203 steps, saw 24670 distinct states, run finished after 502 ms. (steps per millisecond=245 ) 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 801 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 333 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 337 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-18 09:38:47] [INFO ] Flow matrix only has 188 transitions (discarded 24 similar events)
[2023-03-18 09:38:47] [INFO ] Invariant cache hit.
[2023-03-18 09:38:47] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-18 09:38:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 09:38:47] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2023-03-18 09:38:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 09:38:47] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-03-18 09:38:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 09:38:47] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2023-03-18 09:38:47] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-18 09:38:47] [INFO ] [Nat]Added 57 Read/Feed constraints in 13 ms returned sat
[2023-03-18 09:38:47] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 0 ms to minimize.
[2023-03-18 09:38:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2023-03-18 09:38:47] [INFO ] Computed and/alt/rep : 163/365/163 causal constraints (skipped 21 transitions) in 17 ms.
[2023-03-18 09:38:48] [INFO ] Added : 69 causal constraints over 14 iterations in 255 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 48 out of 120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 212/212 transitions.
Applied a total of 0 rules in 1 ms. Remains 120 /120 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2023-03-18 09:38:48] [INFO ] Flow matrix only has 188 transitions (discarded 24 similar events)
[2023-03-18 09:38:48] [INFO ] Invariant cache hit.
[2023-03-18 09:38:48] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-18 09:38:48] [INFO ] Flow matrix only has 188 transitions (discarded 24 similar events)
[2023-03-18 09:38:48] [INFO ] Invariant cache hit.
[2023-03-18 09:38:48] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-18 09:38:48] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
[2023-03-18 09:38:48] [INFO ] Flow matrix only has 188 transitions (discarded 24 similar events)
[2023-03-18 09:38:48] [INFO ] Invariant cache hit.
[2023-03-18 09:38:48] [INFO ] Dead Transitions using invariants and state equation in 178 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 493 ms. Remains : 120/120 places, 212/212 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 574 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 327 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 155 ms. (steps per millisecond=64 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-18 09:38:49] [INFO ] Flow matrix only has 188 transitions (discarded 24 similar events)
[2023-03-18 09:38:49] [INFO ] Invariant cache hit.
[2023-03-18 09:38:49] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 09:38:49] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-03-18 09:38:50] [INFO ] After 116ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 09:38:50] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-18 09:38:50] [INFO ] After 65ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-18 09:38:50] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 0 ms to minimize.
[2023-03-18 09:38:50] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 0 ms to minimize.
[2023-03-18 09:38:50] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 3 ms to minimize.
[2023-03-18 09:38:50] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 0 ms to minimize.
[2023-03-18 09:38:50] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2023-03-18 09:38:50] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2023-03-18 09:38:50] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 0 ms to minimize.
[2023-03-18 09:38:50] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2023-03-18 09:38:50] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2023-03-18 09:38:50] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 515 ms
[2023-03-18 09:38:50] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2023-03-18 09:38:50] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 0 ms to minimize.
[2023-03-18 09:38:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 137 ms
[2023-03-18 09:38:50] [INFO ] After 780ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 68 ms.
[2023-03-18 09:38:50] [INFO ] After 1030ms 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 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 212/212 transitions.
Applied a total of 0 rules in 5 ms. Remains 120 /120 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 120/120 places, 212/212 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) 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
Finished probabilistic random walk after 123203 steps, run visited all 2 properties in 549 ms. (steps per millisecond=224 )
Probabilistic random walk after 123203 steps, saw 24670 distinct states, run finished after 549 ms. (steps per millisecond=224 ) 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 691 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 329 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 340 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-18 09:38:53] [INFO ] Flow matrix only has 188 transitions (discarded 24 similar events)
[2023-03-18 09:38:53] [INFO ] Invariant cache hit.
[2023-03-18 09:38:53] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-18 09:38:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 09:38:53] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2023-03-18 09:38:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 09:38:53] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-18 09:38:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 09:38:53] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2023-03-18 09:38:53] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-18 09:38:53] [INFO ] [Nat]Added 57 Read/Feed constraints in 13 ms returned sat
[2023-03-18 09:38:53] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 0 ms to minimize.
[2023-03-18 09:38:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2023-03-18 09:38:53] [INFO ] Computed and/alt/rep : 163/365/163 causal constraints (skipped 21 transitions) in 14 ms.
[2023-03-18 09:38:54] [INFO ] Added : 69 causal constraints over 14 iterations in 254 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 340 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 0 reset in 276 ms.
Product exploration explored 100000 steps with 1 reset in 294 ms.
Applying partial POR strategy [false, false, false, true, true, true, false, false, true, true]
Stuttering acceptance computed with spot in 329 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 120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 120/120 places, 212/212 transitions.
Applied a total of 0 rules in 8 ms. Remains 120 /120 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2023-03-18 09:38:55] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-18 09:38:55] [INFO ] Flow matrix only has 188 transitions (discarded 24 similar events)
[2023-03-18 09:38:55] [INFO ] Invariant cache hit.
[2023-03-18 09:38:55] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 190 ms. Remains : 120/120 places, 212/212 transitions.
Support contains 48 out of 120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 212/212 transitions.
Applied a total of 0 rules in 1 ms. Remains 120 /120 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2023-03-18 09:38:55] [INFO ] Flow matrix only has 188 transitions (discarded 24 similar events)
[2023-03-18 09:38:55] [INFO ] Invariant cache hit.
[2023-03-18 09:38:55] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-03-18 09:38:55] [INFO ] Flow matrix only has 188 transitions (discarded 24 similar events)
[2023-03-18 09:38:55] [INFO ] Invariant cache hit.
[2023-03-18 09:38:55] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-18 09:38:55] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
[2023-03-18 09:38:55] [INFO ] Flow matrix only has 188 transitions (discarded 24 similar events)
[2023-03-18 09:38:55] [INFO ] Invariant cache hit.
[2023-03-18 09:38:56] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 449 ms. Remains : 120/120 places, 212/212 transitions.
Treatment of property Peterson-PT-3-LTLFireability-04 finished in 14670 ms.
[2023-03-18 09:38:56] [INFO ] Flatten gal took : 25 ms
[2023-03-18 09:38:56] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2023-03-18 09:38:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 244 places, 332 transitions and 1016 arcs took 3 ms.
Total runtime 49840 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2177/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : Peterson-PT-3-LTLFireability-04

BK_STOP 1679132909449

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name Peterson-PT-3-LTLFireability-04
ltl formula formula --ltl=/tmp/2177/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 244 places, 332 transitions and 1016 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.010 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2177/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2177/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2177/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2177/ltl_0_

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="ltsminxred"
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 ltsminxred"
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 r265-smll-167863540300612"
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 ;