Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r041-tajo-167813695000700.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
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 r041-tajo-167813695000700
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 664K
-rw-r--r-- 1 mcc users 8.7K Feb 26 00:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 26 00:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 26 00:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K Feb 26 00:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 00:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Feb 26 00:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 26 00:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 00:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 202K Mar 5 18:22 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 1678658546802

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-005
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 22:02:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 22:02:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 22:02:28] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2023-03-12 22:02:28] [INFO ] Transformed 114 places.
[2023-03-12 22:02:28] [INFO ] Transformed 180 transitions.
[2023-03-12 22:02:28] [INFO ] Parsed PT model containing 114 places and 180 transitions and 500 arcs in 121 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 CANInsertWithFailure-PT-005-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-005-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-005-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA CANInsertWithFailure-PT-005-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 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 13 ms. Remains 113 /114 variables (removed 1) and now considering 180/180 (removed 0) transitions.
// Phase 1: matrix 180 rows 113 cols
[2023-03-12 22:02:28] [INFO ] Computed 7 place invariants in 13 ms
[2023-03-12 22:02:28] [INFO ] Implicit Places using invariants in 156 ms returned []
[2023-03-12 22:02:28] [INFO ] Invariant cache hit.
[2023-03-12 22:02:29] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-12 22:02:29] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
[2023-03-12 22:02:29] [INFO ] Invariant cache hit.
[2023-03-12 22:02:29] [INFO ] Dead Transitions using invariants and state equation in 99 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 425 ms. Remains : 113/114 places, 180/180 transitions.
Support contains 35 out of 113 places after structural reductions.
[2023-03-12 22:02:29] [INFO ] Flatten gal took : 32 ms
[2023-03-12 22:02:29] [INFO ] Flatten gal took : 12 ms
[2023-03-12 22:02:29] [INFO ] Input system was already deterministic with 180 transitions.
Support contains 34 out of 113 places (down from 35) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 102 resets, run finished after 392 ms. (steps per millisecond=25 ) properties (out of 26) seen :24
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-12 22:02:29] [INFO ] Invariant cache hit.
[2023-03-12 22:02:29] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 22:02:29] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-12 22:02:29] [INFO ] After 44ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1
[2023-03-12 22:02:29] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-12 22:02:30] [INFO ] After 17ms SMT Verify possible using 45 Read/Feed constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-12 22:02:30] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-12 22:02:30] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 22:02:30] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-12 22:02:30] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-12 22:02:30] [INFO ] After 12ms SMT Verify possible using 45 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-12 22:02:30] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-12 22:02:30] [INFO ] After 118ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 180/180 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 113 transition count 148
Reduce places removed 32 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 33 rules applied. Total rules applied 65 place count 81 transition count 147
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 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 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 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 3 with 12 rules applied. Total rules applied 118 place count 60 transition count 115
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 120 place count 60 transition count 113
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 122 place count 58 transition count 113
Partial Free-agglomeration rule applied 30 times.
Drop transitions removed 30 transitions
Iterating global reduction 4 with 30 rules applied. Total rules applied 152 place count 58 transition count 113
Applied a total of 152 rules in 34 ms. Remains 58 /113 variables (removed 55) and now considering 113/180 (removed 67) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 58/113 places, 113/180 transitions.
Incomplete random walk after 10000 steps, including 376 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Probably explored full state space saw : 12120 states, properties seen :0
Probabilistic random walk after 67174 steps, saw 12120 distinct states, run finished after 130 ms. (steps per millisecond=516 ) properties seen :0
Explored full state space saw : 12120 states, properties seen :0
Exhaustive walk after 67174 steps, saw 12120 distinct states, run finished after 77 ms. (steps per millisecond=872 ) properties seen :0
Successfully simplified 2 atomic propositions for a total of 12 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.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 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.
[2023-03-12 22:02:30] [INFO ] Invariant cache hit.
[2023-03-12 22:02:30] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-12 22:02:30] [INFO ] Invariant cache hit.
[2023-03-12 22:02:30] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-12 22:02:30] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2023-03-12 22:02:30] [INFO ] Invariant cache hit.
[2023-03-12 22:02:31] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 253 ms. Remains : 113/113 places, 180/180 transitions.
Stuttering acceptance computed with spot in 206 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-005-LTLFireability-00 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:(LT s44 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 254 steps with 3 reset in 11 ms.
FORMULA CANInsertWithFailure-PT-005-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-005-LTLFireability-00 finished in 524 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(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 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 113 transition count 145
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 78 transition count 145
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 110 place count 58 transition count 125
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 2 with 12 rules applied. Total rules applied 122 place count 58 transition count 113
Applied a total of 122 rules in 17 ms. Remains 58 /113 variables (removed 55) and now considering 113/180 (removed 67) transitions.
// Phase 1: matrix 113 rows 58 cols
[2023-03-12 22:02:31] [INFO ] Computed 7 place invariants in 3 ms
[2023-03-12 22:02:31] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-12 22:02:31] [INFO ] Invariant cache hit.
[2023-03-12 22:02:31] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-12 22:02:31] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
[2023-03-12 22:02:31] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-12 22:02:31] [INFO ] Invariant cache hit.
[2023-03-12 22:02:31] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 58/113 places, 113/180 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 228 ms. Remains : 58/113 places, 113/180 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-005-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s37 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 44 steps with 1 reset in 1 ms.
FORMULA CANInsertWithFailure-PT-005-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-005-LTLFireability-01 finished in 276 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(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 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 113 transition count 145
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 78 transition count 145
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 108 place count 59 transition count 126
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 2 with 11 rules applied. Total rules applied 119 place count 59 transition count 115
Applied a total of 119 rules in 15 ms. Remains 59 /113 variables (removed 54) and now considering 115/180 (removed 65) transitions.
// Phase 1: matrix 115 rows 59 cols
[2023-03-12 22:02:31] [INFO ] Computed 7 place invariants in 3 ms
[2023-03-12 22:02:31] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-12 22:02:31] [INFO ] Invariant cache hit.
[2023-03-12 22:02:31] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-12 22:02:31] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2023-03-12 22:02:31] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-12 22:02:31] [INFO ] Invariant cache hit.
[2023-03-12 22:02:31] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/113 places, 115/180 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 207 ms. Remains : 59/113 places, 115/180 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-005-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s41 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 58 steps with 1 reset in 0 ms.
FORMULA CANInsertWithFailure-PT-005-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-005-LTLFireability-04 finished in 248 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U (G(p1)||G(p2))))'
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 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.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 63 place count 82 transition count 148
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 81 transition count 148
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 64 place count 81 transition count 147
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 66 place count 80 transition count 147
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 100 place count 63 transition count 130
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 112 place count 63 transition count 118
Applied a total of 112 rules in 15 ms. Remains 63 /113 variables (removed 50) and now considering 118/180 (removed 62) transitions.
// Phase 1: matrix 118 rows 63 cols
[2023-03-12 22:02:31] [INFO ] Computed 7 place invariants in 2 ms
[2023-03-12 22:02:31] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-12 22:02:31] [INFO ] Invariant cache hit.
[2023-03-12 22:02:31] [INFO ] State equation strengthened by 64 read => feed constraints.
[2023-03-12 22:02:31] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2023-03-12 22:02:31] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-12 22:02:31] [INFO ] Invariant cache hit.
[2023-03-12 22:02:31] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/113 places, 118/180 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 191 ms. Remains : 63/113 places, 118/180 transitions.
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p1) p2)]
Running random walk in product with property : CANInsertWithFailure-PT-005-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND p1 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(OR (AND p1 (NOT p0)) (AND p2 (NOT p0))), acceptance={} source=2 dest: 1}, { cond=(OR p1 p2), acceptance={} source=2 dest: 2}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p2), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 2}, { cond=(AND p1 p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(GEQ s32 1), p2:(LT s24 1), p0:(GEQ s59 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 314 steps with 90 reset in 3 ms.
FORMULA CANInsertWithFailure-PT-005-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-005-LTLFireability-05 finished in 393 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(X((F(G(p0))||!(p1 U !p0)))))||!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 3 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
// Phase 1: matrix 180 rows 113 cols
[2023-03-12 22:02:32] [INFO ] Computed 7 place invariants in 2 ms
[2023-03-12 22:02:32] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-12 22:02:32] [INFO ] Invariant cache hit.
[2023-03-12 22:02:32] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-12 22:02:32] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2023-03-12 22:02:32] [INFO ] Invariant cache hit.
[2023-03-12 22:02:32] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 257 ms. Remains : 113/113 places, 180/180 transitions.
Stuttering acceptance computed with spot in 148 ms :[(AND p1 (NOT p0)), (AND p1 (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={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(GEQ s52 1), p0:(LT s38 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 255 ms.
Product exploration explored 100000 steps with 50000 reset in 209 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), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), true, (X (X p0)), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p1))
Knowledge based reduction with 6 factoid took 135 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-005-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-005-LTLFireability-06 finished in 1023 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (p1||(p2 U G(!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 3 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2023-03-12 22:02:33] [INFO ] Invariant cache hit.
[2023-03-12 22:02:33] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-12 22:02:33] [INFO ] Invariant cache hit.
[2023-03-12 22:02:33] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-12 22:02:33] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2023-03-12 22:02:33] [INFO ] Invariant cache hit.
[2023-03-12 22:02:33] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 236 ms. Remains : 113/113 places, 180/180 transitions.
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), p2, p2, true]
Running random walk in product with property : CANInsertWithFailure-PT-005-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(GEQ s89 1), p2:(AND (GEQ s21 1) (GEQ s99 1)), p0:(AND (GEQ s63 1) (GEQ s95 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 281 steps with 2 reset in 1 ms.
FORMULA CANInsertWithFailure-PT-005-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-005-LTLFireability-08 finished in 410 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((X(F(p0))||G(p1))) U G(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 3 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2023-03-12 22:02:33] [INFO ] Invariant cache hit.
[2023-03-12 22:02:33] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-12 22:02:33] [INFO ] Invariant cache hit.
[2023-03-12 22:02:33] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-12 22:02:33] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2023-03-12 22:02:33] [INFO ] Invariant cache hit.
[2023-03-12 22:02:33] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 241 ms. Remains : 113/113 places, 180/180 transitions.
Stuttering acceptance computed with spot in 227 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : CANInsertWithFailure-PT-005-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(AND (GEQ s63 1) (GEQ s87 1)), p1:(GEQ s34 1), p0:(OR (AND (GEQ s63 1) (GEQ s87 1)) (AND (GEQ s55 1) (GEQ s57 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]]
Stuttering criterion allowed to conclude after 127 steps with 1 reset in 0 ms.
FORMULA CANInsertWithFailure-PT-005-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-005-LTLFireability-09 finished in 490 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(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 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 113 transition count 145
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 78 transition count 145
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 108 place count 59 transition count 126
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 2 with 11 rules applied. Total rules applied 119 place count 59 transition count 115
Applied a total of 119 rules in 16 ms. Remains 59 /113 variables (removed 54) and now considering 115/180 (removed 65) transitions.
// Phase 1: matrix 115 rows 59 cols
[2023-03-12 22:02:34] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-12 22:02:34] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-12 22:02:34] [INFO ] Invariant cache hit.
[2023-03-12 22:02:34] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-12 22:02:34] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2023-03-12 22:02:34] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-12 22:02:34] [INFO ] Invariant cache hit.
[2023-03-12 22:02:34] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/113 places, 115/180 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 204 ms. Remains : 59/113 places, 115/180 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-005-LTLFireability-10 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 s34 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 22 steps with 0 reset in 0 ms.
FORMULA CANInsertWithFailure-PT-005-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-005-LTLFireability-10 finished in 273 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(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 1 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
// Phase 1: matrix 180 rows 113 cols
[2023-03-12 22:02:34] [INFO ] Computed 7 place invariants in 8 ms
[2023-03-12 22:02:34] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-12 22:02:34] [INFO ] Invariant cache hit.
[2023-03-12 22:02:34] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-12 22:02:34] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2023-03-12 22:02:34] [INFO ] Invariant cache hit.
[2023-03-12 22:02:34] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 243 ms. Remains : 113/113 places, 180/180 transitions.
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-005-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LT s110 1), p1:(LT s101 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1037 reset in 192 ms.
Stack based approach found an accepted trace after 551 steps with 6 reset with depth 52 and stack size 52 in 2 ms.
FORMULA CANInsertWithFailure-PT-005-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property CANInsertWithFailure-PT-005-LTLFireability-11 finished in 554 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(p0) U p1)||!(!p0 U !p2))))'
Support contains 6 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 1 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2023-03-12 22:02:34] [INFO ] Invariant cache hit.
[2023-03-12 22:02:35] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-12 22:02:35] [INFO ] Invariant cache hit.
[2023-03-12 22:02:35] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-12 22:02:35] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2023-03-12 22:02:35] [INFO ] Invariant cache hit.
[2023-03-12 22:02:35] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 260 ms. Remains : 113/113 places, 180/180 transitions.
Stuttering acceptance computed with spot in 179 ms :[true, (OR (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Running random walk in product with property : CANInsertWithFailure-PT-005-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 5}]], initial=2, aps=[p0:(LT s64 1), p1:(OR (AND (GEQ s110 1) (GEQ s21 1) (GEQ s107 1)) (AND (GEQ s7 1) (GEQ s97 1))), p2:(LT s110 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]]
Product exploration explored 100000 steps with 50000 reset in 161 ms.
Product exploration explored 100000 steps with 50000 reset in 180 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 p0 (NOT p1) p2), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) p0))), (X (X p0)), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p2))))
Knowledge based reduction with 8 factoid took 113 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-005-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-005-LTLFireability-12 finished in 926 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p0 U X(p1)))||X(G(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.
[2023-03-12 22:02:35] [INFO ] Invariant cache hit.
[2023-03-12 22:02:35] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-12 22:02:35] [INFO ] Invariant cache hit.
[2023-03-12 22:02:35] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-12 22:02:36] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
[2023-03-12 22:02:36] [INFO ] Invariant cache hit.
[2023-03-12 22:02:36] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 247 ms. Remains : 113/113 places, 180/180 transitions.
Stuttering acceptance computed with spot in 305 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true, (NOT p2)]
Running random walk in product with property : CANInsertWithFailure-PT-005-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(NOT p2), acceptance={} source=2 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 7}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 8}], [{ cond=(NOT p1), acceptance={} source=4 dest: 7}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}, { cond=p0, acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 6}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=(NOT p2), acceptance={} source=8 dest: 7}, { cond=p2, acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s79 1) (GEQ s41 1) (GEQ s43 1)), p2:(AND (GEQ s1 1) (GEQ s79 1)), p1:(GEQ s100 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA CANInsertWithFailure-PT-005-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-005-LTLFireability-14 finished in 569 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)&&F(p1)))))'
Support contains 4 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 1 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2023-03-12 22:02:36] [INFO ] Invariant cache hit.
[2023-03-12 22:02:36] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-12 22:02:36] [INFO ] Invariant cache hit.
[2023-03-12 22:02:36] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-12 22:02:36] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2023-03-12 22:02:36] [INFO ] Invariant cache hit.
[2023-03-12 22:02:36] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 258 ms. Remains : 113/113 places, 180/180 transitions.
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-005-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=4 dest: 0}, { cond=(NOT p0), acceptance={0} source=4 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(OR (LT s63 1) (LT s79 1)), p1:(OR (LT s49 1) (LT s77 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 171 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 416 ms.
All properties solved by simple procedures.
Total runtime 8350 ms.
ITS solved all properties within timeout

BK_STOP 1678658557046

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ sed s/.jar//
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is 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 r041-tajo-167813695000700"
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 ;