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-167813695100716.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-020, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813695100716
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.1M
-rw-r--r-- 1 mcc users 9.6K Feb 26 00:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 00:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 26 00:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 00:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Feb 26 01:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 173K Feb 26 01:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 00:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 26 00:58 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 2.6M 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-020-LTLFireability-00
FORMULA_NAME CANInsertWithFailure-PT-020-LTLFireability-01
FORMULA_NAME CANInsertWithFailure-PT-020-LTLFireability-02
FORMULA_NAME CANInsertWithFailure-PT-020-LTLFireability-03
FORMULA_NAME CANInsertWithFailure-PT-020-LTLFireability-04
FORMULA_NAME CANInsertWithFailure-PT-020-LTLFireability-05
FORMULA_NAME CANInsertWithFailure-PT-020-LTLFireability-06
FORMULA_NAME CANInsertWithFailure-PT-020-LTLFireability-07
FORMULA_NAME CANInsertWithFailure-PT-020-LTLFireability-08
FORMULA_NAME CANInsertWithFailure-PT-020-LTLFireability-09
FORMULA_NAME CANInsertWithFailure-PT-020-LTLFireability-10
FORMULA_NAME CANInsertWithFailure-PT-020-LTLFireability-11
FORMULA_NAME CANInsertWithFailure-PT-020-LTLFireability-12
FORMULA_NAME CANInsertWithFailure-PT-020-LTLFireability-13
FORMULA_NAME CANInsertWithFailure-PT-020-LTLFireability-14
FORMULA_NAME CANInsertWithFailure-PT-020-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678659086370

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-020
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 22:11:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 22:11:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 22:11:28] [INFO ] Load time of PNML (sax parser for PT used): 153 ms
[2023-03-12 22:11:28] [INFO ] Transformed 1044 places.
[2023-03-12 22:11:28] [INFO ] Transformed 2520 transitions.
[2023-03-12 22:11:28] [INFO ] Parsed PT model containing 1044 places and 2520 transitions and 6800 arcs in 227 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CANInsertWithFailure-PT-020-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-020-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 1044 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1044/1044 places, 2520/2520 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1043 transition count 2520
Applied a total of 1 rules in 96 ms. Remains 1043 /1044 variables (removed 1) and now considering 2520/2520 (removed 0) transitions.
// Phase 1: matrix 2520 rows 1043 cols
[2023-03-12 22:11:28] [INFO ] Computed 22 place invariants in 73 ms
[2023-03-12 22:11:28] [INFO ] Implicit Places using invariants in 502 ms returned []
[2023-03-12 22:11:28] [INFO ] Invariant cache hit.
[2023-03-12 22:11:29] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-12 22:11:31] [INFO ] Implicit Places using invariants and state equation in 2768 ms returned []
Implicit Place search using SMT with State Equation took 3295 ms to find 0 implicit places.
[2023-03-12 22:11:31] [INFO ] Invariant cache hit.
[2023-03-12 22:11:32] [INFO ] Dead Transitions using invariants and state equation in 951 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1043/1044 places, 2520/2520 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4344 ms. Remains : 1043/1044 places, 2520/2520 transitions.
Support contains 37 out of 1043 places after structural reductions.
[2023-03-12 22:11:32] [INFO ] Flatten gal took : 134 ms
[2023-03-12 22:11:33] [INFO ] Flatten gal took : 83 ms
[2023-03-12 22:11:33] [INFO ] Input system was already deterministic with 2520 transitions.
Support contains 34 out of 1043 places (down from 37) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 22 resets, run finished after 385 ms. (steps per millisecond=25 ) properties (out of 24) seen :22
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-12 22:11:33] [INFO ] Invariant cache hit.
[2023-03-12 22:11:33] [INFO ] [Real]Absence check using 20 positive place invariants in 15 ms returned sat
[2023-03-12 22:11:33] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 9 ms returned sat
[2023-03-12 22:11:34] [INFO ] After 505ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 22:11:34] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-12 22:11:34] [INFO ] After 231ms SMT Verify possible using 780 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 22:11:34] [INFO ] After 932ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 22:11:34] [INFO ] [Nat]Absence check using 20 positive place invariants in 14 ms returned sat
[2023-03-12 22:11:34] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 8 ms returned sat
[2023-03-12 22:11:35] [INFO ] After 712ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 22:11:35] [INFO ] After 315ms SMT Verify possible using 780 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 22:11:35] [INFO ] After 442ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 68 ms.
[2023-03-12 22:11:36] [INFO ] After 1426ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 11 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=5 )
Parikh walk visited 1 properties in 5 ms.
FORMULA CANInsertWithFailure-PT-020-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 82 stabilizing places and 140 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(F(p0)))'
Support contains 1 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 26 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
[2023-03-12 22:11:36] [INFO ] Invariant cache hit.
[2023-03-12 22:11:36] [INFO ] Implicit Places using invariants in 349 ms returned []
[2023-03-12 22:11:36] [INFO ] Invariant cache hit.
[2023-03-12 22:11:37] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-12 22:11:39] [INFO ] Implicit Places using invariants and state equation in 2873 ms returned []
Implicit Place search using SMT with State Equation took 3229 ms to find 0 implicit places.
[2023-03-12 22:11:39] [INFO ] Invariant cache hit.
[2023-03-12 22:11:40] [INFO ] Dead Transitions using invariants and state equation in 849 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4105 ms. Remains : 1043/1043 places, 2520/2520 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s454 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 448 steps with 0 reset in 8 ms.
FORMULA CANInsertWithFailure-PT-020-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-020-LTLFireability-01 finished in 4340 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)&&X(p1)))'
Support contains 3 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 22 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
[2023-03-12 22:11:40] [INFO ] Invariant cache hit.
[2023-03-12 22:11:41] [INFO ] Implicit Places using invariants in 330 ms returned []
[2023-03-12 22:11:41] [INFO ] Invariant cache hit.
[2023-03-12 22:11:41] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-12 22:11:44] [INFO ] Implicit Places using invariants and state equation in 3160 ms returned []
Implicit Place search using SMT with State Equation took 3492 ms to find 0 implicit places.
[2023-03-12 22:11:44] [INFO ] Invariant cache hit.
[2023-03-12 22:11:45] [INFO ] Dead Transitions using invariants and state equation in 815 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4331 ms. Remains : 1043/1043 places, 2520/2520 transitions.
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LT s594 1), p1:(OR (LT s203 1) (LT s309 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]]
Product exploration explored 100000 steps with 50000 reset in 674 ms.
Product exploration explored 100000 steps with 50000 reset in 611 ms.
Computed a total of 82 stabilizing places and 140 stable transitions
Computed a total of 82 stabilizing places and 140 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 5 factoid took 104 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-020-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-020-LTLFireability-02 finished in 5879 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||X(p1)))&&X(F((p1||G(!p0))))))'
Support contains 3 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 20 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
[2023-03-12 22:11:46] [INFO ] Invariant cache hit.
[2023-03-12 22:11:46] [INFO ] Implicit Places using invariants in 295 ms returned []
[2023-03-12 22:11:46] [INFO ] Invariant cache hit.
[2023-03-12 22:11:47] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-12 22:11:49] [INFO ] Implicit Places using invariants and state equation in 2900 ms returned []
Implicit Place search using SMT with State Equation took 3197 ms to find 0 implicit places.
[2023-03-12 22:11:49] [INFO ] Invariant cache hit.
[2023-03-12 22:11:50] [INFO ] Dead Transitions using invariants and state equation in 804 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4025 ms. Remains : 1043/1043 places, 2520/2520 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (AND p0 (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s21 1) (GEQ s589 1)), p1:(GEQ s863 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 1270 steps with 2 reset in 6 ms.
FORMULA CANInsertWithFailure-PT-020-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-020-LTLFireability-03 finished in 4161 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(X((F(G(p0)) U p1)))))'
Support contains 5 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 16 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
[2023-03-12 22:11:50] [INFO ] Invariant cache hit.
[2023-03-12 22:11:50] [INFO ] Implicit Places using invariants in 263 ms returned []
[2023-03-12 22:11:50] [INFO ] Invariant cache hit.
[2023-03-12 22:11:51] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-12 22:11:53] [INFO ] Implicit Places using invariants and state equation in 3001 ms returned []
Implicit Place search using SMT with State Equation took 3268 ms to find 0 implicit places.
[2023-03-12 22:11:53] [INFO ] Invariant cache hit.
[2023-03-12 22:11:54] [INFO ] Dead Transitions using invariants and state equation in 834 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4121 ms. Remains : 1043/1043 places, 2520/2520 transitions.
Stuttering acceptance computed with spot in 168 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s942 1) (OR (GEQ s780 1) (AND (GEQ s0 1) (GEQ s199 1)))), p0:(LT s882 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 213 reset in 353 ms.
Product exploration explored 100000 steps with 214 reset in 446 ms.
Computed a total of 82 stabilizing places and 140 stable transitions
Computed a total of 82 stabilizing places and 140 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 84 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 19 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 22:11:56] [INFO ] Invariant cache hit.
[2023-03-12 22:11:56] [INFO ] [Real]Absence check using 20 positive place invariants in 9 ms returned sat
[2023-03-12 22:11:56] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 10 ms returned sat
[2023-03-12 22:11:56] [INFO ] After 138ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 22:11:56] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2023-03-12 22:11:56] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 9 ms returned sat
[2023-03-12 22:11:56] [INFO ] After 518ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 22:11:56] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-12 22:11:57] [INFO ] After 207ms SMT Verify possible using 780 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 22:11:57] [INFO ] After 377ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 63 ms.
[2023-03-12 22:11:57] [INFO ] After 1105ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 11 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=5 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 101 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 135 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0)]
[2023-03-12 22:11:57] [INFO ] Invariant cache hit.
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : [(F p1), (F (NOT p0)), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 2 factoid took 72 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-020-LTLFireability-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-020-LTLFireability-04 finished in 7993 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 1043 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions removed 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 0 with 140 rules applied. Total rules applied 140 place count 1043 transition count 2380
Reduce places removed 140 places and 0 transitions.
Iterating post reduction 1 with 140 rules applied. Total rules applied 280 place count 903 transition count 2380
Performed 380 Post agglomeration using F-continuation condition.Transition count delta: 380
Deduced a syphon composed of 380 places in 0 ms
Reduce places removed 380 places and 0 transitions.
Iterating global reduction 2 with 760 rules applied. Total rules applied 1040 place count 523 transition count 2000
Drop transitions removed 342 transitions
Redundant transition composition rules discarded 342 transitions
Iterating global reduction 2 with 342 rules applied. Total rules applied 1382 place count 523 transition count 1658
Applied a total of 1382 rules in 183 ms. Remains 523 /1043 variables (removed 520) and now considering 1658/2520 (removed 862) transitions.
// Phase 1: matrix 1658 rows 523 cols
[2023-03-12 22:11:58] [INFO ] Computed 22 place invariants in 19 ms
[2023-03-12 22:11:59] [INFO ] Implicit Places using invariants in 305 ms returned []
[2023-03-12 22:11:59] [INFO ] Invariant cache hit.
[2023-03-12 22:11:59] [INFO ] State equation strengthened by 1178 read => feed constraints.
[2023-03-12 22:12:00] [INFO ] Implicit Places using invariants and state equation in 1753 ms returned []
Implicit Place search using SMT with State Equation took 2061 ms to find 0 implicit places.
[2023-03-12 22:12:01] [INFO ] Redundant transitions in 162 ms returned []
[2023-03-12 22:12:01] [INFO ] Invariant cache hit.
[2023-03-12 22:12:01] [INFO ] Dead Transitions using invariants and state equation in 495 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 523/1043 places, 1658/2520 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2909 ms. Remains : 523/1043 places, 1658/2520 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-020-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 s482 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 103 steps with 0 reset in 1 ms.
FORMULA CANInsertWithFailure-PT-020-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-020-LTLFireability-05 finished in 2979 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(F(p1)))))'
Support contains 2 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 24 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
// Phase 1: matrix 2520 rows 1043 cols
[2023-03-12 22:12:01] [INFO ] Computed 22 place invariants in 31 ms
[2023-03-12 22:12:02] [INFO ] Implicit Places using invariants in 299 ms returned []
[2023-03-12 22:12:02] [INFO ] Invariant cache hit.
[2023-03-12 22:12:02] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-12 22:12:04] [INFO ] Implicit Places using invariants and state equation in 2838 ms returned []
Implicit Place search using SMT with State Equation took 3140 ms to find 0 implicit places.
[2023-03-12 22:12:04] [INFO ] Invariant cache hit.
[2023-03-12 22:12:05] [INFO ] Dead Transitions using invariants and state equation in 839 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4008 ms. Remains : 1043/1043 places, 2520/2520 transitions.
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s506 1), p1:(GEQ s702 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CANInsertWithFailure-PT-020-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-020-LTLFireability-06 finished in 4150 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 1043 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions removed 139 transitions
Trivial Post-agglo rules discarded 139 transitions
Performed 139 trivial Post agglomeration. Transition count delta: 139
Iterating post reduction 0 with 139 rules applied. Total rules applied 139 place count 1043 transition count 2381
Reduce places removed 139 places and 0 transitions.
Iterating post reduction 1 with 139 rules applied. Total rules applied 278 place count 904 transition count 2381
Performed 379 Post agglomeration using F-continuation condition.Transition count delta: 379
Deduced a syphon composed of 379 places in 1 ms
Reduce places removed 379 places and 0 transitions.
Iterating global reduction 2 with 758 rules applied. Total rules applied 1036 place count 525 transition count 2002
Drop transitions removed 341 transitions
Redundant transition composition rules discarded 341 transitions
Iterating global reduction 2 with 341 rules applied. Total rules applied 1377 place count 525 transition count 1661
Applied a total of 1377 rules in 144 ms. Remains 525 /1043 variables (removed 518) and now considering 1661/2520 (removed 859) transitions.
// Phase 1: matrix 1661 rows 525 cols
[2023-03-12 22:12:06] [INFO ] Computed 22 place invariants in 29 ms
[2023-03-12 22:12:06] [INFO ] Implicit Places using invariants in 227 ms returned []
[2023-03-12 22:12:06] [INFO ] Invariant cache hit.
[2023-03-12 22:12:06] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2023-03-12 22:12:07] [INFO ] Implicit Places using invariants and state equation in 1738 ms returned []
Implicit Place search using SMT with State Equation took 1967 ms to find 0 implicit places.
[2023-03-12 22:12:07] [INFO ] Redundant transitions in 46 ms returned []
[2023-03-12 22:12:08] [INFO ] Invariant cache hit.
[2023-03-12 22:12:08] [INFO ] Dead Transitions using invariants and state equation in 552 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 525/1043 places, 1661/2520 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2715 ms. Remains : 525/1043 places, 1661/2520 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s375 1) (LT s29 1) (LT s268 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 961 reset in 426 ms.
Stack based approach found an accepted trace after 40049 steps with 385 reset with depth 88 and stack size 88 in 176 ms.
FORMULA CANInsertWithFailure-PT-020-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property CANInsertWithFailure-PT-020-LTLFireability-07 finished in 3371 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(X(p1)))))'
Support contains 3 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 17 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
// Phase 1: matrix 2520 rows 1043 cols
[2023-03-12 22:12:09] [INFO ] Computed 22 place invariants in 29 ms
[2023-03-12 22:12:09] [INFO ] Implicit Places using invariants in 356 ms returned []
[2023-03-12 22:12:09] [INFO ] Invariant cache hit.
[2023-03-12 22:12:10] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-12 22:12:12] [INFO ] Implicit Places using invariants and state equation in 2791 ms returned []
Implicit Place search using SMT with State Equation took 3156 ms to find 0 implicit places.
[2023-03-12 22:12:12] [INFO ] Invariant cache hit.
[2023-03-12 22:12:13] [INFO ] Dead Transitions using invariants and state equation in 838 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4012 ms. Remains : 1043/1043 places, 2520/2520 transitions.
Stuttering acceptance computed with spot in 200 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1), p0]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 4}, { cond=(NOT p0), acceptance={} source=3 dest: 6}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 7}], [{ cond=p0, acceptance={} source=7 dest: 5}, { cond=(NOT p0), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(AND (GEQ s77 1) (GEQ s443 1)), p1:(GEQ s192 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][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3785 steps with 8 reset in 14 ms.
FORMULA CANInsertWithFailure-PT-020-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-020-LTLFireability-08 finished in 4248 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 18 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
[2023-03-12 22:12:13] [INFO ] Invariant cache hit.
[2023-03-12 22:12:13] [INFO ] Implicit Places using invariants in 257 ms returned []
[2023-03-12 22:12:13] [INFO ] Invariant cache hit.
[2023-03-12 22:12:14] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-12 22:12:16] [INFO ] Implicit Places using invariants and state equation in 2674 ms returned []
Implicit Place search using SMT with State Equation took 2933 ms to find 0 implicit places.
[2023-03-12 22:12:16] [INFO ] Invariant cache hit.
[2023-03-12 22:12:17] [INFO ] Dead Transitions using invariants and state equation in 832 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3784 ms. Remains : 1043/1043 places, 2520/2520 transitions.
Stuttering acceptance computed with spot in 56 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LT s840 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 6565 steps with 15 reset in 22 ms.
FORMULA CANInsertWithFailure-PT-020-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-020-LTLFireability-10 finished in 3877 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(p1)||p0))||F(p2)))'
Support contains 5 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 27 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
[2023-03-12 22:12:17] [INFO ] Invariant cache hit.
[2023-03-12 22:12:17] [INFO ] Implicit Places using invariants in 262 ms returned []
[2023-03-12 22:12:17] [INFO ] Invariant cache hit.
[2023-03-12 22:12:18] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-12 22:12:19] [INFO ] Implicit Places using invariants and state equation in 2308 ms returned []
Implicit Place search using SMT with State Equation took 2570 ms to find 0 implicit places.
[2023-03-12 22:12:19] [INFO ] Invariant cache hit.
[2023-03-12 22:12:20] [INFO ] Dead Transitions using invariants and state equation in 851 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3450 ms. Remains : 1043/1043 places, 2520/2520 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p2:(AND (GEQ s35 1) (GEQ s401 1)), p0:(OR (AND (GEQ s548 1) (GEQ s311 1)) (LT s924 1)), p1:(GEQ s924 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 586 ms.
Product exploration explored 100000 steps with 50000 reset in 557 ms.
Computed a total of 82 stabilizing places and 140 stable transitions
Computed a total of 82 stabilizing places and 140 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p2)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))
Knowledge based reduction with 6 factoid took 90 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-020-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-020-LTLFireability-11 finished in 4835 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||G(p1)||(p2&&G(!p1)))))'
Support contains 4 out of 1043 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions removed 138 transitions
Trivial Post-agglo rules discarded 138 transitions
Performed 138 trivial Post agglomeration. Transition count delta: 138
Iterating post reduction 0 with 138 rules applied. Total rules applied 138 place count 1043 transition count 2382
Reduce places removed 138 places and 0 transitions.
Iterating post reduction 1 with 138 rules applied. Total rules applied 276 place count 905 transition count 2382
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 276 place count 905 transition count 2381
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 278 place count 904 transition count 2381
Performed 379 Post agglomeration using F-continuation condition.Transition count delta: 379
Deduced a syphon composed of 379 places in 0 ms
Reduce places removed 379 places and 0 transitions.
Iterating global reduction 2 with 758 rules applied. Total rules applied 1036 place count 525 transition count 2002
Drop transitions removed 342 transitions
Redundant transition composition rules discarded 342 transitions
Iterating global reduction 2 with 342 rules applied. Total rules applied 1378 place count 525 transition count 1660
Applied a total of 1378 rules in 120 ms. Remains 525 /1043 variables (removed 518) and now considering 1660/2520 (removed 860) transitions.
// Phase 1: matrix 1660 rows 525 cols
[2023-03-12 22:12:22] [INFO ] Computed 22 place invariants in 14 ms
[2023-03-12 22:12:22] [INFO ] Implicit Places using invariants in 233 ms returned []
[2023-03-12 22:12:22] [INFO ] Invariant cache hit.
[2023-03-12 22:12:22] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2023-03-12 22:12:24] [INFO ] Implicit Places using invariants and state equation in 1561 ms returned []
Implicit Place search using SMT with State Equation took 1809 ms to find 0 implicit places.
[2023-03-12 22:12:24] [INFO ] Redundant transitions in 96 ms returned []
[2023-03-12 22:12:24] [INFO ] Invariant cache hit.
[2023-03-12 22:12:24] [INFO ] Dead Transitions using invariants and state equation in 595 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 525/1043 places, 1660/2520 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2641 ms. Remains : 525/1043 places, 1660/2520 transitions.
Stuttering acceptance computed with spot in 96 ms :[true, (AND (NOT p0) (NOT p1) (NOT p2)), (OR p1 (AND (NOT p0) (NOT p2))), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p2)) p1), acceptance={} source=2 dest: 0}, { cond=(OR (AND p0 (NOT p1)) (AND (NOT p1) p2)), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (GEQ s11 1) (GEQ s19 1)), p1:(GEQ s255 1), p2:(LT s521 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 475 steps with 4 reset in 4 ms.
FORMULA CANInsertWithFailure-PT-020-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-020-LTLFireability-12 finished in 2756 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))))'
Support contains 1 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 19 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
// Phase 1: matrix 2520 rows 1043 cols
[2023-03-12 22:12:24] [INFO ] Computed 22 place invariants in 25 ms
[2023-03-12 22:12:25] [INFO ] Implicit Places using invariants in 382 ms returned []
[2023-03-12 22:12:25] [INFO ] Invariant cache hit.
[2023-03-12 22:12:25] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-12 22:12:28] [INFO ] Implicit Places using invariants and state equation in 3145 ms returned []
Implicit Place search using SMT with State Equation took 3529 ms to find 0 implicit places.
[2023-03-12 22:12:28] [INFO ] Invariant cache hit.
[2023-03-12 22:12:29] [INFO ] Dead Transitions using invariants and state equation in 796 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4345 ms. Remains : 1043/1043 places, 2520/2520 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(GEQ s495 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 542 steps with 0 reset in 2 ms.
FORMULA CANInsertWithFailure-PT-020-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-020-LTLFireability-13 finished in 4439 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(p0)) U G(p1))))'
Support contains 2 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 17 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
[2023-03-12 22:12:29] [INFO ] Invariant cache hit.
[2023-03-12 22:12:29] [INFO ] Implicit Places using invariants in 273 ms returned []
[2023-03-12 22:12:29] [INFO ] Invariant cache hit.
[2023-03-12 22:12:30] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-12 22:12:32] [INFO ] Implicit Places using invariants and state equation in 3219 ms returned []
Implicit Place search using SMT with State Equation took 3494 ms to find 0 implicit places.
[2023-03-12 22:12:32] [INFO ] Invariant cache hit.
[2023-03-12 22:12:33] [INFO ] Dead Transitions using invariants and state equation in 808 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4320 ms. Remains : 1043/1043 places, 2520/2520 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(GEQ s782 1), p0:(GEQ s792 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 474 steps with 3 reset in 2 ms.
FORMULA CANInsertWithFailure-PT-020-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-020-LTLFireability-14 finished in 4456 ms.
All properties solved by simple procedures.
Total runtime 65917 ms.
ITS solved all properties within timeout

BK_STOP 1678659153958

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

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

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-020"
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-020, 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-167813695100716"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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