Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r087-tall-171620521400058.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is CANInsertWithFailure-PT-005, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r087-tall-171620521400058
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 708K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 22 14:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 07:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Apr 12 07:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K Apr 12 07:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 126K Apr 12 07:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 202K May 18 16:42 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 CANInsertWithFailure-PT-005-LTLFireability-00
FORMULA_NAME CANInsertWithFailure-PT-005-LTLFireability-01
FORMULA_NAME CANInsertWithFailure-PT-005-LTLFireability-02
FORMULA_NAME CANInsertWithFailure-PT-005-LTLFireability-03
FORMULA_NAME CANInsertWithFailure-PT-005-LTLFireability-04
FORMULA_NAME CANInsertWithFailure-PT-005-LTLFireability-05
FORMULA_NAME CANInsertWithFailure-PT-005-LTLFireability-06
FORMULA_NAME CANInsertWithFailure-PT-005-LTLFireability-07
FORMULA_NAME CANInsertWithFailure-PT-005-LTLFireability-08
FORMULA_NAME CANInsertWithFailure-PT-005-LTLFireability-09
FORMULA_NAME CANInsertWithFailure-PT-005-LTLFireability-10
FORMULA_NAME CANInsertWithFailure-PT-005-LTLFireability-11
FORMULA_NAME CANInsertWithFailure-PT-005-LTLFireability-12
FORMULA_NAME CANInsertWithFailure-PT-005-LTLFireability-13
FORMULA_NAME CANInsertWithFailure-PT-005-LTLFireability-14
FORMULA_NAME CANInsertWithFailure-PT-005-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716223495464

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=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-005
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-20 16:44:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-20 16:44:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 16:44:58] [INFO ] Load time of PNML (sax parser for PT used): 51 ms
[2024-05-20 16:44:58] [INFO ] Transformed 114 places.
[2024-05-20 16:44:58] [INFO ] Transformed 180 transitions.
[2024-05-20 16:44:58] [INFO ] Parsed PT model containing 114 places and 180 transitions and 500 arcs in 120 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CANInsertWithFailure-PT-005-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-005-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-005-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 180/180 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 113 transition count 180
Applied a total of 1 rules in 12 ms. Remains 113 /114 variables (removed 1) and now considering 180/180 (removed 0) transitions.
// Phase 1: matrix 180 rows 113 cols
[2024-05-20 16:45:00] [INFO ] Computed 7 invariants in 17 ms
[2024-05-20 16:45:00] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-05-20 16:45:00] [INFO ] Invariant cache hit.
[2024-05-20 16:45:00] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-20 16:45:00] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
[2024-05-20 16:45:00] [INFO ] Invariant cache hit.
[2024-05-20 16:45:00] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 113/114 places, 180/180 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 467 ms. Remains : 113/114 places, 180/180 transitions.
Support contains 34 out of 113 places after structural reductions.
[2024-05-20 16:45:00] [INFO ] Flatten gal took : 33 ms
[2024-05-20 16:45:01] [INFO ] Flatten gal took : 13 ms
[2024-05-20 16:45:01] [INFO ] Input system was already deterministic with 180 transitions.
Support contains 32 out of 113 places (down from 34) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 101 resets, run finished after 238 ms. (steps per millisecond=42 ) properties (out of 29) seen :27
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2024-05-20 16:45:01] [INFO ] Invariant cache hit.
[2024-05-20 16:45:01] [INFO ] [Real]Absence check using 5 positive place invariants in 9 ms returned sat
[2024-05-20 16:45:01] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-20 16:45:01] [INFO ] After 107ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-20 16:45:01] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-20 16:45:01] [INFO ] After 56ms SMT Verify possible using 45 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 16:45:01] [INFO ] After 247ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 16:45:01] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-20 16:45:01] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-20 16:45:01] [INFO ] After 57ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 16:45:01] [INFO ] After 19ms SMT Verify possible using 45 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 16:45:01] [INFO ] After 41ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2024-05-20 16:45:01] [INFO ] After 148ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 180/180 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 113 transition count 150
Reduce places removed 30 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 31 rules applied. Total rules applied 61 place count 83 transition count 149
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 82 transition count 149
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 62 place count 82 transition count 148
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 64 place count 81 transition count 148
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 102 place count 62 transition count 129
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 114 place count 62 transition count 117
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 117 place count 62 transition count 114
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 120 place count 59 transition count 114
Partial Free-agglomeration rule applied 32 times.
Drop transitions removed 32 transitions
Iterating global reduction 4 with 32 rules applied. Total rules applied 152 place count 59 transition count 114
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 157 place count 59 transition count 114
Applied a total of 157 rules in 58 ms. Remains 59 /113 variables (removed 54) and now considering 114/180 (removed 66) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 59/113 places, 114/180 transitions.
Incomplete random walk after 10000 steps, including 380 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Probably explored full state space saw : 13169 states, properties seen :0
Probabilistic random walk after 72812 steps, saw 13169 distinct states, run finished after 135 ms. (steps per millisecond=539 ) properties seen :0
Explored full state space saw : 13169 states, properties seen :0
Exhaustive walk after 72812 steps, saw 13169 distinct states, run finished after 77 ms. (steps per millisecond=945 ) properties seen :0
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 22 stabilizing places and 35 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((F(p0)||(p1&&G(F(p2))))))'
Support contains 3 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Applied a total of 0 rules in 3 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-05-20 16:45:02] [INFO ] Invariant cache hit.
[2024-05-20 16:45:02] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-20 16:45:02] [INFO ] Invariant cache hit.
[2024-05-20 16:45:02] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-20 16:45:02] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
[2024-05-20 16:45:02] [INFO ] Invariant cache hit.
[2024-05-20 16:45:02] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 298 ms. Remains : 113/113 places, 180/180 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 339 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CANInsertWithFailure-PT-005-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s11 1), p1:(GEQ s39 1), p2:(GEQ s9 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]]
Stuttering criterion allowed to conclude after 126 steps with 0 reset in 3 ms.
FORMULA CANInsertWithFailure-PT-005-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-005-LTLFireability-00 finished in 705 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||X((p1 U p0))))))'
Support contains 2 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Applied a total of 0 rules in 6 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-05-20 16:45:03] [INFO ] Invariant cache hit.
[2024-05-20 16:45:03] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-20 16:45:03] [INFO ] Invariant cache hit.
[2024-05-20 16:45:03] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-20 16:45:03] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2024-05-20 16:45:03] [INFO ] Invariant cache hit.
[2024-05-20 16:45:03] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 270 ms. Remains : 113/113 places, 180/180 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-005-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s67 1), p1:(GEQ s92 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 72 steps with 0 reset in 1 ms.
FORMULA CANInsertWithFailure-PT-005-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-005-LTLFireability-01 finished in 386 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 X((G(p0)||(p0&&F(p1))))))'
Support contains 2 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Applied a total of 0 rules in 4 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-05-20 16:45:03] [INFO ] Invariant cache hit.
[2024-05-20 16:45:03] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-20 16:45:03] [INFO ] Invariant cache hit.
[2024-05-20 16:45:03] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-20 16:45:03] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2024-05-20 16:45:03] [INFO ] Invariant cache hit.
[2024-05-20 16:45:03] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 259 ms. Remains : 113/113 places, 180/180 transitions.
Stuttering acceptance computed with spot in 336 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-005-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(NOT p0), acceptance={} source=5 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 6}]], initial=2, aps=[p1:(LT s34 1), p0:(LT s98 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, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 220 ms.
Product exploration explored 100000 steps with 50000 reset in 187 ms.
Computed a total of 22 stabilizing places and 35 stable transitions
Computed a total of 22 stabilizing places and 35 stable transitions
Detected a total of 22/113 stabilizing places and 35/180 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND p0 (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 18 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-005-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-005-LTLFireability-02 finished in 1051 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 2 out of 113 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 113 transition count 147
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 80 transition count 147
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 66 place count 80 transition count 146
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 79 transition count 146
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 106 place count 60 transition count 127
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 2 with 12 rules applied. Total rules applied 118 place count 60 transition count 115
Applied a total of 118 rules in 22 ms. Remains 60 /113 variables (removed 53) and now considering 115/180 (removed 65) transitions.
// Phase 1: matrix 115 rows 60 cols
[2024-05-20 16:45:04] [INFO ] Computed 7 invariants in 9 ms
[2024-05-20 16:45:04] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-20 16:45:04] [INFO ] Invariant cache hit.
[2024-05-20 16:45:04] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-20 16:45:04] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2024-05-20 16:45:04] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-20 16:45:04] [INFO ] Invariant cache hit.
[2024-05-20 16:45:04] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/113 places, 115/180 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 232 ms. Remains : 60/113 places, 115/180 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-005-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s12 1) (GEQ s18 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]]
Stuttering criterion allowed to conclude after 30 steps with 0 reset in 1 ms.
FORMULA CANInsertWithFailure-PT-005-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-005-LTLFireability-03 finished in 295 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 1 out of 113 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 113 transition count 147
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 80 transition count 147
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 106 place count 60 transition count 127
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 2 with 12 rules applied. Total rules applied 118 place count 60 transition count 115
Applied a total of 118 rules in 22 ms. Remains 60 /113 variables (removed 53) and now considering 115/180 (removed 65) transitions.
// Phase 1: matrix 115 rows 60 cols
[2024-05-20 16:45:04] [INFO ] Computed 7 invariants in 1 ms
[2024-05-20 16:45:04] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-20 16:45:04] [INFO ] Invariant cache hit.
[2024-05-20 16:45:04] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-20 16:45:05] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2024-05-20 16:45:05] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-20 16:45:05] [INFO ] Invariant cache hit.
[2024-05-20 16:45:05] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/113 places, 115/180 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 225 ms. Remains : 60/113 places, 115/180 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-005-LTLFireability-05 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:(GEQ s23 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]]
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 0 ms.
FORMULA CANInsertWithFailure-PT-005-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-005-LTLFireability-05 finished in 329 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(G(p0))))'
Support contains 2 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Applied a total of 0 rules in 3 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
// Phase 1: matrix 180 rows 113 cols
[2024-05-20 16:45:05] [INFO ] Computed 7 invariants in 3 ms
[2024-05-20 16:45:05] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-20 16:45:05] [INFO ] Invariant cache hit.
[2024-05-20 16:45:05] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-20 16:45:05] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2024-05-20 16:45:05] [INFO ] Invariant cache hit.
[2024-05-20 16:45:05] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 248 ms. Remains : 113/113 places, 180/180 transitions.
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-005-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (GEQ s93 1) (GEQ s105 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CANInsertWithFailure-PT-005-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-005-LTLFireability-06 finished in 405 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 U X((p0||G(p1))))))'
Support contains 2 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Applied a total of 0 rules in 5 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-05-20 16:45:05] [INFO ] Invariant cache hit.
[2024-05-20 16:45:05] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-20 16:45:05] [INFO ] Invariant cache hit.
[2024-05-20 16:45:05] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-20 16:45:05] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
[2024-05-20 16:45:05] [INFO ] Invariant cache hit.
[2024-05-20 16:45:05] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 256 ms. Remains : 113/113 places, 180/180 transitions.
Stuttering acceptance computed with spot in 123 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-005-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(GEQ s52 1), p1:(GEQ s75 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CANInsertWithFailure-PT-005-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-005-LTLFireability-07 finished in 403 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((F(p1)&&p0)))'
Support contains 3 out of 113 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 113/113 places, 180/180 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 113 transition count 146
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 79 transition count 146
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 108 place count 59 transition count 126
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 2 with 12 rules applied. Total rules applied 120 place count 59 transition count 114
Applied a total of 120 rules in 16 ms. Remains 59 /113 variables (removed 54) and now considering 114/180 (removed 66) transitions.
// Phase 1: matrix 114 rows 59 cols
[2024-05-20 16:45:06] [INFO ] Computed 7 invariants in 1 ms
[2024-05-20 16:45:06] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-20 16:45:06] [INFO ] Invariant cache hit.
[2024-05-20 16:45:06] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-20 16:45:06] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2024-05-20 16:45:06] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-20 16:45:06] [INFO ] Invariant cache hit.
[2024-05-20 16:45:06] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/113 places, 114/180 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 195 ms. Remains : 59/113 places, 114/180 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-005-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(GEQ s34 1), p0:(AND (GEQ s11 1) (GEQ s50 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, null][true, true]]
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 1 ms.
FORMULA CANInsertWithFailure-PT-005-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-005-LTLFireability-08 finished in 287 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)))&&F(p1)))'
Support contains 2 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Applied a total of 0 rules in 2 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
// Phase 1: matrix 180 rows 113 cols
[2024-05-20 16:45:06] [INFO ] Computed 7 invariants in 9 ms
[2024-05-20 16:45:06] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-20 16:45:06] [INFO ] Invariant cache hit.
[2024-05-20 16:45:06] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-20 16:45:06] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
[2024-05-20 16:45:06] [INFO ] Invariant cache hit.
[2024-05-20 16:45:06] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 272 ms. Remains : 113/113 places, 180/180 transitions.
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p1) p0), p0, (NOT p1), p0]
Running random walk in product with property : CANInsertWithFailure-PT-005-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(GEQ s110 1), p0:(GEQ s92 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][false, false, false, false]]
Stuttering criterion allowed to conclude after 130 steps with 1 reset in 1 ms.
FORMULA CANInsertWithFailure-PT-005-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-005-LTLFireability-09 finished in 465 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(G(p1))||F(!p2))&&p0))))'
Support contains 4 out of 113 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 113 transition count 149
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 82 transition count 149
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 62 place count 82 transition count 148
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 64 place count 81 transition count 148
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 102 place count 62 transition count 129
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 2 with 12 rules applied. Total rules applied 114 place count 62 transition count 117
Applied a total of 114 rules in 23 ms. Remains 62 /113 variables (removed 51) and now considering 117/180 (removed 63) transitions.
// Phase 1: matrix 117 rows 62 cols
[2024-05-20 16:45:06] [INFO ] Computed 7 invariants in 2 ms
[2024-05-20 16:45:06] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-20 16:45:06] [INFO ] Invariant cache hit.
[2024-05-20 16:45:06] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-20 16:45:06] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2024-05-20 16:45:06] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-20 16:45:06] [INFO ] Invariant cache hit.
[2024-05-20 16:45:06] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 62/113 places, 117/180 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 223 ms. Remains : 62/113 places, 117/180 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (AND (NOT p1) p2), (OR (AND (NOT p0) p2) (AND (NOT p1) p2))]
Running random walk in product with property : CANInsertWithFailure-PT-005-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={1} source=0 dest: 0}, { cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 p2), acceptance={} source=0 dest: 1}], [{ cond=(AND p2 p1), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p2 (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 p2 (NOT p1)), acceptance={1} source=1 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0, 1} source=1 dest: 2}], [{ cond=(AND p0 p2), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p0 p2), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s5 1) (GEQ s13 1) (GEQ s57 1)), p2:(GEQ s25 1), p1:(OR (LT s5 1) (LT s13 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 0 ms.
FORMULA CANInsertWithFailure-PT-005-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-005-LTLFireability-11 finished in 371 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(((p1||X((X(G(p2)) U (p1&&X(G(p2))))))&&p0))))'
Support contains 3 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Applied a total of 0 rules in 2 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
// Phase 1: matrix 180 rows 113 cols
[2024-05-20 16:45:07] [INFO ] Computed 7 invariants in 1 ms
[2024-05-20 16:45:07] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-20 16:45:07] [INFO ] Invariant cache hit.
[2024-05-20 16:45:07] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-20 16:45:07] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2024-05-20 16:45:07] [INFO ] Invariant cache hit.
[2024-05-20 16:45:07] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 244 ms. Remains : 113/113 places, 180/180 transitions.
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : CANInsertWithFailure-PT-005-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s73 1) (GEQ s112 1)), p1:(GEQ s18 1), p2:(GEQ s112 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 98 steps with 0 reset in 1 ms.
FORMULA CANInsertWithFailure-PT-005-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-005-LTLFireability-12 finished in 495 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))||!((!p0 U p1) U X(p2))))'
Support contains 5 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Applied a total of 0 rules in 2 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-05-20 16:45:07] [INFO ] Invariant cache hit.
[2024-05-20 16:45:07] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-20 16:45:07] [INFO ] Invariant cache hit.
[2024-05-20 16:45:07] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-20 16:45:07] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2024-05-20 16:45:07] [INFO ] Invariant cache hit.
[2024-05-20 16:45:07] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 229 ms. Remains : 113/113 places, 180/180 transitions.
Stuttering acceptance computed with spot in 260 ms :[(AND (NOT p0) p2), (AND p2 (NOT p0)), (AND p1 (NOT p0) p2), (NOT p0), (AND (NOT p0) p1 p2), (AND (NOT p0) p1 (NOT p2))]
Running random walk in product with property : CANInsertWithFailure-PT-005-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 p2), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 5}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (GEQ s35 1) (GEQ s101 1)), p0:(OR (LT s63 1) (LT s103 1)), p2:(GEQ s39 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 50000 reset in 143 ms.
Product exploration explored 100000 steps with 50000 reset in 136 ms.
Computed a total of 22 stabilizing places and 35 stable transitions
Computed a total of 22 stabilizing places and 35 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND p1 p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 19 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-005-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-005-LTLFireability-13 finished in 817 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(((p1 U p2)||X(G(p3))||p0)))'
Support contains 8 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Applied a total of 0 rules in 3 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-05-20 16:45:08] [INFO ] Invariant cache hit.
[2024-05-20 16:45:08] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-20 16:45:08] [INFO ] Invariant cache hit.
[2024-05-20 16:45:08] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-20 16:45:08] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
[2024-05-20 16:45:08] [INFO ] Invariant cache hit.
[2024-05-20 16:45:08] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 223 ms. Remains : 113/113 places, 180/180 transitions.
Stuttering acceptance computed with spot in 1265 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : CANInsertWithFailure-PT-005-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p3), acceptance={} source=4 dest: 0}, { cond=p3, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p3), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) p1 p3), acceptance={} source=5 dest: 5}]], initial=2, aps=[p2:(AND (GEQ s21 1) (GEQ s73 1)), p1:(AND (GEQ s12 1) (GEQ s49 1)), p0:(OR (AND (GEQ s2 1) (GEQ s17 1)) (AND (GEQ s21 1) (GEQ s73 1))), p3:(AND (GEQ s69 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, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CANInsertWithFailure-PT-005-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-005-LTLFireability-15 finished in 1510 ms.
All properties solved by simple procedures.
Total runtime 11405 ms.

BK_STOP 1716223511283

--------------------
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="CANInsertWithFailure-PT-005"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is CANInsertWithFailure-PT-005, 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 r087-tall-171620521400058"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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