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.r517-tall-167987243300012.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is Anderson-PT-05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r517-tall-167987243300012
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.1K Mar 23 15:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Mar 23 15:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Mar 23 15:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Mar 23 15:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K 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.8K 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 7.5K Mar 23 15:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 68K Mar 23 15:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Mar 23 15:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Mar 23 15:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 23 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 185K 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-05-LTLFireability-00
FORMULA_NAME Anderson-PT-05-LTLFireability-01
FORMULA_NAME Anderson-PT-05-LTLFireability-02
FORMULA_NAME Anderson-PT-05-LTLFireability-03
FORMULA_NAME Anderson-PT-05-LTLFireability-04
FORMULA_NAME Anderson-PT-05-LTLFireability-05
FORMULA_NAME Anderson-PT-05-LTLFireability-06
FORMULA_NAME Anderson-PT-05-LTLFireability-07
FORMULA_NAME Anderson-PT-05-LTLFireability-08
FORMULA_NAME Anderson-PT-05-LTLFireability-09
FORMULA_NAME Anderson-PT-05-LTLFireability-10
FORMULA_NAME Anderson-PT-05-LTLFireability-11
FORMULA_NAME Anderson-PT-05-LTLFireability-12
FORMULA_NAME Anderson-PT-05-LTLFireability-13
FORMULA_NAME Anderson-PT-05-LTLFireability-14
FORMULA_NAME Anderson-PT-05-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1680841202104

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-05
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2023-04-07 04:20:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-04-07 04:20:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 04:20:03] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2023-04-07 04:20:03] [INFO ] Transformed 161 places.
[2023-04-07 04:20:03] [INFO ] Transformed 365 transitions.
[2023-04-07 04:20:03] [INFO ] Found NUPN structural information;
[2023-04-07 04:20:03] [INFO ] Parsed PT model containing 161 places and 365 transitions and 1380 arcs in 130 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Anderson-PT-05-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-05-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-05-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 365/365 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 136 transition count 292
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 136 transition count 292
Applied a total of 50 rules in 25 ms. Remains 136 /161 variables (removed 25) and now considering 292/365 (removed 73) transitions.
// Phase 1: matrix 292 rows 136 cols
[2023-04-07 04:20:03] [INFO ] Computed 13 invariants in 23 ms
[2023-04-07 04:20:04] [INFO ] Implicit Places using invariants in 234 ms returned []
[2023-04-07 04:20:04] [INFO ] Invariant cache hit.
[2023-04-07 04:20:04] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 04:20:04] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 548 ms to find 0 implicit places.
[2023-04-07 04:20:04] [INFO ] Invariant cache hit.
[2023-04-07 04:20:04] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 136/161 places, 292/365 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 733 ms. Remains : 136/161 places, 292/365 transitions.
Support contains 30 out of 136 places after structural reductions.
[2023-04-07 04:20:04] [INFO ] Flatten gal took : 52 ms
[2023-04-07 04:20:04] [INFO ] Flatten gal took : 24 ms
[2023-04-07 04:20:04] [INFO ] Input system was already deterministic with 292 transitions.
Support contains 29 out of 136 places (down from 30) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 418 ms. (steps per millisecond=23 ) properties (out of 23) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 12) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 3) 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 3) seen :0
Running SMT prover for 3 properties.
[2023-04-07 04:20:05] [INFO ] Invariant cache hit.
[2023-04-07 04:20:05] [INFO ] [Real]Absence check using 6 positive place invariants in 12 ms returned sat
[2023-04-07 04:20:05] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2023-04-07 04:20:05] [INFO ] After 216ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-04-07 04:20:05] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-04-07 04:20:05] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-07 04:20:06] [INFO ] After 97ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2023-04-07 04:20:06] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 04:20:06] [INFO ] After 45ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :2 sat :1
[2023-04-07 04:20:06] [INFO ] Deduced a trap composed of 81 places in 99 ms of which 25 ms to minimize.
[2023-04-07 04:20:06] [INFO ] Deduced a trap composed of 66 places in 138 ms of which 0 ms to minimize.
[2023-04-07 04:20:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 335 ms
[2023-04-07 04:20:06] [INFO ] After 408ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-04-07 04:20:06] [INFO ] After 588ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 136 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 292/292 transitions.
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 19 Pre rules applied. Total rules applied 0 place count 136 transition count 273
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 38 place count 117 transition count 273
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 51 place count 104 transition count 156
Iterating global reduction 0 with 13 rules applied. Total rules applied 64 place count 104 transition count 156
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 66 place count 103 transition count 155
Applied a total of 66 rules in 33 ms. Remains 103 /136 variables (removed 33) and now considering 155/292 (removed 137) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 103/136 places, 155/292 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Finished Best-First random walk after 1954 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=651 )
Parikh walk visited 0 properties in 0 ms.
FORMULA Anderson-PT-05-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA Anderson-PT-05-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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' '!(X(G((p0||G(p1)||G(p2)))))'
Support contains 6 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 292/292 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 123 transition count 183
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 123 transition count 183
Applied a total of 26 rules in 16 ms. Remains 123 /136 variables (removed 13) and now considering 183/292 (removed 109) transitions.
// Phase 1: matrix 183 rows 123 cols
[2023-04-07 04:20:06] [INFO ] Computed 13 invariants in 8 ms
[2023-04-07 04:20:06] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-04-07 04:20:06] [INFO ] Invariant cache hit.
[2023-04-07 04:20:07] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 04:20:07] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
[2023-04-07 04:20:07] [INFO ] Invariant cache hit.
[2023-04-07 04:20:07] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 123/136 places, 183/292 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 468 ms. Remains : 123/136 places, 183/292 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 2715 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (NOT p1)]
Running random walk in product with property : Anderson-PT-05-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=1, aps=[p1:(OR (EQ s11 0) (EQ s22 0)), p2:(OR (NEQ s6 1) (NEQ s18 1)), p0:(AND (EQ s0 1) (EQ s104 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, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 25837 steps with 0 reset in 112 ms.
FORMULA Anderson-PT-05-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-05-LTLFireability-01 finished in 3362 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 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 292/292 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 136 transition count 272
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 116 transition count 272
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 54 place count 102 transition count 154
Iterating global reduction 0 with 14 rules applied. Total rules applied 68 place count 102 transition count 154
Applied a total of 68 rules in 16 ms. Remains 102 /136 variables (removed 34) and now considering 154/292 (removed 138) transitions.
// Phase 1: matrix 154 rows 102 cols
[2023-04-07 04:20:10] [INFO ] Computed 13 invariants in 8 ms
[2023-04-07 04:20:10] [INFO ] Implicit Places using invariants in 185 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 187 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/136 places, 154/292 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 101 transition count 130
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 77 transition count 130
Applied a total of 48 rules in 13 ms. Remains 77 /101 variables (removed 24) and now considering 130/154 (removed 24) transitions.
// Phase 1: matrix 130 rows 77 cols
[2023-04-07 04:20:10] [INFO ] Computed 12 invariants in 1 ms
[2023-04-07 04:20:10] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-04-07 04:20:10] [INFO ] Invariant cache hit.
[2023-04-07 04:20:10] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 04:20:10] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 77/136 places, 130/292 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 393 ms. Remains : 77/136 places, 130/292 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-05-LTLFireability-02 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 s20 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 157 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-05-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-05-LTLFireability-02 finished in 606 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(p0)))'
Support contains 4 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 292/292 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 123 transition count 183
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 123 transition count 183
Applied a total of 26 rules in 11 ms. Remains 123 /136 variables (removed 13) and now considering 183/292 (removed 109) transitions.
// Phase 1: matrix 183 rows 123 cols
[2023-04-07 04:20:10] [INFO ] Computed 13 invariants in 4 ms
[2023-04-07 04:20:10] [INFO ] Implicit Places using invariants in 80 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 81 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 122/136 places, 183/292 transitions.
Applied a total of 0 rules in 2 ms. Remains 122 /122 variables (removed 0) and now considering 183/183 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 94 ms. Remains : 122/136 places, 183/292 transitions.
Stuttering acceptance computed with spot in 525 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-05-LTLFireability-03 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 s11 1) (EQ s20 1) (OR (EQ s6 0) (EQ s18 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 1 steps with 0 reset in 1 ms.
FORMULA Anderson-PT-05-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-05-LTLFireability-03 finished in 635 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(p1)&&F(G(p2))))&&p0))))'
Support contains 4 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 292/292 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 123 transition count 183
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 123 transition count 183
Applied a total of 26 rules in 9 ms. Remains 123 /136 variables (removed 13) and now considering 183/292 (removed 109) transitions.
// Phase 1: matrix 183 rows 123 cols
[2023-04-07 04:20:11] [INFO ] Computed 13 invariants in 5 ms
[2023-04-07 04:20:11] [INFO ] Implicit Places using invariants in 86 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 89 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 122/136 places, 183/292 transitions.
Applied a total of 0 rules in 2 ms. Remains 122 /122 variables (removed 0) and now considering 183/183 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 100 ms. Remains : 122/136 places, 183/292 transitions.
Stuttering acceptance computed with spot in 535 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2)), (NOT p0)]
Running random walk in product with property : Anderson-PT-05-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}, { cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(OR (EQ s9 0) (EQ s20 0)), p2:(AND (EQ s10 1) (EQ s17 1)), p0:(AND (EQ s10 1) (EQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 117 ms.
Stack based approach found an accepted trace after 32 steps with 0 reset with depth 33 and stack size 33 in 0 ms.
FORMULA Anderson-PT-05-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-05-LTLFireability-05 finished in 779 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 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 292/292 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 136 transition count 272
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 116 transition count 272
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 54 place count 102 transition count 154
Iterating global reduction 0 with 14 rules applied. Total rules applied 68 place count 102 transition count 154
Applied a total of 68 rules in 15 ms. Remains 102 /136 variables (removed 34) and now considering 154/292 (removed 138) transitions.
// Phase 1: matrix 154 rows 102 cols
[2023-04-07 04:20:12] [INFO ] Computed 13 invariants in 2 ms
[2023-04-07 04:20:12] [INFO ] Implicit Places using invariants in 84 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 85 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/136 places, 154/292 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 101 transition count 130
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 77 transition count 130
Applied a total of 48 rules in 5 ms. Remains 77 /101 variables (removed 24) and now considering 130/154 (removed 24) transitions.
// Phase 1: matrix 130 rows 77 cols
[2023-04-07 04:20:12] [INFO ] Computed 12 invariants in 1 ms
[2023-04-07 04:20:12] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-04-07 04:20:12] [INFO ] Invariant cache hit.
[2023-04-07 04:20:12] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 04:20:12] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 77/136 places, 130/292 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 287 ms. Remains : 77/136 places, 130/292 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-05-LTLFireability-07 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 s10 1) (EQ s15 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 98 ms.
Stack based approach found an accepted trace after 50 steps with 0 reset with depth 51 and stack size 51 in 0 ms.
FORMULA Anderson-PT-05-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-05-LTLFireability-07 finished in 430 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)))'
Support contains 3 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 292/292 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 123 transition count 175
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 123 transition count 175
Applied a total of 26 rules in 4 ms. Remains 123 /136 variables (removed 13) and now considering 175/292 (removed 117) transitions.
// Phase 1: matrix 175 rows 123 cols
[2023-04-07 04:20:12] [INFO ] Computed 13 invariants in 3 ms
[2023-04-07 04:20:12] [INFO ] Implicit Places using invariants in 88 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 90 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 122/136 places, 175/292 transitions.
Applied a total of 0 rules in 1 ms. Remains 122 /122 variables (removed 0) and now considering 175/175 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 96 ms. Remains : 122/136 places, 175/292 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-05-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s7 1) (EQ s15 1) (EQ s41 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 97 ms.
Stack based approach found an accepted trace after 36 steps with 0 reset with depth 37 and stack size 37 in 1 ms.
FORMULA Anderson-PT-05-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-05-LTLFireability-08 finished in 271 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(X(F(p0))))'
Support contains 2 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 292/292 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 121 transition count 165
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 121 transition count 165
Applied a total of 30 rules in 4 ms. Remains 121 /136 variables (removed 15) and now considering 165/292 (removed 127) transitions.
// Phase 1: matrix 165 rows 121 cols
[2023-04-07 04:20:12] [INFO ] Computed 13 invariants in 4 ms
[2023-04-07 04:20:12] [INFO ] Implicit Places using invariants in 93 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 96 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 120/136 places, 165/292 transitions.
Applied a total of 0 rules in 1 ms. Remains 120 /120 variables (removed 0) and now considering 165/165 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 102 ms. Remains : 120/136 places, 165/292 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-05-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (EQ s4 1) (EQ s55 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 170 reset in 125 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-05-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-05-LTLFireability-10 finished in 356 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 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 292/292 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 136 transition count 272
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 116 transition count 272
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 54 place count 102 transition count 154
Iterating global reduction 0 with 14 rules applied. Total rules applied 68 place count 102 transition count 154
Applied a total of 68 rules in 14 ms. Remains 102 /136 variables (removed 34) and now considering 154/292 (removed 138) transitions.
// Phase 1: matrix 154 rows 102 cols
[2023-04-07 04:20:13] [INFO ] Computed 13 invariants in 1 ms
[2023-04-07 04:20:13] [INFO ] Implicit Places using invariants in 103 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 106 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/136 places, 154/292 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 101 transition count 130
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 77 transition count 130
Applied a total of 48 rules in 6 ms. Remains 77 /101 variables (removed 24) and now considering 130/154 (removed 24) transitions.
// Phase 1: matrix 130 rows 77 cols
[2023-04-07 04:20:13] [INFO ] Computed 12 invariants in 1 ms
[2023-04-07 04:20:13] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-04-07 04:20:13] [INFO ] Invariant cache hit.
[2023-04-07 04:20:13] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 04:20:13] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 77/136 places, 130/292 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 308 ms. Remains : 77/136 places, 130/292 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-05-LTLFireability-11 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 s11 1) (EQ s16 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 110 ms.
Stack based approach found an accepted trace after 21 steps with 0 reset with depth 22 and stack size 22 in 0 ms.
FORMULA Anderson-PT-05-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-05-LTLFireability-11 finished in 485 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(p0)||X(F(!p1)))))'
Support contains 4 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 292/292 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 122 transition count 174
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 122 transition count 174
Applied a total of 28 rules in 5 ms. Remains 122 /136 variables (removed 14) and now considering 174/292 (removed 118) transitions.
// Phase 1: matrix 174 rows 122 cols
[2023-04-07 04:20:13] [INFO ] Computed 13 invariants in 1 ms
[2023-04-07 04:20:13] [INFO ] Implicit Places using invariants in 91 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 92 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 121/136 places, 174/292 transitions.
Applied a total of 0 rules in 0 ms. Remains 121 /121 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 99 ms. Remains : 121/136 places, 174/292 transitions.
Stuttering acceptance computed with spot in 121 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : Anderson-PT-05-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p1, 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: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(AND (EQ s12 1) (EQ s16 1)), p0:(AND (EQ s4 1) (EQ s46 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 33333 reset in 183 ms.
Product exploration explored 100000 steps with 33333 reset in 159 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 83 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-05-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-05-LTLFireability-12 finished in 664 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((p0||F(p1))))'
Support contains 4 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 292/292 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 136 transition count 272
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 116 transition count 272
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 53 place count 103 transition count 163
Iterating global reduction 0 with 13 rules applied. Total rules applied 66 place count 103 transition count 163
Applied a total of 66 rules in 15 ms. Remains 103 /136 variables (removed 33) and now considering 163/292 (removed 129) transitions.
// Phase 1: matrix 163 rows 103 cols
[2023-04-07 04:20:14] [INFO ] Computed 13 invariants in 3 ms
[2023-04-07 04:20:14] [INFO ] Implicit Places using invariants in 115 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 116 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 102/136 places, 163/292 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 102 transition count 140
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 79 transition count 140
Applied a total of 46 rules in 5 ms. Remains 79 /102 variables (removed 23) and now considering 140/163 (removed 23) transitions.
// Phase 1: matrix 140 rows 79 cols
[2023-04-07 04:20:14] [INFO ] Computed 12 invariants in 0 ms
[2023-04-07 04:20:14] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-04-07 04:20:14] [INFO ] Invariant cache hit.
[2023-04-07 04:20:14] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 04:20:14] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 79/136 places, 140/292 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 355 ms. Remains : 79/136 places, 140/292 transitions.
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Anderson-PT-05-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s5 1) (EQ s16 1)), p1:(AND (OR (AND (EQ s9 1) (EQ s18 1)) (AND (EQ s5 1) (EQ s16 1))) (EQ s9 1) (EQ s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 400 reset in 100 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-05-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-05-LTLFireability-14 finished in 558 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)))'
Support contains 2 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 292/292 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 136 transition count 272
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 116 transition count 272
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 54 place count 102 transition count 154
Iterating global reduction 0 with 14 rules applied. Total rules applied 68 place count 102 transition count 154
Applied a total of 68 rules in 19 ms. Remains 102 /136 variables (removed 34) and now considering 154/292 (removed 138) transitions.
// Phase 1: matrix 154 rows 102 cols
[2023-04-07 04:20:14] [INFO ] Computed 13 invariants in 3 ms
[2023-04-07 04:20:15] [INFO ] Implicit Places using invariants in 80 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 82 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/136 places, 154/292 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 101 transition count 130
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 77 transition count 130
Applied a total of 48 rules in 4 ms. Remains 77 /101 variables (removed 24) and now considering 130/154 (removed 24) transitions.
// Phase 1: matrix 130 rows 77 cols
[2023-04-07 04:20:15] [INFO ] Computed 12 invariants in 0 ms
[2023-04-07 04:20:15] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-04-07 04:20:15] [INFO ] Invariant cache hit.
[2023-04-07 04:20:15] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 04:20:15] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 77/136 places, 130/292 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 292 ms. Remains : 77/136 places, 130/292 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-05-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s11 0) (EQ s18 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 62 reset in 90 ms.
Product exploration explored 100000 steps with 79 reset in 108 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Finished random walk after 229 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=57 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 412 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 130/130 transitions.
Applied a total of 0 rules in 5 ms. Remains 77 /77 variables (removed 0) and now considering 130/130 (removed 0) transitions.
[2023-04-07 04:20:16] [INFO ] Invariant cache hit.
[2023-04-07 04:20:16] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-04-07 04:20:16] [INFO ] Invariant cache hit.
[2023-04-07 04:20:16] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 04:20:16] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
[2023-04-07 04:20:16] [INFO ] Redundant transitions in 4 ms returned []
[2023-04-07 04:20:16] [INFO ] Invariant cache hit.
[2023-04-07 04:20:16] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 318 ms. Remains : 77/77 places, 130/130 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Finished random walk after 45 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=45 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 52 reset in 99 ms.
Product exploration explored 100000 steps with 62 reset in 98 ms.
Built C files in :
/tmp/ltsmin2518911362465404035
[2023-04-07 04:20:17] [INFO ] Computing symmetric may disable matrix : 130 transitions.
[2023-04-07 04:20:17] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 04:20:17] [INFO ] Computing symmetric may enable matrix : 130 transitions.
[2023-04-07 04:20:17] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 04:20:17] [INFO ] Computing Do-Not-Accords matrix : 130 transitions.
[2023-04-07 04:20:17] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 04:20:17] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2518911362465404035
Running compilation step : cd /tmp/ltsmin2518911362465404035;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 415 ms.
Running link step : cd /tmp/ltsmin2518911362465404035;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin2518911362465404035;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8225992525336222260.hoa' '--buchi-type=spotba'
LTSmin run took 573 ms.
FORMULA Anderson-PT-05-LTLFireability-15 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Anderson-PT-05-LTLFireability-15 finished in 3514 ms.
All properties solved by simple procedures.
Total runtime 14882 ms.

BK_STOP 1680841221466

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is Anderson-PT-05, 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 r517-tall-167987243300012"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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