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.r521-tall-167987246100020.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 Anderson-PT-06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r521-tall-167987246100020
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 764K
-rw-r--r-- 1 mcc users 5.7K Mar 23 15:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K Mar 23 15:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Mar 23 15:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 23 15:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 23 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 23 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 14K Mar 23 15:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Mar 23 15:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 23 15:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Mar 23 15:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 23 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 23 07:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 302K Mar 31 16:48 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 Anderson-PT-06-LTLFireability-00
FORMULA_NAME Anderson-PT-06-LTLFireability-01
FORMULA_NAME Anderson-PT-06-LTLFireability-02
FORMULA_NAME Anderson-PT-06-LTLFireability-03
FORMULA_NAME Anderson-PT-06-LTLFireability-04
FORMULA_NAME Anderson-PT-06-LTLFireability-05
FORMULA_NAME Anderson-PT-06-LTLFireability-06
FORMULA_NAME Anderson-PT-06-LTLFireability-07
FORMULA_NAME Anderson-PT-06-LTLFireability-08
FORMULA_NAME Anderson-PT-06-LTLFireability-09
FORMULA_NAME Anderson-PT-06-LTLFireability-10
FORMULA_NAME Anderson-PT-06-LTLFireability-11
FORMULA_NAME Anderson-PT-06-LTLFireability-12
FORMULA_NAME Anderson-PT-06-LTLFireability-13
FORMULA_NAME Anderson-PT-06-LTLFireability-14
FORMULA_NAME Anderson-PT-06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1680856463679

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=Anderson-PT-06
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-07 08:34:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-07 08:34:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 08:34:25] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2023-04-07 08:34:25] [INFO ] Transformed 229 places.
[2023-04-07 08:34:25] [INFO ] Transformed 600 transitions.
[2023-04-07 08:34:25] [INFO ] Found NUPN structural information;
[2023-04-07 08:34:25] [INFO ] Parsed PT model containing 229 places and 600 transitions and 2280 arcs in 211 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Anderson-PT-06-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-06-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-06-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-06-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 229 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 600/600 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 188 transition count 419
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 188 transition count 419
Applied a total of 82 rules in 41 ms. Remains 188 /229 variables (removed 41) and now considering 419/600 (removed 181) transitions.
// Phase 1: matrix 419 rows 188 cols
[2023-04-07 08:34:25] [INFO ] Computed 15 invariants in 33 ms
[2023-04-07 08:34:26] [INFO ] Implicit Places using invariants in 306 ms returned []
[2023-04-07 08:34:26] [INFO ] Invariant cache hit.
[2023-04-07 08:34:26] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-04-07 08:34:26] [INFO ] Implicit Places using invariants and state equation in 795 ms returned []
Implicit Place search using SMT with State Equation took 1127 ms to find 0 implicit places.
[2023-04-07 08:34:26] [INFO ] Invariant cache hit.
[2023-04-07 08:34:27] [INFO ] Dead Transitions using invariants and state equation in 202 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 188/229 places, 419/600 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1374 ms. Remains : 188/229 places, 419/600 transitions.
Support contains 37 out of 188 places after structural reductions.
[2023-04-07 08:34:27] [INFO ] Flatten gal took : 72 ms
[2023-04-07 08:34:27] [INFO ] Flatten gal took : 32 ms
[2023-04-07 08:34:27] [INFO ] Input system was already deterministic with 419 transitions.
Support contains 36 out of 188 places (down from 37) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 363 ms. (steps per millisecond=27 ) properties (out of 29) seen :14
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 11) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-04-07 08:34:28] [INFO ] Invariant cache hit.
[2023-04-07 08:34:28] [INFO ] [Real]Absence check using 7 positive place invariants in 14 ms returned sat
[2023-04-07 08:34:28] [INFO ] [Real]Absence check using 7 positive and 8 generalized place invariants in 18 ms returned sat
[2023-04-07 08:34:28] [INFO ] After 579ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-04-07 08:34:28] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-04-07 08:34:28] [INFO ] [Nat]Absence check using 7 positive and 8 generalized place invariants in 23 ms returned sat
[2023-04-07 08:34:29] [INFO ] After 423ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-04-07 08:34:29] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-04-07 08:34:29] [INFO ] After 320ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-04-07 08:34:30] [INFO ] After 677ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 234 ms.
[2023-04-07 08:34:30] [INFO ] After 1647ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 1 properties in 59 ms.
Support contains 8 out of 188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 419/419 transitions.
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 30 Pre rules applied. Total rules applied 0 place count 188 transition count 389
Deduced a syphon composed of 30 places in 2 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 0 with 60 rules applied. Total rules applied 60 place count 158 transition count 389
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 74 place count 144 transition count 265
Iterating global reduction 0 with 14 rules applied. Total rules applied 88 place count 144 transition count 265
Applied a total of 88 rules in 40 ms. Remains 144 /188 variables (removed 44) and now considering 265/419 (removed 154) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 144/188 places, 265/419 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 265 rows 144 cols
[2023-04-07 08:34:30] [INFO ] Computed 15 invariants in 15 ms
[2023-04-07 08:34:30] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-04-07 08:34:30] [INFO ] [Real]Absence check using 7 positive and 8 generalized place invariants in 7 ms returned sat
[2023-04-07 08:34:31] [INFO ] After 291ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-07 08:34:31] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-04-07 08:34:31] [INFO ] [Nat]Absence check using 7 positive and 8 generalized place invariants in 8 ms returned sat
[2023-04-07 08:34:31] [INFO ] After 123ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-07 08:34:31] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-04-07 08:34:31] [INFO ] After 77ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-07 08:34:31] [INFO ] After 149ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 55 ms.
[2023-04-07 08:34:31] [INFO ] After 411ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 10 ms.
Support contains 3 out of 144 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 144/144 places, 265/265 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 141 transition count 232
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 141 transition count 232
Applied a total of 6 rules in 12 ms. Remains 141 /144 variables (removed 3) and now considering 232/265 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 141/144 places, 232/265 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
// Phase 1: matrix 232 rows 141 cols
[2023-04-07 08:34:31] [INFO ] Computed 15 invariants in 5 ms
[2023-04-07 08:34:31] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-04-07 08:34:31] [INFO ] [Real]Absence check using 8 positive and 7 generalized place invariants in 8 ms returned sat
[2023-04-07 08:34:32] [INFO ] After 220ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 08:34:32] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2023-04-07 08:34:32] [INFO ] [Nat]Absence check using 8 positive and 7 generalized place invariants in 20 ms returned sat
[2023-04-07 08:34:32] [INFO ] After 85ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 08:34:32] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-04-07 08:34:32] [INFO ] After 36ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 08:34:32] [INFO ] After 68ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-04-07 08:34:32] [INFO ] After 246ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 141 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 141/141 places, 232/232 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 140 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 140 transition count 221
Applied a total of 2 rules in 14 ms. Remains 140 /141 variables (removed 1) and now considering 221/232 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 140/141 places, 221/232 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 42656 steps, run visited all 1 properties in 194 ms. (steps per millisecond=219 )
Probabilistic random walk after 42656 steps, saw 24309 distinct states, run finished after 194 ms. (steps per millisecond=219 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
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.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(X(p1))))'
Support contains 4 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 419/419 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 170 transition count 251
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 170 transition count 251
Applied a total of 36 rules in 8 ms. Remains 170 /188 variables (removed 18) and now considering 251/419 (removed 168) transitions.
// Phase 1: matrix 251 rows 170 cols
[2023-04-07 08:34:33] [INFO ] Computed 15 invariants in 2 ms
[2023-04-07 08:34:33] [INFO ] Implicit Places using invariants in 221 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 224 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 169/188 places, 251/419 transitions.
Applied a total of 0 rules in 2 ms. Remains 169 /169 variables (removed 0) and now considering 251/251 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 236 ms. Remains : 169/188 places, 251/419 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 390 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : Anderson-PT-06-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=true, acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(NOT p1), acceptance={} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s14 1) (EQ s30 1)), p1:(AND (EQ s9 1) (EQ s22 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 14 reset in 213 ms.
Stack based approach found an accepted trace after 49 steps with 0 reset with depth 50 and stack size 50 in 1 ms.
FORMULA Anderson-PT-06-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-06-LTLFireability-00 finished in 889 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 188/188 places, 419/419 transitions.
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 30 Pre rules applied. Total rules applied 0 place count 188 transition count 389
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 0 with 60 rules applied. Total rules applied 60 place count 158 transition count 389
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 78 place count 140 transition count 221
Iterating global reduction 0 with 18 rules applied. Total rules applied 96 place count 140 transition count 221
Applied a total of 96 rules in 48 ms. Remains 140 /188 variables (removed 48) and now considering 221/419 (removed 198) transitions.
// Phase 1: matrix 221 rows 140 cols
[2023-04-07 08:34:33] [INFO ] Computed 15 invariants in 3 ms
[2023-04-07 08:34:34] [INFO ] Implicit Places using invariants in 201 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 203 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 139/188 places, 221/419 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 139 transition count 186
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 104 transition count 186
Applied a total of 70 rules in 9 ms. Remains 104 /139 variables (removed 35) and now considering 186/221 (removed 35) transitions.
// Phase 1: matrix 186 rows 104 cols
[2023-04-07 08:34:34] [INFO ] Computed 14 invariants in 3 ms
[2023-04-07 08:34:34] [INFO ] Implicit Places using invariants in 173 ms returned []
[2023-04-07 08:34:34] [INFO ] Invariant cache hit.
[2023-04-07 08:34:34] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-04-07 08:34:34] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 104/188 places, 186/419 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 607 ms. Remains : 104/188 places, 186/419 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-06-LTLFireability-01 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 s13 1) (EQ s19 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 158 ms.
Stack based approach found an accepted trace after 23 steps with 0 reset with depth 24 and stack size 24 in 0 ms.
FORMULA Anderson-PT-06-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-06-LTLFireability-01 finished in 852 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(F(!(p0 U (X(p0) U !p1)))))))'
Support contains 4 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 419/419 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 170 transition count 251
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 170 transition count 251
Applied a total of 36 rules in 9 ms. Remains 170 /188 variables (removed 18) and now considering 251/419 (removed 168) transitions.
// Phase 1: matrix 251 rows 170 cols
[2023-04-07 08:34:34] [INFO ] Computed 15 invariants in 2 ms
[2023-04-07 08:34:35] [INFO ] Implicit Places using invariants in 448 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 451 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 169/188 places, 251/419 transitions.
Applied a total of 0 rules in 3 ms. Remains 169 /169 variables (removed 0) and now considering 251/251 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 464 ms. Remains : 169/188 places, 251/419 transitions.
Stuttering acceptance computed with spot in 169 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1))]
Running random walk in product with property : Anderson-PT-06-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p1), acceptance={1} source=1 dest: 1}, { cond=(NOT p1), acceptance={0, 1} source=1 dest: 1}, { cond=p1, acceptance={0, 1} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s15 1) (EQ s23 1)), p1:(AND (EQ s0 1) (EQ s72 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 85 reset in 142 ms.
Stack based approach found an accepted trace after 58 steps with 0 reset with depth 59 and stack size 59 in 1 ms.
FORMULA Anderson-PT-06-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-06-LTLFireability-02 finished in 826 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U (p1||F(p2)))||X((p3||G(F(p4))))))'
Support contains 10 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 419/419 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 173 transition count 284
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 173 transition count 284
Applied a total of 30 rules in 4 ms. Remains 173 /188 variables (removed 15) and now considering 284/419 (removed 135) transitions.
// Phase 1: matrix 284 rows 173 cols
[2023-04-07 08:34:35] [INFO ] Computed 15 invariants in 3 ms
[2023-04-07 08:34:35] [INFO ] Implicit Places using invariants in 142 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 157 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 172/188 places, 284/419 transitions.
Applied a total of 0 rules in 2 ms. Remains 172 /172 variables (removed 0) and now considering 284/284 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 163 ms. Remains : 172/188 places, 284/419 transitions.
Stuttering acceptance computed with spot in 469 ms :[(AND (NOT p1) (NOT p2) (NOT p3) (NOT p4)), (AND (NOT p2) (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4)), (AND (NOT p2) (NOT p4)), (AND (NOT p2) (NOT p4)), (AND (NOT p1) (NOT p2) (NOT p4)), (AND (NOT p1) (NOT p2) (NOT p4))]
Running random walk in product with property : Anderson-PT-06-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p3) (NOT p4)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p0) (NOT p3) (NOT p4)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p0 (NOT p3)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p1) (NOT p2) p0 (NOT p3) (NOT p4)), acceptance={} source=2 dest: 6}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p4)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p4)), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p0) (NOT p4)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p2) p0 (NOT p4)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0) (NOT p4)), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p0 (NOT p4)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(AND (EQ s16 1) (EQ s26 1)), p2:(AND (EQ s9 1) (EQ s20 1)), p0:(AND (EQ s15 1) (EQ s51 1)), p3:(AND (EQ s12 1) (EQ s27 1)), p4:(AND (EQ s6 1) (EQ s19 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 6 reset in 118 ms.
Stack based approach found an accepted trace after 45 steps with 0 reset with depth 46 and stack size 46 in 0 ms.
FORMULA Anderson-PT-06-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-06-LTLFireability-03 finished in 781 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X((p1||G((p0||(p0 U p2)))))))'
Support contains 6 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 419/419 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 172 transition count 273
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 172 transition count 273
Applied a total of 32 rules in 5 ms. Remains 172 /188 variables (removed 16) and now considering 273/419 (removed 146) transitions.
// Phase 1: matrix 273 rows 172 cols
[2023-04-07 08:34:36] [INFO ] Computed 15 invariants in 4 ms
[2023-04-07 08:34:36] [INFO ] Implicit Places using invariants in 119 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 120 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 171/188 places, 273/419 transitions.
Applied a total of 0 rules in 4 ms. Remains 171 /171 variables (removed 0) and now considering 273/273 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 129 ms. Remains : 171/188 places, 273/419 transitions.
Stuttering acceptance computed with spot in 172 ms :[(NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Anderson-PT-06-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (EQ s15 1) (EQ s24 1)), p1:(AND (EQ s7 1) (EQ s20 1)), p2:(AND (EQ s9 1) (EQ s26 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 107 ms.
Stack based approach found an accepted trace after 42 steps with 0 reset with depth 43 and stack size 43 in 1 ms.
FORMULA Anderson-PT-06-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-06-LTLFireability-04 finished in 433 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)&&((!p0 U (G(!p0)||(!p0&&G(!p3))))||p2))))'
Support contains 6 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 419/419 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 171 transition count 262
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 171 transition count 262
Applied a total of 34 rules in 9 ms. Remains 171 /188 variables (removed 17) and now considering 262/419 (removed 157) transitions.
// Phase 1: matrix 262 rows 171 cols
[2023-04-07 08:34:36] [INFO ] Computed 15 invariants in 1 ms
[2023-04-07 08:34:36] [INFO ] Implicit Places using invariants in 131 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 135 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/188 places, 262/419 transitions.
Applied a total of 0 rules in 3 ms. Remains 170 /170 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 147 ms. Remains : 170/188 places, 262/419 transitions.
Stuttering acceptance computed with spot in 221 ms :[true, (NOT p1), (OR (NOT p1) (AND p0 (NOT p2))), (OR (NOT p1) (AND p0 (NOT p2))), p0, p3, (AND p0 p3)]
Running random walk in product with property : Anderson-PT-06-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND p0 (NOT p2))), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2) p3), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=3 dest: 6}], [{ cond=p0, acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p3), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=4 dest: 6}], [{ cond=p3, acceptance={} source=5 dest: 0}, { cond=(NOT p3), acceptance={} source=5 dest: 5}], [{ cond=(AND p0 p3), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p0) p3), acceptance={} source=6 dest: 4}, { cond=(AND p0 (NOT p3)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=6 dest: 6}]], initial=2, aps=[p1:(AND (EQ s13 1) (EQ s21 1)), p0:(AND (EQ s14 1) (EQ s19 1)), p2:(OR (EQ s13 0) (EQ s21 0)), p3:(AND (EQ s0 1) (EQ s67 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Anderson-PT-06-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-06-LTLFireability-05 finished in 393 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 4 out of 188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 188/188 places, 419/419 transitions.
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 30 Pre rules applied. Total rules applied 0 place count 188 transition count 389
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 0 with 60 rules applied. Total rules applied 60 place count 158 transition count 389
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 77 place count 141 transition count 232
Iterating global reduction 0 with 17 rules applied. Total rules applied 94 place count 141 transition count 232
Applied a total of 94 rules in 17 ms. Remains 141 /188 variables (removed 47) and now considering 232/419 (removed 187) transitions.
// Phase 1: matrix 232 rows 141 cols
[2023-04-07 08:34:37] [INFO ] Computed 15 invariants in 1 ms
[2023-04-07 08:34:37] [INFO ] Implicit Places using invariants in 400 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 401 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 140/188 places, 232/419 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 140 transition count 198
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 106 transition count 198
Applied a total of 68 rules in 8 ms. Remains 106 /140 variables (removed 34) and now considering 198/232 (removed 34) transitions.
// Phase 1: matrix 198 rows 106 cols
[2023-04-07 08:34:37] [INFO ] Computed 14 invariants in 3 ms
[2023-04-07 08:34:37] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-04-07 08:34:37] [INFO ] Invariant cache hit.
[2023-04-07 08:34:37] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-04-07 08:34:37] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 106/188 places, 198/419 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 711 ms. Remains : 106/188 places, 198/419 transitions.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Anderson-PT-06-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s13 1) (EQ s22 1)), p0:(AND (EQ s9 1) (EQ s24 1))], 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 10 reset in 117 ms.
Stack based approach found an accepted trace after 40 steps with 0 reset with depth 41 and stack size 41 in 0 ms.
FORMULA Anderson-PT-06-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-06-LTLFireability-06 finished in 909 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p0)&&X(p1)))))'
Support contains 4 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 419/419 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 172 transition count 263
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 172 transition count 263
Applied a total of 32 rules in 5 ms. Remains 172 /188 variables (removed 16) and now considering 263/419 (removed 156) transitions.
// Phase 1: matrix 263 rows 172 cols
[2023-04-07 08:34:38] [INFO ] Computed 15 invariants in 2 ms
[2023-04-07 08:34:38] [INFO ] Implicit Places using invariants in 113 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 115 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 171/188 places, 263/419 transitions.
Applied a total of 0 rules in 1 ms. Remains 171 /171 variables (removed 0) and now considering 263/263 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 121 ms. Remains : 171/188 places, 263/419 transitions.
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : Anderson-PT-06-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (AND (EQ s15 1) (EQ s24 1)) (AND (EQ s15 1) (EQ s21 1))), p1:(EQ s56 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 107 ms.
Stack based approach found an accepted trace after 39 steps with 0 reset with depth 40 and stack size 40 in 0 ms.
FORMULA Anderson-PT-06-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-06-LTLFireability-07 finished in 388 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&F((X(G(p2))&&p1)))))'
Support contains 3 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 419/419 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 171 transition count 252
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 171 transition count 252
Applied a total of 34 rules in 6 ms. Remains 171 /188 variables (removed 17) and now considering 252/419 (removed 167) transitions.
// Phase 1: matrix 252 rows 171 cols
[2023-04-07 08:34:38] [INFO ] Computed 15 invariants in 4 ms
[2023-04-07 08:34:38] [INFO ] Implicit Places using invariants in 122 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 126 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/188 places, 252/419 transitions.
Applied a total of 0 rules in 1 ms. Remains 170 /170 variables (removed 0) and now considering 252/252 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 134 ms. Remains : 170/188 places, 252/419 transitions.
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : Anderson-PT-06-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s15 1) (EQ s22 1)), p1:(AND (EQ s15 1) (EQ s22 1)), p2:(EQ s43 0)], 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 103 ms.
Stack based approach found an accepted trace after 59 steps with 0 reset with depth 60 and stack size 60 in 0 ms.
FORMULA Anderson-PT-06-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-06-LTLFireability-10 finished in 461 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0) U X((p1||X(!p1))))))'
Support contains 4 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 419/419 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 171 transition count 262
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 171 transition count 262
Applied a total of 34 rules in 6 ms. Remains 171 /188 variables (removed 17) and now considering 262/419 (removed 157) transitions.
// Phase 1: matrix 262 rows 171 cols
[2023-04-07 08:34:38] [INFO ] Computed 15 invariants in 2 ms
[2023-04-07 08:34:39] [INFO ] Implicit Places using invariants in 122 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 123 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/188 places, 262/419 transitions.
Applied a total of 0 rules in 1 ms. Remains 170 /170 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 131 ms. Remains : 170/188 places, 262/419 transitions.
Stuttering acceptance computed with spot in 193 ms :[false, false, false, p1, true, (AND (NOT p0) p1), (NOT p0)]
Running random walk in product with property : Anderson-PT-06-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=p1, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 4}, { cond=(AND p0 p1), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 4}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s7 1) (EQ s19 1)), p1:(AND (EQ s9 1) (EQ s23 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 24926 reset in 189 ms.
Product exploration explored 100000 steps with 24935 reset in 177 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 5 factoid took 182 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 7 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[false, false, false, p1, true, (AND (NOT p0) p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 262 rows 170 cols
[2023-04-07 08:34:40] [INFO ] Computed 14 invariants in 2 ms
[2023-04-07 08:34:40] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2023-04-07 08:34:40] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 5 ms returned sat
[2023-04-07 08:34:40] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) p1)), (F (AND p0 (NOT p1))), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1)]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be false thanks to negative knowledge :(F (AND (NOT p0) p1))
Knowledge based reduction with 6 factoid took 222 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-06-LTLFireability-11 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-06-LTLFireability-11 finished in 1496 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 188/188 places, 419/419 transitions.
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 30 Pre rules applied. Total rules applied 0 place count 188 transition count 389
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 0 with 60 rules applied. Total rules applied 60 place count 158 transition count 389
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 78 place count 140 transition count 221
Iterating global reduction 0 with 18 rules applied. Total rules applied 96 place count 140 transition count 221
Applied a total of 96 rules in 14 ms. Remains 140 /188 variables (removed 48) and now considering 221/419 (removed 198) transitions.
// Phase 1: matrix 221 rows 140 cols
[2023-04-07 08:34:40] [INFO ] Computed 15 invariants in 3 ms
[2023-04-07 08:34:40] [INFO ] Implicit Places using invariants in 128 ms returned []
[2023-04-07 08:34:40] [INFO ] Invariant cache hit.
[2023-04-07 08:34:40] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-04-07 08:34:40] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 435 ms to find 0 implicit places.
[2023-04-07 08:34:40] [INFO ] Redundant transitions in 8 ms returned []
[2023-04-07 08:34:40] [INFO ] Invariant cache hit.
[2023-04-07 08:34:40] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 140/188 places, 221/419 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 597 ms. Remains : 140/188 places, 221/419 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-06-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (EQ s7 1) (EQ s21 1)) (AND (EQ s0 1) (EQ s121 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 98 reset in 263 ms.
Stack based approach found an accepted trace after 29 steps with 0 reset with depth 30 and stack size 30 in 1 ms.
FORMULA Anderson-PT-06-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-06-LTLFireability-14 finished in 903 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((G(F(!p0))||(!p1&&F(!p0)))) U p1)))'
Support contains 4 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 419/419 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 170 transition count 251
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 170 transition count 251
Applied a total of 36 rules in 8 ms. Remains 170 /188 variables (removed 18) and now considering 251/419 (removed 168) transitions.
// Phase 1: matrix 251 rows 170 cols
[2023-04-07 08:34:41] [INFO ] Computed 15 invariants in 1 ms
[2023-04-07 08:34:41] [INFO ] Implicit Places using invariants in 201 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 202 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 169/188 places, 251/419 transitions.
Applied a total of 0 rules in 2 ms. Remains 169 /169 variables (removed 0) and now considering 251/251 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 213 ms. Remains : 169/188 places, 251/419 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p1), (NOT p1), p0]
Running random walk in product with property : Anderson-PT-06-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s1 1) (EQ s125 1)), p0:(AND (EQ s10 1) (EQ s23 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 98 reset in 190 ms.
Stack based approach found an accepted trace after 47 steps with 0 reset with depth 48 and stack size 48 in 0 ms.
FORMULA Anderson-PT-06-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-06-LTLFireability-15 finished in 569 ms.
All properties solved by simple procedures.
Total runtime 16451 ms.
ITS solved all properties within timeout

BK_STOP 1680856482768

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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="Anderson-PT-06"
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 Anderson-PT-06, 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 r521-tall-167987246100020"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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