Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r222-tall-165286026201044.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldRVt-PT-100A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286026201044
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 6.7K Apr 30 02:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 30 02:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 30 01:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 30 01:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 09:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 09:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 09:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 09:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 09:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 09:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 273K May 10 09:34 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-100A-LTLFireability-00
FORMULA_NAME ShieldRVt-PT-100A-LTLFireability-01
FORMULA_NAME ShieldRVt-PT-100A-LTLFireability-02
FORMULA_NAME ShieldRVt-PT-100A-LTLFireability-03
FORMULA_NAME ShieldRVt-PT-100A-LTLFireability-04
FORMULA_NAME ShieldRVt-PT-100A-LTLFireability-05
FORMULA_NAME ShieldRVt-PT-100A-LTLFireability-06
FORMULA_NAME ShieldRVt-PT-100A-LTLFireability-07
FORMULA_NAME ShieldRVt-PT-100A-LTLFireability-08
FORMULA_NAME ShieldRVt-PT-100A-LTLFireability-09
FORMULA_NAME ShieldRVt-PT-100A-LTLFireability-10
FORMULA_NAME ShieldRVt-PT-100A-LTLFireability-11
FORMULA_NAME ShieldRVt-PT-100A-LTLFireability-12
FORMULA_NAME ShieldRVt-PT-100A-LTLFireability-13
FORMULA_NAME ShieldRVt-PT-100A-LTLFireability-14
FORMULA_NAME ShieldRVt-PT-100A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653083776450

Running Version 202205111006
[2022-05-20 21:56:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-20 21:56:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 21:56:17] [INFO ] Load time of PNML (sax parser for PT used): 137 ms
[2022-05-20 21:56:17] [INFO ] Transformed 803 places.
[2022-05-20 21:56:17] [INFO ] Transformed 803 transitions.
[2022-05-20 21:56:17] [INFO ] Found NUPN structural information;
[2022-05-20 21:56:17] [INFO ] Parsed PT model containing 803 places and 803 transitions in 247 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 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-100A-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-100A-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-100A-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-100A-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 803/803 places, 802/802 transitions.
Applied a total of 0 rules in 94 ms. Remains 803 /803 variables (removed 0) and now considering 802/802 (removed 0) transitions.
// Phase 1: matrix 802 rows 803 cols
[2022-05-20 21:56:18] [INFO ] Computed 401 place invariants in 25 ms
[2022-05-20 21:56:18] [INFO ] Implicit Places using invariants in 558 ms returned []
// Phase 1: matrix 802 rows 803 cols
[2022-05-20 21:56:18] [INFO ] Computed 401 place invariants in 15 ms
[2022-05-20 21:56:19] [INFO ] Implicit Places using invariants and state equation in 778 ms returned []
Implicit Place search using SMT with State Equation took 1362 ms to find 0 implicit places.
// Phase 1: matrix 802 rows 803 cols
[2022-05-20 21:56:19] [INFO ] Computed 401 place invariants in 6 ms
[2022-05-20 21:56:19] [INFO ] Dead Transitions using invariants and state equation in 456 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 803/803 places, 802/802 transitions.
Support contains 48 out of 803 places after structural reductions.
[2022-05-20 21:56:20] [INFO ] Flatten gal took : 163 ms
[2022-05-20 21:56:20] [INFO ] Flatten gal took : 74 ms
[2022-05-20 21:56:20] [INFO ] Input system was already deterministic with 802 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 713 ms. (steps per millisecond=14 ) properties (out of 24) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Finished probabilistic random walk after 38176 steps, run visited all 22 properties in 1154 ms. (steps per millisecond=33 )
Probabilistic random walk after 38176 steps, saw 37567 distinct states, run finished after 1156 ms. (steps per millisecond=33 ) properties seen :22
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(!((G((p0 U F(p1)))||X(!X(p2))) U !p0)))'
Support contains 7 out of 803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 803/803 places, 802/802 transitions.
Applied a total of 0 rules in 69 ms. Remains 803 /803 variables (removed 0) and now considering 802/802 (removed 0) transitions.
// Phase 1: matrix 802 rows 803 cols
[2022-05-20 21:56:23] [INFO ] Computed 401 place invariants in 8 ms
[2022-05-20 21:56:23] [INFO ] Implicit Places using invariants in 372 ms returned []
// Phase 1: matrix 802 rows 803 cols
[2022-05-20 21:56:23] [INFO ] Computed 401 place invariants in 7 ms
[2022-05-20 21:56:24] [INFO ] Implicit Places using invariants and state equation in 735 ms returned []
Implicit Place search using SMT with State Equation took 1109 ms to find 0 implicit places.
// Phase 1: matrix 802 rows 803 cols
[2022-05-20 21:56:24] [INFO ] Computed 401 place invariants in 7 ms
[2022-05-20 21:56:24] [INFO ] Dead Transitions using invariants and state equation in 458 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 803/803 places, 802/802 transitions.
Stuttering acceptance computed with spot in 368 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : ShieldRVt-PT-100A-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=p0, acceptance={0, 1} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 2}, { cond=p0, acceptance={1} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 4}, { cond=(AND p0 p2), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={1} source=3 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 4}, { cond=(AND p0 p2), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 5}, { cond=(AND p0 p1), acceptance={0, 1} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=5 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND p0 p1), acceptance={1} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s606 1) (EQ s609 1)), p2:(AND (EQ s456 1) (EQ s458 1) (EQ s463 1)), p1:(AND (EQ s598 1) (EQ s601 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 902 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 1 ms.
FORMULA ShieldRVt-PT-100A-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-100A-LTLFireability-00 finished in 2971 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!(F(G(p0)) U (X((F(p1)||p1)) U p0)))))'
Support contains 6 out of 803 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 803/803 places, 802/802 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 802 transition count 801
Applied a total of 2 rules in 123 ms. Remains 802 /803 variables (removed 1) and now considering 801/802 (removed 1) transitions.
// Phase 1: matrix 801 rows 802 cols
[2022-05-20 21:56:26] [INFO ] Computed 401 place invariants in 4 ms
[2022-05-20 21:56:26] [INFO ] Implicit Places using invariants in 351 ms returned [795]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 360 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 801/803 places, 801/802 transitions.
Applied a total of 0 rules in 33 ms. Remains 801 /801 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 801/803 places, 801/802 transitions.
Stuttering acceptance computed with spot in 198 ms :[p0, p0, (AND p0 p1), p0, (AND p0 p1), (AND p0 p1)]
Running random walk in product with property : ShieldRVt-PT-100A-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0, 1} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={0, 1} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND p0 p1), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={1} source=2 dest: 4}], [{ cond=p0, acceptance={0, 1} source=3 dest: 3}], [{ cond=(AND p0 p1), acceptance={0, 1} source=4 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=4 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=4 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={1} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=p1, acceptance={} source=5 dest: 1}, { cond=(AND p0 p1), acceptance={} source=5 dest: 3}, { cond=(NOT p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s580 1) (EQ s581 1) (EQ s584 1)), p1:(AND (EQ s120 1) (EQ s122 1) (EQ s127 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 681 ms.
Product exploration explored 100000 steps with 0 reset in 800 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 p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 541 ms. Reduced automaton from 6 states, 19 edges and 2 AP to 6 states, 19 edges and 2 AP.
Stuttering acceptance computed with spot in 174 ms :[p0, p0, (AND p0 p1), p0, (AND p0 p1), (AND p0 p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 407 ms. (steps per millisecond=24 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 277493 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :{0=1, 2=1, 3=1, 4=1, 5=1}
Probabilistic random walk after 277493 steps, saw 275194 distinct states, run finished after 3004 ms. (steps per millisecond=92 ) properties seen :5
Running SMT prover for 1 properties.
// Phase 1: matrix 801 rows 801 cols
[2022-05-20 21:56:32] [INFO ] Computed 400 place invariants in 7 ms
[2022-05-20 21:56:33] [INFO ] [Real]Absence check using 400 positive place invariants in 80 ms returned sat
[2022-05-20 21:56:33] [INFO ] After 694ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 21:56:33] [INFO ] [Nat]Absence check using 400 positive place invariants in 72 ms returned sat
[2022-05-20 21:56:34] [INFO ] After 552ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 21:56:34] [INFO ] After 688ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 74 ms.
[2022-05-20 21:56:34] [INFO ] After 990ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 20 ms.
Support contains 6 out of 801 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 801/801 places, 801/801 transitions.
Partial Free-agglomeration rule applied 99 times.
Drop transitions removed 99 transitions
Iterating global reduction 0 with 99 rules applied. Total rules applied 99 place count 801 transition count 801
Drop transitions removed 99 transitions
Redundant transition composition rules discarded 99 transitions
Iterating global reduction 0 with 99 rules applied. Total rules applied 198 place count 801 transition count 702
Applied a total of 198 rules in 110 ms. Remains 801 /801 variables (removed 0) and now considering 702/801 (removed 99) transitions.
Finished structural reductions, in 1 iterations. Remains : 801/801 places, 702/801 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 353428 steps, run timeout after 3001 ms. (steps per millisecond=117 ) properties seen :{}
Probabilistic random walk after 353428 steps, saw 350657 distinct states, run finished after 3002 ms. (steps per millisecond=117 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 702 rows 801 cols
[2022-05-20 21:56:37] [INFO ] Computed 400 place invariants in 3 ms
[2022-05-20 21:56:37] [INFO ] [Real]Absence check using 400 positive place invariants in 60 ms returned sat
[2022-05-20 21:56:38] [INFO ] After 565ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 21:56:38] [INFO ] [Nat]Absence check using 400 positive place invariants in 51 ms returned sat
[2022-05-20 21:56:38] [INFO ] After 475ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 21:56:39] [INFO ] After 593ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 54 ms.
[2022-05-20 21:56:39] [INFO ] After 840ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 13 ms.
Support contains 6 out of 801 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 801/801 places, 702/702 transitions.
Applied a total of 0 rules in 24 ms. Remains 801 /801 variables (removed 0) and now considering 702/702 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 801/801 places, 702/702 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 801/801 places, 702/702 transitions.
Applied a total of 0 rules in 21 ms. Remains 801 /801 variables (removed 0) and now considering 702/702 (removed 0) transitions.
// Phase 1: matrix 702 rows 801 cols
[2022-05-20 21:56:39] [INFO ] Computed 400 place invariants in 3 ms
[2022-05-20 21:56:39] [INFO ] Implicit Places using invariants in 363 ms returned []
// Phase 1: matrix 702 rows 801 cols
[2022-05-20 21:56:39] [INFO ] Computed 400 place invariants in 3 ms
[2022-05-20 21:56:40] [INFO ] Implicit Places using invariants and state equation in 871 ms returned []
Implicit Place search using SMT with State Equation took 1237 ms to find 0 implicit places.
[2022-05-20 21:56:40] [INFO ] Redundant transitions in 41 ms returned []
// Phase 1: matrix 702 rows 801 cols
[2022-05-20 21:56:40] [INFO ] Computed 400 place invariants in 2 ms
[2022-05-20 21:56:40] [INFO ] Dead Transitions using invariants and state equation in 399 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 801/801 places, 702/702 transitions.
Applied a total of 0 rules in 22 ms. Remains 801 /801 variables (removed 0) and now considering 702/702 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 702 rows 801 cols
[2022-05-20 21:56:40] [INFO ] Computed 400 place invariants in 2 ms
[2022-05-20 21:56:41] [INFO ] [Real]Absence check using 400 positive place invariants in 53 ms returned sat
[2022-05-20 21:56:41] [INFO ] After 502ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 21:56:41] [INFO ] [Nat]Absence check using 400 positive place invariants in 52 ms returned sat
[2022-05-20 21:56:42] [INFO ] After 482ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 21:56:42] [INFO ] After 604ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 41 ms.
[2022-05-20 21:56:42] [INFO ] After 834ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-20 21:56:42] [INFO ] Flatten gal took : 59 ms
[2022-05-20 21:56:42] [INFO ] Flatten gal took : 51 ms
[2022-05-20 21:56:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7430223874559650997.gal : 30 ms
[2022-05-20 21:56:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2739812784168119255.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms2147547264556826263;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7430223874559650997.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2739812784168119255.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality2739812784168119255.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :3 after 7
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :7 after 17
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :17 after 35
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :35 after 69
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :69 after 135
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :135 after 469
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :469 after 2.09734e+06
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2.09734e+06 after 5.6295e+14
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :5.6295e+14 after 3.67619e+31
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3.67619e+31 after 1.28349e+65
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2.58225e+120,1.28483,18356,2,2001,16,50124,7,0,3915,55470,0
Total reachable state count : 2.58224987808690858965591917200301187433e+120

Verifying 1 reachability properties.
Reachability property apf1 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf1,1.24331e+86,1.28771,18356,2,1088,16,50124,7,0,3926,55470,0
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (AND p1 (NOT p0))), (F p1), (F p0), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 12 factoid took 622 ms. Reduced automaton from 6 states, 19 edges and 2 AP to 6 states, 19 edges and 2 AP.
Stuttering acceptance computed with spot in 189 ms :[p0, p0, (AND p0 p1), p0, (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 186 ms :[p0, p0, (AND p0 p1), p0, (AND p0 p1), (AND p0 p1)]
Support contains 6 out of 801 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 801/801 places, 801/801 transitions.
Applied a total of 0 rules in 29 ms. Remains 801 /801 variables (removed 0) and now considering 801/801 (removed 0) transitions.
// Phase 1: matrix 801 rows 801 cols
[2022-05-20 21:56:44] [INFO ] Computed 400 place invariants in 4 ms
[2022-05-20 21:56:45] [INFO ] Implicit Places using invariants in 381 ms returned []
// Phase 1: matrix 801 rows 801 cols
[2022-05-20 21:56:45] [INFO ] Computed 400 place invariants in 3 ms
[2022-05-20 21:56:45] [INFO ] Implicit Places using invariants and state equation in 707 ms returned []
Implicit Place search using SMT with State Equation took 1090 ms to find 0 implicit places.
[2022-05-20 21:56:45] [INFO ] Redundant transitions in 29 ms returned []
// Phase 1: matrix 801 rows 801 cols
[2022-05-20 21:56:45] [INFO ] Computed 400 place invariants in 5 ms
[2022-05-20 21:56:46] [INFO ] Dead Transitions using invariants and state equation in 418 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 801/801 places, 801/801 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 p0) (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT p0)), true, (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 431 ms. Reduced automaton from 6 states, 19 edges and 2 AP to 6 states, 19 edges and 2 AP.
Stuttering acceptance computed with spot in 236 ms :[p0, p0, (AND p0 p1), p0, (AND p0 p1), (AND p0 p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 246 ms. (steps per millisecond=40 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 315864 steps, run timeout after 3001 ms. (steps per millisecond=105 ) properties seen :{0=1, 2=1, 3=1, 4=1, 5=1}
Probabilistic random walk after 315864 steps, saw 313301 distinct states, run finished after 3001 ms. (steps per millisecond=105 ) properties seen :5
Running SMT prover for 1 properties.
// Phase 1: matrix 801 rows 801 cols
[2022-05-20 21:56:50] [INFO ] Computed 400 place invariants in 5 ms
[2022-05-20 21:56:50] [INFO ] [Real]Absence check using 400 positive place invariants in 53 ms returned sat
[2022-05-20 21:56:51] [INFO ] After 546ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 21:56:51] [INFO ] [Nat]Absence check using 400 positive place invariants in 51 ms returned sat
[2022-05-20 21:56:52] [INFO ] After 526ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 21:56:52] [INFO ] After 677ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 61 ms.
[2022-05-20 21:56:52] [INFO ] After 924ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 26 ms.
Support contains 6 out of 801 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 801/801 places, 801/801 transitions.
Partial Free-agglomeration rule applied 99 times.
Drop transitions removed 99 transitions
Iterating global reduction 0 with 99 rules applied. Total rules applied 99 place count 801 transition count 801
Drop transitions removed 99 transitions
Redundant transition composition rules discarded 99 transitions
Iterating global reduction 0 with 99 rules applied. Total rules applied 198 place count 801 transition count 702
Applied a total of 198 rules in 52 ms. Remains 801 /801 variables (removed 0) and now considering 702/801 (removed 99) transitions.
Finished structural reductions, in 1 iterations. Remains : 801/801 places, 702/801 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 363451 steps, run timeout after 3001 ms. (steps per millisecond=121 ) properties seen :{}
Probabilistic random walk after 363451 steps, saw 360591 distinct states, run finished after 3001 ms. (steps per millisecond=121 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 702 rows 801 cols
[2022-05-20 21:56:55] [INFO ] Computed 400 place invariants in 2 ms
[2022-05-20 21:56:55] [INFO ] [Real]Absence check using 400 positive place invariants in 56 ms returned sat
[2022-05-20 21:56:56] [INFO ] After 511ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 21:56:56] [INFO ] [Nat]Absence check using 400 positive place invariants in 53 ms returned sat
[2022-05-20 21:56:56] [INFO ] After 484ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 21:56:56] [INFO ] After 599ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 52 ms.
[2022-05-20 21:56:56] [INFO ] After 838ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 6 out of 801 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 801/801 places, 702/702 transitions.
Applied a total of 0 rules in 75 ms. Remains 801 /801 variables (removed 0) and now considering 702/702 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 801/801 places, 702/702 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 801/801 places, 702/702 transitions.
Applied a total of 0 rules in 18 ms. Remains 801 /801 variables (removed 0) and now considering 702/702 (removed 0) transitions.
// Phase 1: matrix 702 rows 801 cols
[2022-05-20 21:56:56] [INFO ] Computed 400 place invariants in 1 ms
[2022-05-20 21:56:57] [INFO ] Implicit Places using invariants in 425 ms returned []
// Phase 1: matrix 702 rows 801 cols
[2022-05-20 21:56:57] [INFO ] Computed 400 place invariants in 2 ms
[2022-05-20 21:56:58] [INFO ] Implicit Places using invariants and state equation in 784 ms returned []
Implicit Place search using SMT with State Equation took 1211 ms to find 0 implicit places.
[2022-05-20 21:56:58] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 702 rows 801 cols
[2022-05-20 21:56:58] [INFO ] Computed 400 place invariants in 1 ms
[2022-05-20 21:56:58] [INFO ] Dead Transitions using invariants and state equation in 397 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 801/801 places, 702/702 transitions.
Applied a total of 0 rules in 17 ms. Remains 801 /801 variables (removed 0) and now considering 702/702 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 702 rows 801 cols
[2022-05-20 21:56:58] [INFO ] Computed 400 place invariants in 3 ms
[2022-05-20 21:56:58] [INFO ] [Real]Absence check using 400 positive place invariants in 52 ms returned sat
[2022-05-20 21:56:59] [INFO ] After 507ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 21:56:59] [INFO ] [Nat]Absence check using 400 positive place invariants in 52 ms returned sat
[2022-05-20 21:56:59] [INFO ] After 488ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 21:56:59] [INFO ] After 613ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 45 ms.
[2022-05-20 21:56:59] [INFO ] After 851ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-20 21:57:00] [INFO ] Flatten gal took : 48 ms
[2022-05-20 21:57:00] [INFO ] Flatten gal took : 45 ms
[2022-05-20 21:57:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11419180746112274200.gal : 7 ms
[2022-05-20 21:57:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11574170784994511424.prop : 5 ms
Invoking ITS tools like this :cd /tmp/redAtoms15450879789355942879;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11419180746112274200.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11574170784994511424.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality11574170784994511424.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :3 after 7
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :7 after 17
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :17 after 35
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :35 after 69
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :69 after 135
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :135 after 469
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :469 after 2.09734e+06
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2.09734e+06 after 5.6295e+14
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :5.6295e+14 after 3.67619e+31
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3.67619e+31 after 1.28349e+65
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2.58225e+120,1.2879,18296,2,2001,16,50124,7,0,3915,55470,0
Total reachable state count : 2.58224987808690858965591917200301187433e+120

Verifying 1 reachability properties.
Reachability property apf1 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf1,1.24331e+86,1.29091,18296,2,1088,16,50124,7,0,3926,55470,0
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT p0)), true, (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (AND p1 (NOT p0))), (F p1), (F p0), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 12 factoid took 699 ms. Reduced automaton from 6 states, 19 edges and 2 AP to 6 states, 19 edges and 2 AP.
Stuttering acceptance computed with spot in 204 ms :[p0, p0, (AND p0 p1), p0, (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 190 ms :[p0, p0, (AND p0 p1), p0, (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 214 ms :[p0, p0, (AND p0 p1), p0, (AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 0 reset in 615 ms.
Product exploration explored 100000 steps with 0 reset in 923 ms.
Built C files in :
/tmp/ltsmin16248002113789160326
[2022-05-20 21:57:04] [INFO ] Computing symmetric may disable matrix : 801 transitions.
[2022-05-20 21:57:04] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 21:57:04] [INFO ] Computing symmetric may enable matrix : 801 transitions.
[2022-05-20 21:57:04] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 21:57:04] [INFO ] Computing Do-Not-Accords matrix : 801 transitions.
[2022-05-20 21:57:04] [INFO ] Computation of Completed DNA matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 21:57:04] [INFO ] Built C files in 129ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16248002113789160326
Running compilation step : cd /tmp/ltsmin16248002113789160326;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2238 ms.
Running link step : cd /tmp/ltsmin16248002113789160326;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin16248002113789160326;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5050886169034005764.hoa' '--buchi-type=spotba'
LTSmin run took 9865 ms.
FORMULA ShieldRVt-PT-100A-LTLFireability-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldRVt-PT-100A-LTLFireability-01 finished in 50639 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F(G(!(p0 U p1)))))'
Support contains 4 out of 803 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 803/803 places, 802/802 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 802 transition count 801
Applied a total of 2 rules in 37 ms. Remains 802 /803 variables (removed 1) and now considering 801/802 (removed 1) transitions.
// Phase 1: matrix 801 rows 802 cols
[2022-05-20 21:57:16] [INFO ] Computed 401 place invariants in 2 ms
[2022-05-20 21:57:16] [INFO ] Implicit Places using invariants in 333 ms returned [795]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 334 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 801/803 places, 801/802 transitions.
Applied a total of 0 rules in 21 ms. Remains 801 /801 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 801/803 places, 801/802 transitions.
Stuttering acceptance computed with spot in 38 ms :[p1]
Running random walk in product with property : ShieldRVt-PT-100A-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(OR (EQ s441 1) (AND (EQ s403 1) (EQ s412 1) (EQ s418 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 625 ms.
Product exploration explored 100000 steps with 0 reset in 785 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 : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 33 ms :[p1]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 1) 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 1) seen :0
Finished probabilistic random walk after 6432 steps, run visited all 1 properties in 58 ms. (steps per millisecond=110 )
Probabilistic random walk after 6432 steps, saw 6252 distinct states, run finished after 59 ms. (steps per millisecond=109 ) properties seen :1
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 132 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 29 ms :[p1]
Stuttering acceptance computed with spot in 24 ms :[p1]
Support contains 4 out of 801 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 801/801 places, 801/801 transitions.
Applied a total of 0 rules in 23 ms. Remains 801 /801 variables (removed 0) and now considering 801/801 (removed 0) transitions.
// Phase 1: matrix 801 rows 801 cols
[2022-05-20 21:57:19] [INFO ] Computed 400 place invariants in 3 ms
[2022-05-20 21:57:19] [INFO ] Implicit Places using invariants in 332 ms returned []
// Phase 1: matrix 801 rows 801 cols
[2022-05-20 21:57:19] [INFO ] Computed 400 place invariants in 6 ms
[2022-05-20 21:57:20] [INFO ] Implicit Places using invariants and state equation in 701 ms returned []
Implicit Place search using SMT with State Equation took 1034 ms to find 0 implicit places.
[2022-05-20 21:57:20] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 801 rows 801 cols
[2022-05-20 21:57:20] [INFO ] Computed 400 place invariants in 7 ms
[2022-05-20 21:57:20] [INFO ] Dead Transitions using invariants and state equation in 426 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 801/801 places, 801/801 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 : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 23 ms :[p1]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 1) 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 1) seen :0
Finished probabilistic random walk after 6432 steps, run visited all 1 properties in 59 ms. (steps per millisecond=109 )
Probabilistic random walk after 6432 steps, saw 6252 distinct states, run finished after 60 ms. (steps per millisecond=107 ) properties seen :1
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 24 ms :[p1]
Stuttering acceptance computed with spot in 34 ms :[p1]
Stuttering acceptance computed with spot in 30 ms :[p1]
Product exploration explored 100000 steps with 0 reset in 626 ms.
Product exploration explored 100000 steps with 0 reset in 776 ms.
Built C files in :
/tmp/ltsmin7366935724090186602
[2022-05-20 21:57:22] [INFO ] Computing symmetric may disable matrix : 801 transitions.
[2022-05-20 21:57:22] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 21:57:22] [INFO ] Computing symmetric may enable matrix : 801 transitions.
[2022-05-20 21:57:22] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 21:57:22] [INFO ] Computing Do-Not-Accords matrix : 801 transitions.
[2022-05-20 21:57:22] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 21:57:22] [INFO ] Built C files in 85ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7366935724090186602
Running compilation step : cd /tmp/ltsmin7366935724090186602;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2095 ms.
Running link step : cd /tmp/ltsmin7366935724090186602;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin7366935724090186602;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7860190552672820462.hoa' '--buchi-type=spotba'
LTSmin run took 6802 ms.
FORMULA ShieldRVt-PT-100A-LTLFireability-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldRVt-PT-100A-LTLFireability-02 finished in 14911 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U F(p0))||G(p1)))'
Support contains 6 out of 803 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 803/803 places, 802/802 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 802 transition count 801
Applied a total of 2 rules in 38 ms. Remains 802 /803 variables (removed 1) and now considering 801/802 (removed 1) transitions.
// Phase 1: matrix 801 rows 802 cols
[2022-05-20 21:57:31] [INFO ] Computed 401 place invariants in 3 ms
[2022-05-20 21:57:31] [INFO ] Implicit Places using invariants in 389 ms returned [795]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 391 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 801/803 places, 801/802 transitions.
Applied a total of 0 rules in 21 ms. Remains 801 /801 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 801/803 places, 801/802 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-100A-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (EQ s544 1) (EQ s546 1) (EQ s551 1)), p1:(OR (EQ s335 1) (AND (EQ s670 1) (EQ s673 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 631 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 1 ms.
FORMULA ShieldRVt-PT-100A-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-100A-LTLFireability-03 finished in 1185 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(X(F(X(F((p1 U X(p1))))))&&X(p1))))'
Support contains 5 out of 803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 803/803 places, 802/802 transitions.
Applied a total of 0 rules in 17 ms. Remains 803 /803 variables (removed 0) and now considering 802/802 (removed 0) transitions.
// Phase 1: matrix 802 rows 803 cols
[2022-05-20 21:57:32] [INFO ] Computed 401 place invariants in 3 ms
[2022-05-20 21:57:33] [INFO ] Implicit Places using invariants in 334 ms returned []
// Phase 1: matrix 802 rows 803 cols
[2022-05-20 21:57:33] [INFO ] Computed 401 place invariants in 3 ms
[2022-05-20 21:57:33] [INFO ] Implicit Places using invariants and state equation in 731 ms returned []
Implicit Place search using SMT with State Equation took 1066 ms to find 0 implicit places.
// Phase 1: matrix 802 rows 803 cols
[2022-05-20 21:57:33] [INFO ] Computed 401 place invariants in 2 ms
[2022-05-20 21:57:34] [INFO ] Dead Transitions using invariants and state equation in 412 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 803/803 places, 802/802 transitions.
Stuttering acceptance computed with spot in 275 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-100A-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=(AND p0 p1), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 8}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=p1, acceptance={} source=6 dest: 3}, { cond=(NOT p1), acceptance={} source=6 dest: 5}], [{ cond=p0, acceptance={} source=7 dest: 4}, { cond=(NOT p0), acceptance={} source=7 dest: 6}], [{ cond=(NOT p0), acceptance={} source=8 dest: 5}, { cond=p0, acceptance={} source=8 dest: 8}]], initial=7, aps=[p1:(AND (EQ s284 1) (EQ s285 1) (EQ s288 1)), p0:(OR (EQ s470 0) (EQ s473 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 620 ms.
Product exploration explored 100000 steps with 0 reset in 774 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 p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT p1)), true, (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 288 ms. Reduced automaton from 9 states, 17 edges and 2 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 65 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Finished probabilistic random walk after 5359 steps, run visited all 1 properties in 48 ms. (steps per millisecond=111 )
Probabilistic random walk after 5359 steps, saw 5200 distinct states, run finished after 49 ms. (steps per millisecond=109 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT p1)), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 8 factoid took 250 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 62 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 803 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 803/803 places, 802/802 transitions.
Applied a total of 0 rules in 11 ms. Remains 803 /803 variables (removed 0) and now considering 802/802 (removed 0) transitions.
// Phase 1: matrix 802 rows 803 cols
[2022-05-20 21:57:36] [INFO ] Computed 401 place invariants in 4 ms
[2022-05-20 21:57:37] [INFO ] Implicit Places using invariants in 326 ms returned []
// Phase 1: matrix 802 rows 803 cols
[2022-05-20 21:57:37] [INFO ] Computed 401 place invariants in 2 ms
[2022-05-20 21:57:37] [INFO ] Implicit Places using invariants and state equation in 730 ms returned []
Implicit Place search using SMT with State Equation took 1058 ms to find 0 implicit places.
// Phase 1: matrix 802 rows 803 cols
[2022-05-20 21:57:37] [INFO ] Computed 401 place invariants in 1 ms
[2022-05-20 21:57:38] [INFO ] Dead Transitions using invariants and state equation in 413 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 803/803 places, 802/802 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 : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 119 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Finished probabilistic random walk after 5359 steps, run visited all 1 properties in 62 ms. (steps per millisecond=86 )
Probabilistic random walk after 5359 steps, saw 5200 distinct states, run finished after 63 ms. (steps per millisecond=85 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 123 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 621 ms.
Product exploration explored 100000 steps with 0 reset in 771 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 803 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 803/803 places, 802/802 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 803 transition count 802
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 1 rules in 115 ms. Remains 803 /803 variables (removed 0) and now considering 802/802 (removed 0) transitions.
[2022-05-20 21:57:40] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 802 rows 803 cols
[2022-05-20 21:57:40] [INFO ] Computed 401 place invariants in 2 ms
[2022-05-20 21:57:41] [INFO ] Dead Transitions using invariants and state equation in 414 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 803/803 places, 802/802 transitions.
Finished structural reductions, in 1 iterations. Remains : 803/803 places, 802/802 transitions.
Product exploration explored 100000 steps with 0 reset in 625 ms.
Product exploration explored 100000 steps with 0 reset in 774 ms.
Built C files in :
/tmp/ltsmin14876791038453241614
[2022-05-20 21:57:42] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14876791038453241614
Running compilation step : cd /tmp/ltsmin14876791038453241614;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1313 ms.
Running link step : cd /tmp/ltsmin14876791038453241614;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin14876791038453241614;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9369678938189624007.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 803/803 places, 802/802 transitions.
Applied a total of 0 rules in 17 ms. Remains 803 /803 variables (removed 0) and now considering 802/802 (removed 0) transitions.
// Phase 1: matrix 802 rows 803 cols
[2022-05-20 21:57:57] [INFO ] Computed 401 place invariants in 4 ms
[2022-05-20 21:57:58] [INFO ] Implicit Places using invariants in 344 ms returned []
// Phase 1: matrix 802 rows 803 cols
[2022-05-20 21:57:58] [INFO ] Computed 401 place invariants in 1 ms
[2022-05-20 21:57:58] [INFO ] Implicit Places using invariants and state equation in 732 ms returned []
Implicit Place search using SMT with State Equation took 1085 ms to find 0 implicit places.
// Phase 1: matrix 802 rows 803 cols
[2022-05-20 21:57:58] [INFO ] Computed 401 place invariants in 2 ms
[2022-05-20 21:57:59] [INFO ] Dead Transitions using invariants and state equation in 467 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 803/803 places, 802/802 transitions.
Built C files in :
/tmp/ltsmin1227166918733945371
[2022-05-20 21:57:59] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1227166918733945371
Running compilation step : cd /tmp/ltsmin1227166918733945371;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1424 ms.
Running link step : cd /tmp/ltsmin1227166918733945371;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin1227166918733945371;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased18079681209280169841.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 21:58:14] [INFO ] Flatten gal took : 41 ms
[2022-05-20 21:58:14] [INFO ] Flatten gal took : 40 ms
[2022-05-20 21:58:14] [INFO ] Time to serialize gal into /tmp/LTL6484611476907793902.gal : 5 ms
[2022-05-20 21:58:14] [INFO ] Time to serialize properties into /tmp/LTL5464830574285498027.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6484611476907793902.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5464830574285498027.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6484611...266
Read 1 LTL properties
Checking formula 0 : !(((G("((p470==0)||(p473==0))"))||((X(F(X(F(("(((p284==1)&&(p285==1))&&(p288==1))")U(X("(((p284==1)&&(p285==1))&&(p288==1))")))))))&&(...199
Formula 0 simplified : !(G"((p470==0)||(p473==0))" | (X"(((p284==1)&&(p285==1))&&(p288==1))" & XFXF("(((p284==1)&&(p285==1))&&(p288==1))" U X"(((p284==1)&&...181
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2022-05-20 21:58:29] [INFO ] Flatten gal took : 39 ms
[2022-05-20 21:58:29] [INFO ] Applying decomposition
[2022-05-20 21:58:29] [INFO ] Flatten gal took : 38 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph16135430821841444387.txt' '-o' '/tmp/graph16135430821841444387.bin' '-w' '/tmp/graph16135430821841444387.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16135430821841444387.bin' '-l' '-1' '-v' '-w' '/tmp/graph16135430821841444387.weights' '-q' '0' '-e' '0.001'
[2022-05-20 21:58:29] [INFO ] Decomposing Gal with order
[2022-05-20 21:58:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 21:58:29] [INFO ] Removed a total of 300 redundant transitions.
[2022-05-20 21:58:29] [INFO ] Flatten gal took : 91 ms
[2022-05-20 21:58:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 54 ms.
[2022-05-20 21:58:30] [INFO ] Time to serialize gal into /tmp/LTL16940640027179865556.gal : 15 ms
[2022-05-20 21:58:30] [INFO ] Time to serialize properties into /tmp/LTL12573719301583560518.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16940640027179865556.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12573719301583560518.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1694064...247
Read 1 LTL properties
Checking formula 0 : !(((G("((i18.u234.p470==0)||(i18.u236.p473==0))"))||((X(F(X(F(("(((i12.i0.i0.u141.p284==1)&&(i12.i0.i0.u142.p285==1))&&(i12.i0.i0.u143...352
Formula 0 simplified : !(G"((i18.u234.p470==0)||(i18.u236.p473==0))" | (X"(((i12.i0.i0.u141.p284==1)&&(i12.i0.i0.u142.p285==1))&&(i12.i0.i0.u143.p288==1))"...334
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
20 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.312843,27852,1,0,8293,144,2291,12158,66,218,21096
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldRVt-PT-100A-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property ShieldRVt-PT-100A-LTLFireability-04 finished in 57739 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 803 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 803/803 places, 802/802 transitions.
Reduce places removed 1 places and 1 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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 800 transition count 800
Applied a total of 3 rules in 50 ms. Remains 800 /803 variables (removed 3) and now considering 800/802 (removed 2) transitions.
// Phase 1: matrix 800 rows 800 cols
[2022-05-20 21:58:30] [INFO ] Computed 400 place invariants in 2 ms
[2022-05-20 21:58:30] [INFO ] Implicit Places using invariants in 314 ms returned []
// Phase 1: matrix 800 rows 800 cols
[2022-05-20 21:58:30] [INFO ] Computed 400 place invariants in 2 ms
[2022-05-20 21:58:31] [INFO ] Implicit Places using invariants and state equation in 675 ms returned []
Implicit Place search using SMT with State Equation took 991 ms to find 0 implicit places.
[2022-05-20 21:58:31] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 800 rows 800 cols
[2022-05-20 21:58:31] [INFO ] Computed 400 place invariants in 1 ms
[2022-05-20 21:58:31] [INFO ] Dead Transitions using invariants and state equation in 394 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 800/803 places, 800/802 transitions.
Finished structural reductions, in 1 iterations. Remains : 800/803 places, 800/802 transitions.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-100A-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s688 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 6 reset in 622 ms.
Stack based approach found an accepted trace after 2 steps with 0 reset with depth 3 and stack size 3 in 0 ms.
FORMULA ShieldRVt-PT-100A-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-100A-LTLFireability-06 finished in 2117 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(((F(p0) U G(p1)) U p0))&&G(G(X(p2)))))'
Support contains 8 out of 803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 803/803 places, 802/802 transitions.
Applied a total of 0 rules in 11 ms. Remains 803 /803 variables (removed 0) and now considering 802/802 (removed 0) transitions.
// Phase 1: matrix 802 rows 803 cols
[2022-05-20 21:58:32] [INFO ] Computed 401 place invariants in 2 ms
[2022-05-20 21:58:32] [INFO ] Implicit Places using invariants in 349 ms returned []
// Phase 1: matrix 802 rows 803 cols
[2022-05-20 21:58:32] [INFO ] Computed 401 place invariants in 2 ms
[2022-05-20 21:58:33] [INFO ] Implicit Places using invariants and state equation in 728 ms returned []
Implicit Place search using SMT with State Equation took 1081 ms to find 0 implicit places.
// Phase 1: matrix 802 rows 803 cols
[2022-05-20 21:58:33] [INFO ] Computed 401 place invariants in 2 ms
[2022-05-20 21:58:34] [INFO ] Dead Transitions using invariants and state equation in 416 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 803/803 places, 802/802 transitions.
Stuttering acceptance computed with spot in 212 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p1), (NOT p0), (NOT p0), (NOT p2), true]
Running random walk in product with property : ShieldRVt-PT-100A-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}, { cond=true, acceptance={} source=0 dest: 4}, { cond=true, acceptance={} source=0 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 2}, { cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=p2, acceptance={} source=5 dest: 5}, { cond=(NOT p2), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s46 1) (EQ s49 1)), p1:(AND (EQ s652 1) (EQ s653 1) (EQ s656 1)), p2:(OR (EQ s52 0) (EQ s53 0) (EQ s56 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 609 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 0 ms.
FORMULA ShieldRVt-PT-100A-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-100A-LTLFireability-07 finished in 2358 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0) U X(G((G(p1)&&!p0)))))))'
Support contains 2 out of 803 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 803/803 places, 802/802 transitions.
Reduce places removed 1 places and 1 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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 800 transition count 800
Applied a total of 3 rules in 34 ms. Remains 800 /803 variables (removed 3) and now considering 800/802 (removed 2) transitions.
// Phase 1: matrix 800 rows 800 cols
[2022-05-20 21:58:34] [INFO ] Computed 400 place invariants in 3 ms
[2022-05-20 21:58:35] [INFO ] Implicit Places using invariants in 312 ms returned []
// Phase 1: matrix 800 rows 800 cols
[2022-05-20 21:58:35] [INFO ] Computed 400 place invariants in 3 ms
[2022-05-20 21:58:35] [INFO ] Implicit Places using invariants and state equation in 705 ms returned []
Implicit Place search using SMT with State Equation took 1020 ms to find 0 implicit places.
[2022-05-20 21:58:35] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 800 rows 800 cols
[2022-05-20 21:58:35] [INFO ] Computed 400 place invariants in 1 ms
[2022-05-20 21:58:36] [INFO ] Dead Transitions using invariants and state equation in 391 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 800/803 places, 800/802 transitions.
Finished structural reductions, in 1 iterations. Remains : 800/803 places, 800/802 transitions.
Stuttering acceptance computed with spot in 33 ms :[(OR (NOT p1) p0)]
Running random walk in product with property : ShieldRVt-PT-100A-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(OR p0 (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s790 1), p1:(EQ s50 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 617 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-100A-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-100A-LTLFireability-08 finished in 2132 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 803 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 803/803 places, 802/802 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 802 transition count 801
Applied a total of 2 rules in 34 ms. Remains 802 /803 variables (removed 1) and now considering 801/802 (removed 1) transitions.
// Phase 1: matrix 801 rows 802 cols
[2022-05-20 21:58:37] [INFO ] Computed 401 place invariants in 2 ms
[2022-05-20 21:58:37] [INFO ] Implicit Places using invariants in 338 ms returned [795]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 340 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 801/803 places, 801/802 transitions.
Applied a total of 0 rules in 17 ms. Remains 801 /801 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 801/803 places, 801/802 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-100A-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (NEQ s220 1) (NEQ s221 1) (NEQ s224 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 615 ms.
Product exploration explored 100000 steps with 0 reset in 768 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 1) 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 1) seen :0
Finished probabilistic random walk after 27081 steps, run visited all 1 properties in 223 ms. (steps per millisecond=121 )
Probabilistic random walk after 27081 steps, saw 26223 distinct states, run finished after 224 ms. (steps per millisecond=120 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 801 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 801/801 places, 801/801 transitions.
Applied a total of 0 rules in 18 ms. Remains 801 /801 variables (removed 0) and now considering 801/801 (removed 0) transitions.
// Phase 1: matrix 801 rows 801 cols
[2022-05-20 21:58:39] [INFO ] Computed 400 place invariants in 3 ms
[2022-05-20 21:58:39] [INFO ] Implicit Places using invariants in 329 ms returned []
// Phase 1: matrix 801 rows 801 cols
[2022-05-20 21:58:39] [INFO ] Computed 400 place invariants in 1 ms
[2022-05-20 21:58:40] [INFO ] Implicit Places using invariants and state equation in 673 ms returned []
Implicit Place search using SMT with State Equation took 1006 ms to find 0 implicit places.
[2022-05-20 21:58:40] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 801 rows 801 cols
[2022-05-20 21:58:40] [INFO ] Computed 400 place invariants in 5 ms
[2022-05-20 21:58:41] [INFO ] Dead Transitions using invariants and state equation in 427 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 801/801 places, 801/801 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 1) 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 1) seen :0
Finished probabilistic random walk after 27081 steps, run visited all 1 properties in 237 ms. (steps per millisecond=114 )
Probabilistic random walk after 27081 steps, saw 26223 distinct states, run finished after 239 ms. (steps per millisecond=113 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 615 ms.
Product exploration explored 100000 steps with 0 reset in 760 ms.
Built C files in :
/tmp/ltsmin1168062427246824445
[2022-05-20 21:58:43] [INFO ] Computing symmetric may disable matrix : 801 transitions.
[2022-05-20 21:58:43] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 21:58:43] [INFO ] Computing symmetric may enable matrix : 801 transitions.
[2022-05-20 21:58:43] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 21:58:43] [INFO ] Computing Do-Not-Accords matrix : 801 transitions.
[2022-05-20 21:58:43] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 21:58:43] [INFO ] Built C files in 86ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1168062427246824445
Running compilation step : cd /tmp/ltsmin1168062427246824445;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2002 ms.
Running link step : cd /tmp/ltsmin1168062427246824445;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin1168062427246824445;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased344882990175703943.hoa' '--buchi-type=spotba'
LTSmin run took 7114 ms.
FORMULA ShieldRVt-PT-100A-LTLFireability-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldRVt-PT-100A-LTLFireability-09 finished in 15534 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(G(X(p0)))||(X(X(p1))&&p0))))'
Support contains 2 out of 803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 803/803 places, 802/802 transitions.
Applied a total of 0 rules in 12 ms. Remains 803 /803 variables (removed 0) and now considering 802/802 (removed 0) transitions.
// Phase 1: matrix 802 rows 803 cols
[2022-05-20 21:58:52] [INFO ] Computed 401 place invariants in 4 ms
[2022-05-20 21:58:52] [INFO ] Implicit Places using invariants in 340 ms returned []
// Phase 1: matrix 802 rows 803 cols
[2022-05-20 21:58:52] [INFO ] Computed 401 place invariants in 2 ms
[2022-05-20 21:58:53] [INFO ] Implicit Places using invariants and state equation in 738 ms returned []
Implicit Place search using SMT with State Equation took 1080 ms to find 0 implicit places.
// Phase 1: matrix 802 rows 803 cols
[2022-05-20 21:58:53] [INFO ] Computed 401 place invariants in 3 ms
[2022-05-20 21:58:54] [INFO ] Dead Transitions using invariants and state equation in 431 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 803/803 places, 802/802 transitions.
Stuttering acceptance computed with spot in 255 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), true, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-100A-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 5}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 4}]], initial=0, aps=[p0:(EQ s497 1), p1:(EQ s631 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-100A-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-100A-LTLFireability-10 finished in 1804 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&(p1 U p2))))'
Support contains 3 out of 803 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 803/803 places, 802/802 transitions.
Reduce places removed 1 places and 1 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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 800 transition count 800
Applied a total of 3 rules in 37 ms. Remains 800 /803 variables (removed 3) and now considering 800/802 (removed 2) transitions.
// Phase 1: matrix 800 rows 800 cols
[2022-05-20 21:58:54] [INFO ] Computed 400 place invariants in 3 ms
[2022-05-20 21:58:54] [INFO ] Implicit Places using invariants in 315 ms returned []
// Phase 1: matrix 800 rows 800 cols
[2022-05-20 21:58:54] [INFO ] Computed 400 place invariants in 1 ms
[2022-05-20 21:58:55] [INFO ] Implicit Places using invariants and state equation in 689 ms returned []
Implicit Place search using SMT with State Equation took 1006 ms to find 0 implicit places.
[2022-05-20 21:58:55] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 800 rows 800 cols
[2022-05-20 21:58:55] [INFO ] Computed 400 place invariants in 1 ms
[2022-05-20 21:58:55] [INFO ] Dead Transitions using invariants and state equation in 406 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 800/803 places, 800/802 transitions.
Finished structural reductions, in 1 iterations. Remains : 800/803 places, 800/802 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p2), (OR (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldRVt-PT-100A-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 0}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p2:(EQ s532 1), p1:(EQ s398 1), p0:(EQ s38 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 618 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 1 ms.
FORMULA ShieldRVt-PT-100A-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-100A-LTLFireability-14 finished in 2174 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F(X(X(F(p0)))))))'
Support contains 1 out of 803 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 803/803 places, 802/802 transitions.
Reduce places removed 1 places and 1 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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 800 transition count 800
Applied a total of 3 rules in 36 ms. Remains 800 /803 variables (removed 3) and now considering 800/802 (removed 2) transitions.
// Phase 1: matrix 800 rows 800 cols
[2022-05-20 21:58:56] [INFO ] Computed 400 place invariants in 3 ms
[2022-05-20 21:58:56] [INFO ] Implicit Places using invariants in 326 ms returned []
// Phase 1: matrix 800 rows 800 cols
[2022-05-20 21:58:56] [INFO ] Computed 400 place invariants in 2 ms
[2022-05-20 21:58:57] [INFO ] Implicit Places using invariants and state equation in 731 ms returned []
Implicit Place search using SMT with State Equation took 1059 ms to find 0 implicit places.
[2022-05-20 21:58:57] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 800 rows 800 cols
[2022-05-20 21:58:57] [INFO ] Computed 400 place invariants in 1 ms
[2022-05-20 21:58:58] [INFO ] Dead Transitions using invariants and state equation in 396 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 800/803 places, 800/802 transitions.
Finished structural reductions, in 1 iterations. Remains : 800/803 places, 800/802 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-100A-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s360 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 607 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA ShieldRVt-PT-100A-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-100A-LTLFireability-15 finished in 2180 ms.
All properties solved by simple procedures.
Total runtime 161123 ms.

BK_STOP 1653083938820

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-100A"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ShieldRVt-PT-100A, 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 r222-tall-165286026201044"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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