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.r423-tajo-167905976500276.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 lolaxred
Input is ShieldRVt-PT-020A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r423-tajo-167905976500276
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 7.7K Feb 25 23:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Feb 25 23:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 23:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 23:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Feb 25 23:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Feb 25 23:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 25 23:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 23:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 54K Mar 5 18:23 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 ShieldRVt-PT-020A-LTLFireability-00
FORMULA_NAME ShieldRVt-PT-020A-LTLFireability-01
FORMULA_NAME ShieldRVt-PT-020A-LTLFireability-02
FORMULA_NAME ShieldRVt-PT-020A-LTLFireability-03
FORMULA_NAME ShieldRVt-PT-020A-LTLFireability-04
FORMULA_NAME ShieldRVt-PT-020A-LTLFireability-05
FORMULA_NAME ShieldRVt-PT-020A-LTLFireability-06
FORMULA_NAME ShieldRVt-PT-020A-LTLFireability-07
FORMULA_NAME ShieldRVt-PT-020A-LTLFireability-08
FORMULA_NAME ShieldRVt-PT-020A-LTLFireability-09
FORMULA_NAME ShieldRVt-PT-020A-LTLFireability-10
FORMULA_NAME ShieldRVt-PT-020A-LTLFireability-11
FORMULA_NAME ShieldRVt-PT-020A-LTLFireability-12
FORMULA_NAME ShieldRVt-PT-020A-LTLFireability-13
FORMULA_NAME ShieldRVt-PT-020A-LTLFireability-14
FORMULA_NAME ShieldRVt-PT-020A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679245379560

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-020A
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 17:03:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 17:03:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 17:03:01] [INFO ] Load time of PNML (sax parser for PT used): 44 ms
[2023-03-19 17:03:01] [INFO ] Transformed 163 places.
[2023-03-19 17:03:01] [INFO ] Transformed 163 transitions.
[2023-03-19 17:03:01] [INFO ] Found NUPN structural information;
[2023-03-19 17:03:01] [INFO ] Parsed PT model containing 163 places and 163 transitions and 686 arcs in 104 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldRVt-PT-020A-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-020A-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-020A-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-020A-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 53 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 162/162 transitions.
Applied a total of 0 rules in 24 ms. Remains 163 /163 variables (removed 0) and now considering 162/162 (removed 0) transitions.
// Phase 1: matrix 162 rows 163 cols
[2023-03-19 17:03:01] [INFO ] Computed 81 place invariants in 7 ms
[2023-03-19 17:03:01] [INFO ] Implicit Places using invariants in 271 ms returned []
[2023-03-19 17:03:01] [INFO ] Invariant cache hit.
[2023-03-19 17:03:01] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 454 ms to find 0 implicit places.
[2023-03-19 17:03:01] [INFO ] Invariant cache hit.
[2023-03-19 17:03:02] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 619 ms. Remains : 163/163 places, 162/162 transitions.
Support contains 53 out of 163 places after structural reductions.
[2023-03-19 17:03:02] [INFO ] Flatten gal took : 46 ms
[2023-03-19 17:03:02] [INFO ] Flatten gal took : 17 ms
[2023-03-19 17:03:02] [INFO ] Input system was already deterministic with 162 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 491 ms. (steps per millisecond=20 ) properties (out of 32) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 12) seen :3
Running SMT prover for 9 properties.
[2023-03-19 17:03:03] [INFO ] Invariant cache hit.
[2023-03-19 17:03:03] [INFO ] [Real]Absence check using 81 positive place invariants in 10 ms returned sat
[2023-03-19 17:03:03] [INFO ] After 254ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-19 17:03:03] [INFO ] [Nat]Absence check using 81 positive place invariants in 8 ms returned sat
[2023-03-19 17:03:03] [INFO ] After 114ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-19 17:03:04] [INFO ] After 220ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 81 ms.
[2023-03-19 17:03:04] [INFO ] After 400ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Finished Parikh walk after 198 steps, including 0 resets, run visited all 9 properties in 6 ms. (steps per millisecond=33 )
Parikh walk visited 9 properties in 6 ms.
Computed a total of 1 stabilizing places and 1 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' '!(F((G((p0||(p1 U p2)))&&X(G(p3)))))'
Support contains 6 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 162/162 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 162 transition count 161
Applied a total of 2 rules in 46 ms. Remains 162 /163 variables (removed 1) and now considering 161/162 (removed 1) transitions.
// Phase 1: matrix 161 rows 162 cols
[2023-03-19 17:03:04] [INFO ] Computed 81 place invariants in 4 ms
[2023-03-19 17:03:04] [INFO ] Implicit Places using invariants in 137 ms returned [155]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 139 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 161/163 places, 161/162 transitions.
Applied a total of 0 rules in 10 ms. Remains 161 /161 variables (removed 0) and now considering 161/161 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 196 ms. Remains : 161/163 places, 161/162 transitions.
Stuttering acceptance computed with spot in 447 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2)), (NOT p3), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : ShieldRVt-PT-020A-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=0 dest: 1}, { cond=(OR p0 p2 p1), acceptance={1} source=0 dest: 2}, { cond=(OR p0 p2 p1), acceptance={0, 1} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1} source=1 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={1} source=1 dest: 4}, { cond=(AND p0 (NOT p2) p1), acceptance={0, 1} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=2 dest: 1}, { cond=(OR p0 p2 p1), acceptance={1} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1 (NOT p3)), acceptance={0, 1} source=3 dest: 1}, { cond=(OR (AND p0 (NOT p3)) (AND p2 (NOT p3)) (AND p1 (NOT p3))), acceptance={1} source=3 dest: 2}, { cond=p3, acceptance={0} source=3 dest: 3}, { cond=(OR (AND p0 (NOT p3)) (AND p2 (NOT p3)) (AND p1 (NOT p3))), acceptance={0, 1} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1} source=4 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={1} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), acceptance={0, 1} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1 (NOT p3)), acceptance={0, 1} source=5 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1) (NOT p3)), acceptance={1} source=5 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p3), acceptance={0} source=5 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1) (NOT p3)), acceptance={0, 1} source=5 dest: 3}, { cond=(AND p0 (NOT p2) p1 (NOT p3)), acceptance={1} source=5 dest: 4}, { cond=(AND (NOT p2) p1 p3), acceptance={0} source=5 dest: 5}, { cond=(AND p0 (NOT p2) p1 (NOT p3)), acceptance={0, 1} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s145 1), p2:(EQ s0 1), p1:(AND (EQ s12 1) (EQ s13 1) (EQ s16 1)), p3:(EQ s65 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 572 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 1 ms.
FORMULA ShieldRVt-PT-020A-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-020A-LTLFireability-00 finished in 1324 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||G(!p0)))&&(p2||(F(p4)&&p3)))))'
Support contains 7 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 162/162 transitions.
Applied a total of 0 rules in 8 ms. Remains 163 /163 variables (removed 0) and now considering 162/162 (removed 0) transitions.
// Phase 1: matrix 162 rows 163 cols
[2023-03-19 17:03:05] [INFO ] Computed 81 place invariants in 3 ms
[2023-03-19 17:03:06] [INFO ] Implicit Places using invariants in 157 ms returned []
[2023-03-19 17:03:06] [INFO ] Invariant cache hit.
[2023-03-19 17:03:06] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
[2023-03-19 17:03:06] [INFO ] Invariant cache hit.
[2023-03-19 17:03:06] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 458 ms. Remains : 163/163 places, 162/162 transitions.
Stuttering acceptance computed with spot in 187 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p4)) (AND p0 (NOT p1))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p4)) (AND p0 (NOT p1))), true, (NOT p4), (AND (NOT p1) p0)]
Running random walk in product with property : ShieldRVt-PT-020A-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) p0)), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p2) p3 (NOT p4) p1) (AND (NOT p2) p3 (NOT p4) (NOT p0))), acceptance={} source=1 dest: 3}, { cond=(OR (AND p2 (NOT p1) (NOT p0)) (AND p3 (NOT p1) (NOT p0))), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p4), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s78 1) (EQ s81 1)), p3:(AND (EQ s123 1) (EQ s132 1) (EQ s138 1)), p1:(NEQ s57 1), p0:(AND (EQ s123 1) (EQ s132 1) (EQ s138 1)), p4:(EQ s77 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 ShieldRVt-PT-020A-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020A-LTLFireability-01 finished in 685 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) U (G(F(p1))||G(p0))))'
Support contains 3 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 162/162 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 162 transition count 161
Applied a total of 2 rules in 16 ms. Remains 162 /163 variables (removed 1) and now considering 161/162 (removed 1) transitions.
// Phase 1: matrix 161 rows 162 cols
[2023-03-19 17:03:06] [INFO ] Computed 81 place invariants in 1 ms
[2023-03-19 17:03:06] [INFO ] Implicit Places using invariants in 113 ms returned [155]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 114 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 161/163 places, 161/162 transitions.
Applied a total of 0 rules in 7 ms. Remains 161 /161 variables (removed 0) and now considering 161/161 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 137 ms. Remains : 161/163 places, 161/162 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-020A-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s5 1), p0:(AND (EQ s158 1) (EQ s160 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 331 ms.
Stack based approach found an accepted trace after 14 steps with 0 reset with depth 15 and stack size 15 in 1 ms.
FORMULA ShieldRVt-PT-020A-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-020A-LTLFireability-03 finished in 557 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(F((p0||X(X(p1))))))'
Support contains 5 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 162/162 transitions.
Applied a total of 0 rules in 2 ms. Remains 163 /163 variables (removed 0) and now considering 162/162 (removed 0) transitions.
// Phase 1: matrix 162 rows 163 cols
[2023-03-19 17:03:07] [INFO ] Computed 81 place invariants in 7 ms
[2023-03-19 17:03:07] [INFO ] Implicit Places using invariants in 120 ms returned []
[2023-03-19 17:03:07] [INFO ] Invariant cache hit.
[2023-03-19 17:03:07] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
[2023-03-19 17:03:07] [INFO ] Invariant cache hit.
[2023-03-19 17:03:07] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 438 ms. Remains : 163/163 places, 162/162 transitions.
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-020A-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}]], initial=0, aps=[p0:(AND (EQ s56 1) (EQ s58 1) (EQ s63 1)), p1:(AND (EQ s43 1) (EQ s52 1) (EQ s58 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 8 reset in 338 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 0 ms.
FORMULA ShieldRVt-PT-020A-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-020A-LTLFireability-05 finished in 945 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&&X(p1)))))'
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 162/162 transitions.
Applied a total of 0 rules in 2 ms. Remains 163 /163 variables (removed 0) and now considering 162/162 (removed 0) transitions.
[2023-03-19 17:03:08] [INFO ] Invariant cache hit.
[2023-03-19 17:03:08] [INFO ] Implicit Places using invariants in 123 ms returned []
[2023-03-19 17:03:08] [INFO ] Invariant cache hit.
[2023-03-19 17:03:08] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
[2023-03-19 17:03:08] [INFO ] Invariant cache hit.
[2023-03-19 17:03:08] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 396 ms. Remains : 163/163 places, 162/162 transitions.
Stuttering acceptance computed with spot in 109 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-020A-LTLFireability-08 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: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (EQ s116 0) (EQ s117 0) (EQ s120 0)), p1:(OR (AND (EQ s116 1) (EQ s117 1) (EQ s120 1)) (EQ s69 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-020A-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020A-LTLFireability-08 finished in 532 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||X(((p1||X(p0)) U (p2||F(G(!p3))))))))'
Support contains 6 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 162/162 transitions.
Applied a total of 0 rules in 3 ms. Remains 163 /163 variables (removed 0) and now considering 162/162 (removed 0) transitions.
[2023-03-19 17:03:08] [INFO ] Invariant cache hit.
[2023-03-19 17:03:08] [INFO ] Implicit Places using invariants in 104 ms returned []
[2023-03-19 17:03:08] [INFO ] Invariant cache hit.
[2023-03-19 17:03:08] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
[2023-03-19 17:03:08] [INFO ] Invariant cache hit.
[2023-03-19 17:03:09] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 408 ms. Remains : 163/163 places, 162/162 transitions.
Stuttering acceptance computed with spot in 253 ms :[(AND (NOT p0) (NOT p2) p3), (AND (NOT p0) (NOT p2) p3), (AND (NOT p2) p3), (AND (NOT p0) p3), p3]
Running random walk in product with property : ShieldRVt-PT-020A-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p3), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(NOT p3), acceptance={} source=4 dest: 4}, { cond=p3, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s45 1), p2:(EQ s37 1), p3:(EQ s5 1), p1:(AND (EQ s60 1) (EQ s61 1) (EQ s64 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 0 reset in 323 ms.
Product exploration explored 100000 steps with 0 reset in 387 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) p3))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 256 ms. Reduced automaton from 5 states, 8 edges and 4 AP (stutter sensitive) to 5 states, 8 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 230 ms :[(AND (NOT p2) p3), (AND (NOT p2) p3), (AND (NOT p2) p3), (AND (NOT p0) p3), p3]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 248 ms. (steps per millisecond=40 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Finished probabilistic random walk after 1351 steps, run visited all 5 properties in 35 ms. (steps per millisecond=38 )
Probabilistic random walk after 1351 steps, saw 1276 distinct states, run finished after 36 ms. (steps per millisecond=37 ) properties seen :5
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) p3))))]
False Knowledge obtained : [(F p3), (F p0), (F (NOT (AND (NOT p2) (NOT p3)))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND (NOT p2) p3))]
Knowledge based reduction with 5 factoid took 345 ms. Reduced automaton from 5 states, 8 edges and 4 AP (stutter sensitive) to 5 states, 8 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 296 ms :[(AND (NOT p2) p3), (AND (NOT p2) p3), (AND (NOT p2) p3), (AND (NOT p0) p3), p3]
Stuttering acceptance computed with spot in 228 ms :[(AND (NOT p2) p3), (AND (NOT p2) p3), (AND (NOT p2) p3), (AND (NOT p0) p3), p3]
Support contains 6 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 162/162 transitions.
Applied a total of 0 rules in 2 ms. Remains 163 /163 variables (removed 0) and now considering 162/162 (removed 0) transitions.
[2023-03-19 17:03:11] [INFO ] Invariant cache hit.
[2023-03-19 17:03:12] [INFO ] Implicit Places using invariants in 134 ms returned []
[2023-03-19 17:03:12] [INFO ] Invariant cache hit.
[2023-03-19 17:03:12] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
[2023-03-19 17:03:12] [INFO ] Invariant cache hit.
[2023-03-19 17:03:12] [INFO ] Dead Transitions using invariants and state equation in 197 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 522 ms. Remains : 163/163 places, 162/162 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), (X (X (AND (NOT p2) (NOT p3)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p2) p3))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 274 ms. Reduced automaton from 5 states, 8 edges and 4 AP (stutter sensitive) to 5 states, 8 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 377 ms :[(AND (NOT p2) p3), (AND (NOT p2) p3), (AND (NOT p2) p3), (AND (NOT p0) p3), p3]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 237 ms. (steps per millisecond=42 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-19 17:03:13] [INFO ] Invariant cache hit.
[2023-03-19 17:03:13] [INFO ] [Real]Absence check using 81 positive place invariants in 17 ms returned sat
[2023-03-19 17:03:13] [INFO ] After 225ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 17:03:13] [INFO ] [Nat]Absence check using 81 positive place invariants in 15 ms returned sat
[2023-03-19 17:03:14] [INFO ] After 117ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 17:03:14] [INFO ] After 162ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-19 17:03:14] [INFO ] After 336ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 124 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=124 )
Parikh walk visited 3 properties in 4 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), (X (X (AND (NOT p2) (NOT p3)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p2) p3))))]
False Knowledge obtained : [(F p3), (F p0), (F (NOT (AND (NOT p2) (NOT p3)))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND (NOT p2) p3))]
Knowledge based reduction with 4 factoid took 330 ms. Reduced automaton from 5 states, 8 edges and 4 AP (stutter sensitive) to 5 states, 8 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 341 ms :[(AND (NOT p2) p3), (AND (NOT p2) p3), (AND (NOT p2) p3), (AND (NOT p0) p3), p3]
Stuttering acceptance computed with spot in 238 ms :[(AND (NOT p2) p3), (AND (NOT p2) p3), (AND (NOT p2) p3), (AND (NOT p0) p3), p3]
Stuttering acceptance computed with spot in 351 ms :[(AND (NOT p2) p3), (AND (NOT p2) p3), (AND (NOT p2) p3), (AND (NOT p0) p3), p3]
Product exploration explored 100000 steps with 0 reset in 329 ms.
Product exploration explored 100000 steps with 0 reset in 444 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 281 ms :[(AND (NOT p2) p3), (AND (NOT p2) p3), (AND (NOT p2) p3), (AND (NOT p0) p3), p3]
Support contains 6 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 162/162 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 163 transition count 162
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 27 ms. Remains 163 /163 variables (removed 0) and now considering 162/162 (removed 0) transitions.
[2023-03-19 17:03:16] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 162 rows 163 cols
[2023-03-19 17:03:16] [INFO ] Computed 81 place invariants in 3 ms
[2023-03-19 17:03:16] [INFO ] Dead Transitions using invariants and state equation in 202 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 163/163 places, 162/162 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 256 ms. Remains : 163/163 places, 162/162 transitions.
Support contains 6 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 162/162 transitions.
Applied a total of 0 rules in 3 ms. Remains 163 /163 variables (removed 0) and now considering 162/162 (removed 0) transitions.
// Phase 1: matrix 162 rows 163 cols
[2023-03-19 17:03:16] [INFO ] Computed 81 place invariants in 2 ms
[2023-03-19 17:03:17] [INFO ] Implicit Places using invariants in 161 ms returned []
[2023-03-19 17:03:17] [INFO ] Invariant cache hit.
[2023-03-19 17:03:17] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
[2023-03-19 17:03:17] [INFO ] Invariant cache hit.
[2023-03-19 17:03:17] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 486 ms. Remains : 163/163 places, 162/162 transitions.
Treatment of property ShieldRVt-PT-020A-LTLFireability-09 finished in 8870 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))&&(G((p1||X(p1))) U G(p2)))))'
Support contains 7 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 162/162 transitions.
Applied a total of 0 rules in 2 ms. Remains 163 /163 variables (removed 0) and now considering 162/162 (removed 0) transitions.
[2023-03-19 17:03:17] [INFO ] Invariant cache hit.
[2023-03-19 17:03:17] [INFO ] Implicit Places using invariants in 149 ms returned []
[2023-03-19 17:03:17] [INFO ] Invariant cache hit.
[2023-03-19 17:03:17] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
[2023-03-19 17:03:17] [INFO ] Invariant cache hit.
[2023-03-19 17:03:17] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 457 ms. Remains : 163/163 places, 162/162 transitions.
Stuttering acceptance computed with spot in 319 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p1), (AND p2 (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1)), true, (NOT p2)]
Running random walk in product with property : ShieldRVt-PT-020A-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 4}, { cond=true, acceptance={} source=1 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 6}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 7}], [{ cond=(NOT p1), acceptance={} source=3 dest: 7}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}, { cond=(NOT p2), acceptance={0} source=5 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 7}, { cond=(AND p2 (NOT p1)), acceptance={} source=6 dest: 8}], [{ 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=[p2:(AND (EQ s100 1) (EQ s101 1) (EQ s104 1)), p1:(AND (EQ s75 1) (EQ s84 1) (EQ s90 1)), p0:(EQ s79 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], 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 2 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-020A-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020A-LTLFireability-10 finished in 838 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(X((!((F((F(p0)&&F(p1)))||p0) U p2)||p3))))'
Support contains 8 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 162/162 transitions.
Applied a total of 0 rules in 2 ms. Remains 163 /163 variables (removed 0) and now considering 162/162 (removed 0) transitions.
[2023-03-19 17:03:18] [INFO ] Invariant cache hit.
[2023-03-19 17:03:18] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-19 17:03:18] [INFO ] Invariant cache hit.
[2023-03-19 17:03:18] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
[2023-03-19 17:03:18] [INFO ] Invariant cache hit.
[2023-03-19 17:03:18] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 363 ms. Remains : 163/163 places, 162/162 transitions.
Stuttering acceptance computed with spot in 410 ms :[(AND p2 (NOT p3)), (AND p2 (NOT p3)), true, (AND p2 p3), (AND p3 p2 p0 p1), (AND p0 p2 p3), p0, p1, (AND p0 p1), (AND p1 p2 p3)]
Running random walk in product with property : ShieldRVt-PT-020A-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p3 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p3) p0 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p3) (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p3 p2), acceptance={} source=3 dest: 2}, { cond=(AND p3 p0 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p3 (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p3 (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(AND p3 p0 p1 p2), acceptance={} source=4 dest: 2}, { cond=(AND p3 p0 p1 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p3 (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND p3 (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=4 dest: 6}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 7}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 8}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 9}], [{ cond=(AND p3 p0 p2), acceptance={} source=5 dest: 2}, { cond=(AND p3 p0 (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND p3 (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND p3 (NOT p0) p1 (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 6}], [{ cond=p0, acceptance={} source=6 dest: 2}, { cond=(NOT p0), acceptance={} source=6 dest: 6}], [{ cond=p1, acceptance={} source=7 dest: 2}, { cond=(NOT p1), acceptance={} source=7 dest: 7}], [{ cond=(AND p0 p1), acceptance={} source=8 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 8}], [{ cond=(AND p3 p1 p2), acceptance={} source=9 dest: 2}, { cond=(AND p3 p0 p1 (NOT p2)), acceptance={} source=9 dest: 3}, { cond=(AND p3 (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=9 dest: 4}, { cond=(AND p3 (NOT p0) p1 (NOT p2)), acceptance={} source=9 dest: 5}, { cond=(AND (NOT p1) p2), acceptance={} source=9 dest: 7}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=9 dest: 9}]], initial=0, aps=[p3:(AND (EQ s142 1) (EQ s145 1)), p2:(EQ s65 1), p0:(AND (EQ s22 1) (EQ s25 1)), p1:(AND (EQ s56 1) (EQ s58 1) (EQ s63 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 24490 reset in 485 ms.
Product exploration explored 100000 steps with 24456 reset in 414 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND (NOT p3) (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p3) p0 (NOT p2)))), (X (OR p3 (NOT p2))), (X (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p3 (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p3 (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p3 p2)))), (X (X (NOT (AND (NOT p3) p2)))), true, (X (X (NOT (AND p3 p0 p1 p2)))), (X (X (NOT (AND p3 p0 p2)))), (X (X (NOT (AND (NOT p3) p0 (NOT p2))))), (X (X (OR p3 (NOT p2)))), (X (X (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p3 p0 p1 (NOT p2))))), (X (X (NOT (AND p3 p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 24 factoid took 1167 ms. Reduced automaton from 10 states, 38 edges and 4 AP (stutter sensitive) to 10 states, 38 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 463 ms :[true, (OR (AND p0 p1 p2) (AND p2 (NOT p3))), p2, (OR (AND p2 (NOT p3)) (AND p0 p2)), (OR (AND p2 (NOT p3)) (AND p1 p2)), (OR (AND p0 p1 p2) (AND p2 (NOT p3))), (OR p1 (AND p2 (NOT p3))), (OR p0 (AND p2 (NOT p3))), (OR (AND p2 (NOT p3)) (AND p0 p1)), (OR p2 p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 337 ms. (steps per millisecond=29 ) properties (out of 25) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-19 17:03:22] [INFO ] Invariant cache hit.
[2023-03-19 17:03:22] [INFO ] [Real]Absence check using 81 positive place invariants in 11 ms returned sat
[2023-03-19 17:03:22] [INFO ] After 206ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-19 17:03:22] [INFO ] [Nat]Absence check using 81 positive place invariants in 11 ms returned sat
[2023-03-19 17:03:22] [INFO ] After 145ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-19 17:03:23] [INFO ] After 237ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 58 ms.
[2023-03-19 17:03:23] [INFO ] After 397ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 101 ms.
Support contains 8 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 162/162 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 162 transition count 161
Partial Free-agglomeration rule applied 18 times.
Drop transitions removed 18 transitions
Iterating global reduction 0 with 18 rules applied. Total rules applied 20 place count 162 transition count 161
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 0 with 18 rules applied. Total rules applied 38 place count 162 transition count 143
Applied a total of 38 rules in 13 ms. Remains 162 /163 variables (removed 1) and now considering 143/162 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 162/163 places, 143/162 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 8) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 143 rows 162 cols
[2023-03-19 17:03:23] [INFO ] Computed 81 place invariants in 2 ms
[2023-03-19 17:03:23] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 17:03:23] [INFO ] [Nat]Absence check using 81 positive place invariants in 8 ms returned sat
[2023-03-19 17:03:23] [INFO ] After 57ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 17:03:23] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-19 17:03:23] [INFO ] After 20ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-19 17:03:23] [INFO ] After 49ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-19 17:03:23] [INFO ] After 186ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 19 ms.
Support contains 8 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 143/143 transitions.
Applied a total of 0 rules in 4 ms. Remains 162 /162 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 162/162 places, 143/143 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 17:03:23] [INFO ] Invariant cache hit.
[2023-03-19 17:03:23] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 17:03:23] [INFO ] [Nat]Absence check using 81 positive place invariants in 9 ms returned sat
[2023-03-19 17:03:23] [INFO ] After 71ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 17:03:23] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-19 17:03:23] [INFO ] After 11ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 17:03:23] [INFO ] After 24ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-19 17:03:23] [INFO ] After 160ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 8 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 143/143 transitions.
Applied a total of 0 rules in 4 ms. Remains 162 /162 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 162/162 places, 143/143 transitions.
Finished random walk after 2514 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=359 )
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND (NOT p3) (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p3) p0 (NOT p2)))), (X (OR p3 (NOT p2))), (X (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p3 (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p3 (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p3 p2)))), (X (X (NOT (AND (NOT p3) p2)))), true, (X (X (NOT (AND p3 p0 p1 p2)))), (X (X (NOT (AND p3 p0 p2)))), (X (X (NOT (AND (NOT p3) p0 (NOT p2))))), (X (X (OR p3 (NOT p2)))), (X (X (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p3 p0 p1 (NOT p2))))), (X (X (NOT (AND p3 p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : [(F (OR (AND (NOT p3) p2) (AND p0 p2))), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (F (OR (AND p1 p2) (AND (NOT p3) p2))), (F (AND (NOT p1) p0 (NOT p2))), (F (AND p3 (NOT p0) p2)), (F (OR p1 p2)), (F p2), (F (AND p1 (NOT p0) (NOT p2))), (F (AND p0 (NOT p2))), (F (NOT (OR (AND (NOT p1) p3 (NOT p0)) (AND (NOT p1) (NOT p0) (NOT p2))))), (F (OR (AND p1 p3 (NOT p0)) (AND p1 (NOT p0) (NOT p2)))), (F (AND (NOT p1) p3 p0)), (F (AND (NOT p1) p3 p0 (NOT p2))), (F (OR (AND p1 p0 (NOT p2)) (AND (NOT p3) p0 (NOT p2)))), (F (AND (NOT p1) p3 p2)), (F (NOT (OR (AND (NOT p1) p3) (AND (NOT p1) (NOT p0) (NOT p2))))), (F (OR p1 (AND (NOT p3) p2))), (F (AND (NOT p1) p3 (NOT p0) p2)), (F (AND p1 p3 (NOT p0) p2)), (F (OR (AND p1 p0) (AND (NOT p3) p2))), (F (NOT (OR (AND p3 (NOT p0)) (AND (NOT p0) (NOT p2))))), (F (OR (AND (NOT p3) p2) p0)), (F (AND (NOT p1) (NOT p3) p0 (NOT p2))), (F (AND (NOT p1) p3 p0 p2)), (F (OR (AND p1 p0 p2) (AND (NOT p3) p2)))]
Knowledge based reduction with 24 factoid took 1334 ms. Reduced automaton from 10 states, 38 edges and 4 AP (stutter sensitive) to 10 states, 38 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 415 ms :[true, (OR (AND p0 p1 p2) (AND p2 (NOT p3))), p2, (OR (AND p2 (NOT p3)) (AND p0 p2)), (OR (AND p2 (NOT p3)) (AND p1 p2)), (OR (AND p0 p1 p2) (AND p2 (NOT p3))), (OR p1 p2), (OR p1 (AND p2 (NOT p3))), (OR p0 (AND p2 (NOT p3))), (OR (AND p2 (NOT p3)) (AND p0 p1))]
Stuttering acceptance computed with spot in 381 ms :[true, (OR (AND p0 p1 p2) (AND p2 (NOT p3))), p2, (OR (AND p2 (NOT p3)) (AND p0 p2)), (OR (AND p2 (NOT p3)) (AND p1 p2)), (OR (AND p0 p1 p2) (AND p2 (NOT p3))), (OR p1 p2), (OR p1 (AND p2 (NOT p3))), (OR p0 (AND p2 (NOT p3))), (OR (AND p2 (NOT p3)) (AND p0 p1))]
Support contains 8 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 162/162 transitions.
Applied a total of 0 rules in 3 ms. Remains 163 /163 variables (removed 0) and now considering 162/162 (removed 0) transitions.
// Phase 1: matrix 162 rows 163 cols
[2023-03-19 17:03:26] [INFO ] Computed 81 place invariants in 2 ms
[2023-03-19 17:03:26] [INFO ] Implicit Places using invariants in 130 ms returned []
[2023-03-19 17:03:26] [INFO ] Invariant cache hit.
[2023-03-19 17:03:26] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
[2023-03-19 17:03:26] [INFO ] Invariant cache hit.
[2023-03-19 17:03:26] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 436 ms. Remains : 163/163 places, 162/162 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)), (X (NOT (AND (NOT p1) p3 (NOT p0) p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (OR (AND p1 p0 (NOT p2)) (AND (NOT p3) p0 (NOT p2))))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) p3 p0 (NOT p2)))), (X (NOT (AND (NOT p1) p3 p0 p2))), (X (NOT (AND p1 p3 (NOT p0) p2))), (X (NOT (OR (AND p1 p0 p2) (AND (NOT p3) p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p3 p0)))), (X (X (NOT (AND (NOT p1) p3 (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (OR p1 (AND (NOT p3) p2))))), (X (X (NOT (OR (AND (NOT p3) p2) p0)))), (X (X (OR (AND p3 (NOT p0)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p3 p0 (NOT p2))))), (X (X (NOT (OR (AND p1 p0) (AND (NOT p3) p2))))), (X (X (OR (AND (NOT p1) p3) (AND (NOT p1) (NOT p0) (NOT p2))))), true, (X (X (NOT (OR (AND p1 p2) (AND (NOT p3) p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND p1 p0 (NOT p2)) (AND (NOT p3) p0 (NOT p2)))))), (X (X (NOT (OR (AND p1 p3 (NOT p0)) (AND p1 (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p1) p3 p2)))), (X (X (NOT (AND p3 (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (OR (AND (NOT p3) p2) (AND p0 p2))))), (X (X (NOT (AND (NOT p1) (NOT p3) p0 (NOT p2))))), (X (X (OR (AND (NOT p1) p3 (NOT p0)) (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p3 p0 p2)))), (X (X (NOT (AND p1 p3 (NOT p0) p2)))), (X (X (NOT (OR (AND p1 p0 p2) (AND (NOT p3) p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 33 factoid took 1439 ms. Reduced automaton from 10 states, 38 edges and 4 AP (stutter sensitive) to 10 states, 38 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 509 ms :[true, (OR (AND p0 p1 p2) (AND p2 (NOT p3))), p2, (OR (AND p2 (NOT p3)) (AND p0 p2)), (OR (AND p2 (NOT p3)) (AND p1 p2)), (OR (AND p0 p1 p2) (AND p2 (NOT p3))), (OR p1 p2), (OR p1 (AND p2 (NOT p3))), (OR p0 (AND p2 (NOT p3))), (OR (AND p2 (NOT p3)) (AND p0 p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 464 ms. (steps per millisecond=21 ) properties (out of 25) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-19 17:03:29] [INFO ] Invariant cache hit.
[2023-03-19 17:03:29] [INFO ] [Real]Absence check using 81 positive place invariants in 16 ms returned sat
[2023-03-19 17:03:29] [INFO ] After 178ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-19 17:03:29] [INFO ] [Nat]Absence check using 81 positive place invariants in 10 ms returned sat
[2023-03-19 17:03:29] [INFO ] After 108ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-19 17:03:29] [INFO ] After 188ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 49 ms.
[2023-03-19 17:03:29] [INFO ] After 321ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 79 ms.
Support contains 8 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 162/162 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 162 transition count 161
Partial Free-agglomeration rule applied 18 times.
Drop transitions removed 18 transitions
Iterating global reduction 0 with 18 rules applied. Total rules applied 20 place count 162 transition count 161
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 0 with 18 rules applied. Total rules applied 38 place count 162 transition count 143
Applied a total of 38 rules in 23 ms. Remains 162 /163 variables (removed 1) and now considering 143/162 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 162/163 places, 143/162 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 143 rows 162 cols
[2023-03-19 17:03:30] [INFO ] Computed 81 place invariants in 2 ms
[2023-03-19 17:03:30] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 17:03:30] [INFO ] [Nat]Absence check using 81 positive place invariants in 13 ms returned sat
[2023-03-19 17:03:30] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 17:03:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-19 17:03:30] [INFO ] After 25ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-19 17:03:30] [INFO ] After 65ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-19 17:03:30] [INFO ] After 248ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 19 ms.
Support contains 8 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 143/143 transitions.
Applied a total of 0 rules in 5 ms. Remains 162 /162 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 162/162 places, 143/143 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 17:03:30] [INFO ] Invariant cache hit.
[2023-03-19 17:03:30] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 17:03:30] [INFO ] [Nat]Absence check using 81 positive place invariants in 14 ms returned sat
[2023-03-19 17:03:30] [INFO ] After 63ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 17:03:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-19 17:03:30] [INFO ] After 9ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 17:03:30] [INFO ] After 29ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-19 17:03:30] [INFO ] After 191ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 8 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 143/143 transitions.
Applied a total of 0 rules in 4 ms. Remains 162 /162 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 162/162 places, 143/143 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 19981 steps, run visited all 1 properties in 71 ms. (steps per millisecond=281 )
Probabilistic random walk after 19981 steps, saw 19084 distinct states, run finished after 71 ms. (steps per millisecond=281 ) properties seen :1
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)), (X (NOT (AND (NOT p1) p3 (NOT p0) p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (OR (AND p1 p0 (NOT p2)) (AND (NOT p3) p0 (NOT p2))))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) p3 p0 (NOT p2)))), (X (NOT (AND (NOT p1) p3 p0 p2))), (X (NOT (AND p1 p3 (NOT p0) p2))), (X (NOT (OR (AND p1 p0 p2) (AND (NOT p3) p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p3 p0)))), (X (X (NOT (AND (NOT p1) p3 (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (OR p1 (AND (NOT p3) p2))))), (X (X (NOT (OR (AND (NOT p3) p2) p0)))), (X (X (OR (AND p3 (NOT p0)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p3 p0 (NOT p2))))), (X (X (NOT (OR (AND p1 p0) (AND (NOT p3) p2))))), (X (X (OR (AND (NOT p1) p3) (AND (NOT p1) (NOT p0) (NOT p2))))), true, (X (X (NOT (OR (AND p1 p2) (AND (NOT p3) p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND p1 p0 (NOT p2)) (AND (NOT p3) p0 (NOT p2)))))), (X (X (NOT (OR (AND p1 p3 (NOT p0)) (AND p1 (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p1) p3 p2)))), (X (X (NOT (AND p3 (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (OR (AND (NOT p3) p2) (AND p0 p2))))), (X (X (NOT (AND (NOT p1) (NOT p3) p0 (NOT p2))))), (X (X (OR (AND (NOT p1) p3 (NOT p0)) (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p3 p0 p2)))), (X (X (NOT (AND p1 p3 (NOT p0) p2)))), (X (X (NOT (OR (AND p1 p0 p2) (AND (NOT p3) p2)))))]
False Knowledge obtained : [(F (OR (AND p2 p0) (AND p2 (NOT p3)))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (F (NOT (OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p0) p3)))), (F (OR (AND p1 p2) (AND p2 (NOT p3)))), (F (OR (AND p1 (NOT p2) (NOT p0)) (AND p1 (NOT p0) p3))), (F (AND p2 (NOT p0) p3)), (F p2), (F (AND p1 (NOT p2) (NOT p0))), (F (AND (NOT p2) p0)), (F (AND (NOT p1) p0 p3)), (F (OR (AND p1 p0) (AND p2 (NOT p3)))), (F (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) p3)))), (F (AND (NOT p1) (NOT p2) p0 p3)), (F (OR (AND p1 (NOT p2) p0) (AND (NOT p2) p0 (NOT p3)))), (F (AND (NOT p1) p2 p3)), (F (AND (NOT p1) (NOT p2) p0)), (F (OR p1 p2)), (F (AND (NOT p1) p2 (NOT p0) p3)), (F (AND p1 p2 (NOT p0) p3)), (F (OR (AND p2 (NOT p3)) p0)), (F (NOT (OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p1) p3)))), (F (AND (NOT p1) (NOT p2) p0 (NOT p3))), (F (OR p1 (AND p2 (NOT p3)))), (F (AND (NOT p1) p2 p0 p3)), (F (OR (AND p1 p2 p0) (AND p2 (NOT p3))))]
Knowledge based reduction with 33 factoid took 2327 ms. Reduced automaton from 10 states, 38 edges and 4 AP (stutter sensitive) to 10 states, 38 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 488 ms :[true, (OR (AND p0 p1 p2) (AND p2 (NOT p3))), p2, (OR (AND p2 (NOT p3)) (AND p0 p2)), (OR (AND p2 (NOT p3)) (AND p1 p2)), (OR (AND p0 p1 p2) (AND p2 (NOT p3))), (OR p1 p2), (OR p1 (AND p2 (NOT p3))), (OR p0 (AND p2 (NOT p3))), (OR (AND p2 (NOT p3)) (AND p0 p1))]
Stuttering acceptance computed with spot in 535 ms :[true, (OR (AND p0 p1 p2) (AND p2 (NOT p3))), p2, (OR (AND p2 (NOT p3)) (AND p0 p2)), (OR (AND p2 (NOT p3)) (AND p1 p2)), (OR (AND p0 p1 p2) (AND p2 (NOT p3))), (OR p1 p2), (OR p1 (AND p2 (NOT p3))), (OR p0 (AND p2 (NOT p3))), (OR (AND p2 (NOT p3)) (AND p0 p1))]
Stuttering acceptance computed with spot in 570 ms :[true, (OR (AND p0 p1 p2) (AND p2 (NOT p3))), p2, (OR (AND p2 (NOT p3)) (AND p0 p2)), (OR (AND p2 (NOT p3)) (AND p1 p2)), (OR (AND p0 p1 p2) (AND p2 (NOT p3))), (OR p1 p2), (OR p1 (AND p2 (NOT p3))), (OR p0 (AND p2 (NOT p3))), (OR (AND p2 (NOT p3)) (AND p0 p1))]
Entered a terminal (fully accepting) state of product in 1063 steps with 0 reset in 9 ms.
FORMULA ShieldRVt-PT-020A-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020A-LTLFireability-11 finished in 16687 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)||X(X(F(!p1))))) U p2))'
Support contains 9 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 162/162 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 162 transition count 161
Applied a total of 2 rules in 17 ms. Remains 162 /163 variables (removed 1) and now considering 161/162 (removed 1) transitions.
// Phase 1: matrix 161 rows 162 cols
[2023-03-19 17:03:35] [INFO ] Computed 81 place invariants in 2 ms
[2023-03-19 17:03:35] [INFO ] Implicit Places using invariants in 115 ms returned [155]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 117 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 161/163 places, 161/162 transitions.
Applied a total of 0 rules in 5 ms. Remains 161 /161 variables (removed 0) and now considering 161/161 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 140 ms. Remains : 161/163 places, 161/162 transitions.
Stuttering acceptance computed with spot in 198 ms :[(NOT p2), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : ShieldRVt-PT-020A-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s88 1) (EQ s90 1) (EQ s95 1)), p0:(AND (EQ s144 1) (EQ s146 1) (EQ s151 1)), p1:(AND (EQ s20 1) (EQ s21 1) (EQ s24 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 21530 reset in 406 ms.
Stack based approach found an accepted trace after 152 steps with 36 reset with depth 5 and stack size 5 in 1 ms.
FORMULA ShieldRVt-PT-020A-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-020A-LTLFireability-12 finished in 790 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(F(p1)))))))'
Support contains 2 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 162/162 transitions.
Applied a total of 0 rules in 1 ms. Remains 163 /163 variables (removed 0) and now considering 162/162 (removed 0) transitions.
// Phase 1: matrix 162 rows 163 cols
[2023-03-19 17:03:35] [INFO ] Computed 81 place invariants in 2 ms
[2023-03-19 17:03:35] [INFO ] Implicit Places using invariants in 107 ms returned []
[2023-03-19 17:03:35] [INFO ] Invariant cache hit.
[2023-03-19 17:03:36] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
[2023-03-19 17:03:36] [INFO ] Invariant cache hit.
[2023-03-19 17:03:36] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 392 ms. Remains : 163/163 places, 162/162 transitions.
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-020A-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s155 0), p1:(EQ s59 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 33333 reset in 468 ms.
Product exploration explored 100000 steps with 33333 reset in 453 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-020A-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-020A-LTLFireability-13 finished in 1617 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||X(p0)))) U p1))'
Support contains 2 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 162/162 transitions.
Applied a total of 0 rules in 2 ms. Remains 163 /163 variables (removed 0) and now considering 162/162 (removed 0) transitions.
[2023-03-19 17:03:37] [INFO ] Invariant cache hit.
[2023-03-19 17:03:37] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-03-19 17:03:37] [INFO ] Invariant cache hit.
[2023-03-19 17:03:37] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
[2023-03-19 17:03:37] [INFO ] Invariant cache hit.
[2023-03-19 17:03:37] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 344 ms. Remains : 163/163 places, 162/162 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-020A-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s155 1), p0:(EQ s61 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 9 reset in 224 ms.
Stack based approach found an accepted trace after 24 steps with 0 reset with depth 25 and stack size 25 in 0 ms.
FORMULA ShieldRVt-PT-020A-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-020A-LTLFireability-14 finished in 713 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)&&F(p1))))'
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 162/162 transitions.
Applied a total of 0 rules in 0 ms. Remains 163 /163 variables (removed 0) and now considering 162/162 (removed 0) transitions.
[2023-03-19 17:03:38] [INFO ] Invariant cache hit.
[2023-03-19 17:03:38] [INFO ] Implicit Places using invariants in 108 ms returned []
[2023-03-19 17:03:38] [INFO ] Invariant cache hit.
[2023-03-19 17:03:38] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
[2023-03-19 17:03:38] [INFO ] Invariant cache hit.
[2023-03-19 17:03:38] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 367 ms. Remains : 163/163 places, 162/162 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-020A-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: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(AND (EQ s11 1) (EQ s20 1) (EQ s26 1)), p1:(EQ s33 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-020A-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020A-LTLFireability-15 finished in 513 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||X(((p1||X(p0)) U (p2||F(G(!p3))))))))'
[2023-03-19 17:03:38] [INFO ] Flatten gal took : 29 ms
[2023-03-19 17:03:38] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2023-03-19 17:03:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 163 places, 162 transitions and 684 arcs took 8 ms.
Total runtime 37658 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldRVt-PT-020A
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLFireability

FORMULA ShieldRVt-PT-020A-LTLFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679245419148

--------------------
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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 ShieldRVt-PT-020A-LTLFireability-09
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for ShieldRVt-PT-020A-LTLFireability-09
lola: result : false
lola: markings : 188
lola: fired transitions : 195
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-020A-LTLFireability-09: LTL false LTL model checker


Time elapsed: 0 secs. Pages in use: 1

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="ShieldRVt-PT-020A"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is ShieldRVt-PT-020A, 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 r423-tajo-167905976500276"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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