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-165286026201043.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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286026201043
=====================================================================

--------------------
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-LTLCardinality-00
FORMULA_NAME ShieldRVt-PT-100A-LTLCardinality-01
FORMULA_NAME ShieldRVt-PT-100A-LTLCardinality-02
FORMULA_NAME ShieldRVt-PT-100A-LTLCardinality-03
FORMULA_NAME ShieldRVt-PT-100A-LTLCardinality-04
FORMULA_NAME ShieldRVt-PT-100A-LTLCardinality-05
FORMULA_NAME ShieldRVt-PT-100A-LTLCardinality-06
FORMULA_NAME ShieldRVt-PT-100A-LTLCardinality-07
FORMULA_NAME ShieldRVt-PT-100A-LTLCardinality-08
FORMULA_NAME ShieldRVt-PT-100A-LTLCardinality-09
FORMULA_NAME ShieldRVt-PT-100A-LTLCardinality-10
FORMULA_NAME ShieldRVt-PT-100A-LTLCardinality-11
FORMULA_NAME ShieldRVt-PT-100A-LTLCardinality-12
FORMULA_NAME ShieldRVt-PT-100A-LTLCardinality-13
FORMULA_NAME ShieldRVt-PT-100A-LTLCardinality-14
FORMULA_NAME ShieldRVt-PT-100A-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1653083653748

Running Version 202205111006
[2022-05-20 21:54:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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:54:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 21:54:15] [INFO ] Load time of PNML (sax parser for PT used): 128 ms
[2022-05-20 21:54:15] [INFO ] Transformed 803 places.
[2022-05-20 21:54:15] [INFO ] Transformed 803 transitions.
[2022-05-20 21:54:15] [INFO ] Found NUPN structural information;
[2022-05-20 21:54:15] [INFO ] Parsed PT model containing 803 places and 803 transitions in 236 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldRVt-PT-100A-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-100A-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-100A-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-100A-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-100A-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 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 101 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:54:15] [INFO ] Computed 401 place invariants in 15 ms
[2022-05-20 21:54:15] [INFO ] Implicit Places using invariants in 565 ms returned []
// Phase 1: matrix 802 rows 803 cols
[2022-05-20 21:54:15] [INFO ] Computed 401 place invariants in 8 ms
[2022-05-20 21:54:16] [INFO ] Implicit Places using invariants and state equation in 755 ms returned []
Implicit Place search using SMT with State Equation took 1347 ms to find 0 implicit places.
// Phase 1: matrix 802 rows 803 cols
[2022-05-20 21:54:16] [INFO ] Computed 401 place invariants in 4 ms
[2022-05-20 21:54:17] [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 28 out of 803 places after structural reductions.
[2022-05-20 21:54:17] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-05-20 21:54:17] [INFO ] Flatten gal took : 166 ms
[2022-05-20 21:54:17] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
FORMULA ShieldRVt-PT-100A-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-100A-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-20 21:54:17] [INFO ] Flatten gal took : 74 ms
[2022-05-20 21:54:17] [INFO ] Input system was already deterministic with 802 transitions.
Support contains 27 out of 803 places (down from 28) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 549 ms. (steps per millisecond=18 ) properties (out of 15) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 10) 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 10) 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 10) 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 10) 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 10) 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 10) 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 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 802 rows 803 cols
[2022-05-20 21:54:19] [INFO ] Computed 401 place invariants in 4 ms
[2022-05-20 21:54:19] [INFO ] [Real]Absence check using 401 positive place invariants in 96 ms returned sat
[2022-05-20 21:54:20] [INFO ] After 1551ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2022-05-20 21:54:21] [INFO ] [Nat]Absence check using 401 positive place invariants in 78 ms returned sat
[2022-05-20 21:54:24] [INFO ] After 2867ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2022-05-20 21:54:26] [INFO ] After 4936ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 2290 ms.
[2022-05-20 21:54:28] [INFO ] After 7732ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 0 properties in 582 ms.
Support contains 21 out of 803 places. Attempting structural reductions.
Starting structural reductions in SAFETY 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
Partial Free-agglomeration rule applied 94 times.
Drop transitions removed 94 transitions
Iterating global reduction 0 with 94 rules applied. Total rules applied 96 place count 802 transition count 801
Drop transitions removed 94 transitions
Redundant transition composition rules discarded 94 transitions
Iterating global reduction 0 with 94 rules applied. Total rules applied 190 place count 802 transition count 707
Applied a total of 190 rules in 241 ms. Remains 802 /803 variables (removed 1) and now considering 707/802 (removed 95) transitions.
Finished structural reductions, in 1 iterations. Remains : 802/803 places, 707/802 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 316 ms. (steps per millisecond=31 ) properties (out of 10) 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 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 10) 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 10) 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 10) seen :0
Finished probabilistic random walk after 104256 steps, run visited all 10 properties in 1541 ms. (steps per millisecond=67 )
Probabilistic random walk after 104256 steps, saw 103294 distinct states, run finished after 1542 ms. (steps per millisecond=67 ) properties seen :10
FORMULA ShieldRVt-PT-100A-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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' '!((p0 U X((X((G(p0)||!F(p1)))||X(p2)))))'
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 18 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:54:32] [INFO ] Computed 401 place invariants in 3 ms
[2022-05-20 21:54:32] [INFO ] Implicit Places using invariants in 413 ms returned []
// Phase 1: matrix 802 rows 803 cols
[2022-05-20 21:54:32] [INFO ] Computed 401 place invariants in 4 ms
[2022-05-20 21:54:33] [INFO ] Implicit Places using invariants and state equation in 785 ms returned []
Implicit Place search using SMT with State Equation took 1200 ms to find 0 implicit places.
// Phase 1: matrix 802 rows 803 cols
[2022-05-20 21:54:33] [INFO ] Computed 401 place invariants in 8 ms
[2022-05-20 21:54:33] [INFO ] Dead Transitions using invariants and state equation in 459 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 803/803 places, 802/802 transitions.
Stuttering acceptance computed with spot in 452 ms :[true, p1, (AND p1 (NOT p0) (NOT p2)), (NOT p0), (AND p1 (NOT p0)), (AND p1 (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldRVt-PT-100A-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 p1), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 6}, { cond=(NOT p0), acceptance={} source=5 dest: 7}], [{ cond=(NOT p0), acceptance={} source=6 dest: 8}, { cond=p0, acceptance={} source=6 dest: 9}], [{ cond=true, acceptance={} source=7 dest: 2}], [{ cond=(NOT p2), acceptance={} source=8 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=9 dest: 8}, { cond=(AND p0 (NOT p2)), acceptance={} source=9 dest: 9}]], initial=5, aps=[p1:(OR (EQ s152 0) (EQ s480 1)), p0:(EQ s434 1), p2:(OR (EQ s769 0) (EQ s459 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 2615 ms.
Product exploration explored 100000 steps with 33333 reset in 2591 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 p1 (NOT p0) p2), (X p0), (X (X p2)), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p2))
Knowledge based reduction with 9 factoid took 156 ms. Reduced automaton from 10 states, 21 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldRVt-PT-100A-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-100A-LTLCardinality-01 finished in 7575 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 2 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 59 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:54:39] [INFO ] Computed 400 place invariants in 2 ms
[2022-05-20 21:54:40] [INFO ] Implicit Places using invariants in 349 ms returned []
// Phase 1: matrix 800 rows 800 cols
[2022-05-20 21:54:40] [INFO ] Computed 400 place invariants in 3 ms
[2022-05-20 21:54:40] [INFO ] Implicit Places using invariants and state equation in 670 ms returned []
Implicit Place search using SMT with State Equation took 1031 ms to find 0 implicit places.
[2022-05-20 21:54:40] [INFO ] Redundant transitions in 46 ms returned []
// Phase 1: matrix 800 rows 800 cols
[2022-05-20 21:54:40] [INFO ] Computed 400 place invariants in 5 ms
[2022-05-20 21:54:41] [INFO ] Dead Transitions using invariants and state equation in 421 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 31 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-100A-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s742 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 216 reset in 736 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 2 ms.
FORMULA ShieldRVt-PT-100A-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-100A-LTLCardinality-04 finished in 2350 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))||G(p1))))'
Support contains 4 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:54:42] [INFO ] Computed 401 place invariants in 6 ms
[2022-05-20 21:54:42] [INFO ] Implicit Places using invariants in 350 ms returned []
// Phase 1: matrix 802 rows 803 cols
[2022-05-20 21:54:42] [INFO ] Computed 401 place invariants in 4 ms
[2022-05-20 21:54:43] [INFO ] Implicit Places using invariants and state equation in 734 ms returned []
Implicit Place search using SMT with State Equation took 1086 ms to find 0 implicit places.
// Phase 1: matrix 802 rows 803 cols
[2022-05-20 21:54:43] [INFO ] Computed 401 place invariants in 4 ms
[2022-05-20 21:54:43] [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.
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-100A-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p1:(AND (NEQ s169 0) (NEQ s751 1)), p0:(AND (NEQ s527 0) (NEQ s173 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 674 ms.
Stack based approach found an accepted trace after 27 steps with 0 reset with depth 28 and stack size 28 in 0 ms.
FORMULA ShieldRVt-PT-100A-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-100A-LTLCardinality-05 finished in 2409 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((p0 U F(X(X(p0)))))||X(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.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 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 49 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:54:44] [INFO ] Computed 401 place invariants in 4 ms
[2022-05-20 21:54:44] [INFO ] Implicit Places using invariants in 329 ms returned [795]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 335 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 26 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 95 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-100A-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s82 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 689 ms.
Product exploration explored 100000 steps with 1 reset in 859 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 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 56 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 78 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X (X p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 82 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 93 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 801 rows 801 cols
[2022-05-20 21:54:47] [INFO ] Computed 400 place invariants in 5 ms
[2022-05-20 21:54:47] [INFO ] [Real]Absence check using 400 positive place invariants in 76 ms returned sat
[2022-05-20 21:54:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 21:54:47] [INFO ] [Real]Absence check using state equation in 228 ms returned sat
[2022-05-20 21:54:47] [INFO ] Computed and/alt/rep : 800/3493/800 causal constraints (skipped 0 transitions) in 43 ms.
[2022-05-20 21:54:47] [INFO ] Added : 0 causal constraints over 0 iterations in 117 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 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 24 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:54:47] [INFO ] Computed 400 place invariants in 2 ms
[2022-05-20 21:54:48] [INFO ] Implicit Places using invariants in 339 ms returned []
// Phase 1: matrix 801 rows 801 cols
[2022-05-20 21:54:48] [INFO ] Computed 400 place invariants in 2 ms
[2022-05-20 21:54:48] [INFO ] Implicit Places using invariants and state equation in 684 ms returned []
Implicit Place search using SMT with State Equation took 1025 ms to find 0 implicit places.
[2022-05-20 21:54:48] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 801 rows 801 cols
[2022-05-20 21:54:48] [INFO ] Computed 400 place invariants in 2 ms
[2022-05-20 21:54:49] [INFO ] Dead Transitions using invariants and state equation in 423 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 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 73 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 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X (X p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 93 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 92 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 801 rows 801 cols
[2022-05-20 21:54:49] [INFO ] Computed 400 place invariants in 3 ms
[2022-05-20 21:54:50] [INFO ] [Real]Absence check using 400 positive place invariants in 58 ms returned sat
[2022-05-20 21:54:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 21:54:50] [INFO ] [Real]Absence check using state equation in 222 ms returned sat
[2022-05-20 21:54:50] [INFO ] Computed and/alt/rep : 800/3493/800 causal constraints (skipped 0 transitions) in 43 ms.
[2022-05-20 21:54:50] [INFO ] Added : 0 causal constraints over 0 iterations in 119 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2 reset in 669 ms.
Product exploration explored 100000 steps with 0 reset in 860 ms.
Built C files in :
/tmp/ltsmin3818220539372129170
[2022-05-20 21:54:52] [INFO ] Computing symmetric may disable matrix : 801 transitions.
[2022-05-20 21:54:52] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 21:54:52] [INFO ] Computing symmetric may enable matrix : 801 transitions.
[2022-05-20 21:54:52] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 21:54:52] [INFO ] Computing Do-Not-Accords matrix : 801 transitions.
[2022-05-20 21:54:52] [INFO ] Computation of Completed DNA matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 21:54:52] [INFO ] Built C files in 157ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3818220539372129170
Running compilation step : cd /tmp/ltsmin3818220539372129170;'/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 2122 ms.
Running link step : cd /tmp/ltsmin3818220539372129170;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin3818220539372129170;'/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/stateBased324635820902945231.hoa' '--buchi-type=spotba'
LTSmin run took 5525 ms.
FORMULA ShieldRVt-PT-100A-LTLCardinality-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldRVt-PT-100A-LTLCardinality-06 finished in 15540 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G(p1))))'
Support contains 4 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 26 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:55:00] [INFO ] Computed 401 place invariants in 2 ms
[2022-05-20 21:55:00] [INFO ] Implicit Places using invariants in 319 ms returned []
// Phase 1: matrix 802 rows 803 cols
[2022-05-20 21:55:00] [INFO ] Computed 401 place invariants in 6 ms
[2022-05-20 21:55:01] [INFO ] Implicit Places using invariants and state equation in 735 ms returned []
Implicit Place search using SMT with State Equation took 1063 ms to find 0 implicit places.
// Phase 1: matrix 802 rows 803 cols
[2022-05-20 21:55:01] [INFO ] Computed 401 place invariants in 2 ms
[2022-05-20 21:55:01] [INFO ] Dead Transitions using invariants and state equation in 410 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 803/803 places, 802/802 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : ShieldRVt-PT-100A-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(OR (EQ s539 0) (EQ s211 1) (EQ s461 0) (EQ s699 1)), p0:(OR (EQ s461 0) (EQ s699 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 674 ms.
Product exploration explored 100000 steps with 0 reset in 850 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 p1 p0), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X p0), true, (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 371 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (NOT p1), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 268 ms. (steps per millisecond=37 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 324242 steps, run timeout after 3003 ms. (steps per millisecond=107 ) properties seen :{0=1, 1=1, 2=1}
Probabilistic random walk after 324242 steps, saw 321710 distinct states, run finished after 3006 ms. (steps per millisecond=107 ) properties seen :3
Running SMT prover for 1 properties.
// Phase 1: matrix 802 rows 803 cols
[2022-05-20 21:55:07] [INFO ] Computed 401 place invariants in 3 ms
[2022-05-20 21:55:07] [INFO ] After 128ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X p0), true, (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X p0)), (G (NOT (AND (NOT p1) p0)))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p1 p0))), (F (NOT p0))]
Knowledge based reduction with 11 factoid took 426 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 91 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 74 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 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 18 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:55:07] [INFO ] Computed 401 place invariants in 3 ms
[2022-05-20 21:55:08] [INFO ] Implicit Places using invariants in 380 ms returned []
// Phase 1: matrix 802 rows 803 cols
[2022-05-20 21:55:08] [INFO ] Computed 401 place invariants in 4 ms
[2022-05-20 21:55:09] [INFO ] Implicit Places using invariants and state equation in 736 ms returned []
Implicit Place search using SMT with State Equation took 1119 ms to find 0 implicit places.
// Phase 1: matrix 802 rows 803 cols
[2022-05-20 21:55:09] [INFO ] Computed 401 place invariants in 5 ms
[2022-05-20 21:55:09] [INFO ] Dead Transitions using invariants and state equation in 452 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 : [(AND p0 p1), (X p1), (X p0), true, (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 316 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 83 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 2) seen :0
Finished probabilistic random walk after 5908 steps, run visited all 2 properties in 136 ms. (steps per millisecond=43 )
Probabilistic random walk after 5908 steps, saw 5740 distinct states, run finished after 136 ms. (steps per millisecond=43 ) properties seen :2
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), true, (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 262 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 70 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 99 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 91 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 729 ms.
Product exploration explored 100000 steps with 0 reset in 864 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 92 ms :[true, (AND (NOT p0) (NOT p1)), (NOT 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: 0
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 803 transition count 802
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 1 rules in 142 ms. Remains 803 /803 variables (removed 0) and now considering 802/802 (removed 0) transitions.
[2022-05-20 21:55:12] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 802 rows 803 cols
[2022-05-20 21:55:12] [INFO ] Computed 401 place invariants in 1 ms
[2022-05-20 21:55:13] [INFO ] Dead Transitions using invariants and state equation in 459 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 708 ms.
Product exploration explored 100000 steps with 0 reset in 859 ms.
Built C files in :
/tmp/ltsmin4435293948763643893
[2022-05-20 21:55:15] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4435293948763643893
Running compilation step : cd /tmp/ltsmin4435293948763643893;'/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 1369 ms.
Running link step : cd /tmp/ltsmin4435293948763643893;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin4435293948763643893;'/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/stateBased3337137540644175224.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 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 26 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:55:30] [INFO ] Computed 401 place invariants in 3 ms
[2022-05-20 21:55:30] [INFO ] Implicit Places using invariants in 380 ms returned []
// Phase 1: matrix 802 rows 803 cols
[2022-05-20 21:55:30] [INFO ] Computed 401 place invariants in 2 ms
[2022-05-20 21:55:31] [INFO ] Implicit Places using invariants and state equation in 751 ms returned []
Implicit Place search using SMT with State Equation took 1133 ms to find 0 implicit places.
// Phase 1: matrix 802 rows 803 cols
[2022-05-20 21:55:31] [INFO ] Computed 401 place invariants in 4 ms
[2022-05-20 21:55:31] [INFO ] Dead Transitions using invariants and state equation in 421 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 803/803 places, 802/802 transitions.
Built C files in :
/tmp/ltsmin8428944244211755322
[2022-05-20 21:55:31] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8428944244211755322
Running compilation step : cd /tmp/ltsmin8428944244211755322;'/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 1383 ms.
Running link step : cd /tmp/ltsmin8428944244211755322;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin8428944244211755322;'/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/stateBased8172005528189070480.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 21:55:46] [INFO ] Flatten gal took : 63 ms
[2022-05-20 21:55:47] [INFO ] Flatten gal took : 56 ms
[2022-05-20 21:55:47] [INFO ] Time to serialize gal into /tmp/LTL10295011859040258967.gal : 9 ms
[2022-05-20 21:55:47] [INFO ] Time to serialize properties into /tmp/LTL3946866885567136577.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/LTL10295011859040258967.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3946866885567136577.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/LTL1029501...267
Read 1 LTL properties
Checking formula 0 : !((("((p461==0)||(p699==1))")U(X(G("(((p539==0)||(p211==1))||((p461==0)||(p699==1)))")))))
Formula 0 simplified : !("((p461==0)||(p699==1))" U XG"(((p539==0)||(p211==1))||((p461==0)||(p699==1)))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2022-05-20 21:56:02] [INFO ] Flatten gal took : 53 ms
[2022-05-20 21:56:02] [INFO ] Applying decomposition
[2022-05-20 21:56:02] [INFO ] Flatten gal took : 54 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/graph13849390258665795295.txt' '-o' '/tmp/graph13849390258665795295.bin' '-w' '/tmp/graph13849390258665795295.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13849390258665795295.bin' '-l' '-1' '-v' '-w' '/tmp/graph13849390258665795295.weights' '-q' '0' '-e' '0.001'
[2022-05-20 21:56:02] [INFO ] Decomposing Gal with order
[2022-05-20 21:56:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 21:56:02] [INFO ] Removed a total of 300 redundant transitions.
[2022-05-20 21:56:02] [INFO ] Flatten gal took : 102 ms
[2022-05-20 21:56:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 40 ms.
[2022-05-20 21:56:02] [INFO ] Time to serialize gal into /tmp/LTL2228349655812121972.gal : 14 ms
[2022-05-20 21:56:02] [INFO ] Time to serialize properties into /tmp/LTL1930969178291211179.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/LTL2228349655812121972.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1930969178291211179.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/LTL2228349...245
Read 1 LTL properties
Checking formula 0 : !((("((i16.u230.p461==0)||(i26.u349.p699==1))")U(X(G("(((i19.i1.i0.u269.p539==0)||(i8.i0.i0.u105.p211==1))||((i16.u230.p461==0)||(i26....176
Formula 0 simplified : !("((i16.u230.p461==0)||(i26.u349.p699==1))" U XG"(((i19.i1.i0.u269.p539==0)||(i8.i0.i0.u105.p211==1))||((i16.u230.p461==0)||(i26.u3...170
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10785012112281234467
[2022-05-20 21:56:17] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10785012112281234467
Running compilation step : cd /tmp/ltsmin10785012112281234467;'/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 1302 ms.
Running link step : cd /tmp/ltsmin10785012112281234467;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin10785012112281234467;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((LTLAPp0==true) U X([]((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVt-PT-100A-LTLCardinality-07 finished in 92704 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(p0))))'
Support contains 3 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 30 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:32] [INFO ] Computed 401 place invariants in 3 ms
[2022-05-20 21:56:33] [INFO ] Implicit Places using invariants in 370 ms returned []
// Phase 1: matrix 802 rows 803 cols
[2022-05-20 21:56:33] [INFO ] Computed 401 place invariants in 2 ms
[2022-05-20 21:56:33] [INFO ] Implicit Places using invariants and state equation in 783 ms returned []
Implicit Place search using SMT with State Equation took 1156 ms to find 0 implicit places.
// Phase 1: matrix 802 rows 803 cols
[2022-05-20 21:56:33] [INFO ] Computed 401 place invariants in 1 ms
[2022-05-20 21:56:34] [INFO ] Dead Transitions using invariants and state equation in 420 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 803/803 places, 802/802 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-100A-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s37 0) (EQ s711 1) (EQ s732 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][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 2432 ms.
Product exploration explored 100000 steps with 33333 reset in 2494 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 (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 57 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldRVt-PT-100A-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-100A-LTLCardinality-08 finished in 6736 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0) U 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:56:39] [INFO ] Computed 400 place invariants in 1 ms
[2022-05-20 21:56:39] [INFO ] Implicit Places using invariants in 310 ms returned []
// Phase 1: matrix 800 rows 800 cols
[2022-05-20 21:56:39] [INFO ] Computed 400 place invariants in 1 ms
[2022-05-20 21:56:40] [INFO ] Implicit Places using invariants and state equation in 684 ms returned []
Implicit Place search using SMT with State Equation took 998 ms to find 0 implicit places.
[2022-05-20 21:56:40] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 800 rows 800 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 426 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 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-100A-LTLCardinality-11 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 (EQ s476 0) (EQ s434 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 684 ms.
Product exploration explored 100000 steps with 0 reset in 810 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 130 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 72 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :0
Finished probabilistic random walk after 5369 steps, run visited all 1 properties in 52 ms. (steps per millisecond=103 )
Probabilistic random walk after 5369 steps, saw 5206 distinct states, run finished after 53 ms. (steps per millisecond=101 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 114 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 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 800 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 800/800 places, 800/800 transitions.
Applied a total of 0 rules in 22 ms. Remains 800 /800 variables (removed 0) and now considering 800/800 (removed 0) transitions.
// Phase 1: matrix 800 rows 800 cols
[2022-05-20 21:56:43] [INFO ] Computed 400 place invariants in 3 ms
[2022-05-20 21:56:43] [INFO ] Implicit Places using invariants in 315 ms returned []
// Phase 1: matrix 800 rows 800 cols
[2022-05-20 21:56:43] [INFO ] Computed 400 place invariants in 4 ms
[2022-05-20 21:56:44] [INFO ] Implicit Places using invariants and state equation in 712 ms returned []
Implicit Place search using SMT with State Equation took 1033 ms to find 0 implicit places.
[2022-05-20 21:56:44] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 800 rows 800 cols
[2022-05-20 21:56:44] [INFO ] Computed 400 place invariants in 2 ms
[2022-05-20 21:56:44] [INFO ] Dead Transitions using invariants and state equation in 410 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 800/800 places, 800/800 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 131 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 89 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :0
Finished probabilistic random walk after 5369 steps, run visited all 1 properties in 52 ms. (steps per millisecond=103 )
Probabilistic random walk after 5369 steps, saw 5206 distinct states, run finished after 53 ms. (steps per millisecond=101 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 133 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 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 665 ms.
Product exploration explored 100000 steps with 0 reset in 816 ms.
Built C files in :
/tmp/ltsmin8480505896944298293
[2022-05-20 21:56:47] [INFO ] Computing symmetric may disable matrix : 800 transitions.
[2022-05-20 21:56:47] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 21:56:47] [INFO ] Computing symmetric may enable matrix : 800 transitions.
[2022-05-20 21:56:47] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 21:56:47] [INFO ] Computing Do-Not-Accords matrix : 800 transitions.
[2022-05-20 21:56:47] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 21:56:47] [INFO ] Built C files in 80ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8480505896944298293
Running compilation step : cd /tmp/ltsmin8480505896944298293;'/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 1996 ms.
Running link step : cd /tmp/ltsmin8480505896944298293;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin8480505896944298293;'/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/stateBased14136029441481688644.hoa' '--buchi-type=spotba'
LTSmin run took 5349 ms.
FORMULA ShieldRVt-PT-100A-LTLCardinality-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldRVt-PT-100A-LTLCardinality-11 finished in 15100 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(F(X(G(p0))))||p1))))'
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 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:56:54] [INFO ] Computed 401 place invariants in 3 ms
[2022-05-20 21:56:54] [INFO ] Implicit Places using invariants in 355 ms returned [795]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 356 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 33 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-100A-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s423 0) (EQ s582 1)), p1:(AND (EQ s298 0) (EQ s582 1))], nbAcceptance=2, 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 706 ms.
Product exploration explored 100000 steps with 0 reset in 858 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 (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 298 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 801 rows 801 cols
[2022-05-20 21:56:57] [INFO ] Computed 400 place invariants in 3 ms
[2022-05-20 21:56:57] [INFO ] [Real]Absence check using 400 positive place invariants in 59 ms returned sat
[2022-05-20 21:56:57] [INFO ] After 633ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 21:56:58] [INFO ] [Nat]Absence check using 400 positive place invariants in 55 ms returned sat
[2022-05-20 21:56:58] [INFO ] After 518ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 21:56:58] [INFO ] After 650ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 80 ms.
[2022-05-20 21:56:58] [INFO ] After 940ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 61 ms.
Support contains 3 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 55 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 157 ms. (steps per millisecond=63 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 2) seen :0
Finished probabilistic random walk after 22834 steps, run visited all 2 properties in 385 ms. (steps per millisecond=59 )
Probabilistic random walk after 22834 steps, saw 22287 distinct states, run finished after 387 ms. (steps per millisecond=59 ) properties seen :2
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 p1)), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 9 factoid took 414 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 25 ms :[(AND (NOT p0) (NOT p1))]
// Phase 1: matrix 801 rows 801 cols
[2022-05-20 21:57:00] [INFO ] Computed 400 place invariants in 4 ms
[2022-05-20 21:57:00] [INFO ] [Real]Absence check using 400 positive place invariants in 57 ms returned sat
[2022-05-20 21:57:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 21:57:00] [INFO ] [Real]Absence check using state equation in 224 ms returned sat
[2022-05-20 21:57:00] [INFO ] Computed and/alt/rep : 800/3493/800 causal constraints (skipped 0 transitions) in 46 ms.
[2022-05-20 21:57:00] [INFO ] Added : 0 causal constraints over 0 iterations in 113 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
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 26 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:00] [INFO ] Computed 400 place invariants in 2 ms
[2022-05-20 21:57:01] [INFO ] Implicit Places using invariants in 330 ms returned []
// Phase 1: matrix 801 rows 801 cols
[2022-05-20 21:57:01] [INFO ] Computed 400 place invariants in 1 ms
[2022-05-20 21:57:01] [INFO ] Implicit Places using invariants and state equation in 745 ms returned []
Implicit Place search using SMT with State Equation took 1077 ms to find 0 implicit places.
[2022-05-20 21:57:02] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 801 rows 801 cols
[2022-05-20 21:57:02] [INFO ] Computed 400 place invariants in 1 ms
[2022-05-20 21:57:02] [INFO ] Dead Transitions using invariants and state equation in 446 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 (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 343 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 801 rows 801 cols
[2022-05-20 21:57:03] [INFO ] Computed 400 place invariants in 3 ms
[2022-05-20 21:57:03] [INFO ] [Real]Absence check using 400 positive place invariants in 55 ms returned sat
[2022-05-20 21:57:03] [INFO ] After 576ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 21:57:03] [INFO ] [Nat]Absence check using 400 positive place invariants in 58 ms returned sat
[2022-05-20 21:57:04] [INFO ] After 521ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 21:57:04] [INFO ] After 647ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 88 ms.
[2022-05-20 21:57:04] [INFO ] After 952ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 49 ms.
Support contains 3 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 46 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 157 ms. (steps per millisecond=63 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 2) seen :0
Finished probabilistic random walk after 22834 steps, run visited all 2 properties in 388 ms. (steps per millisecond=58 )
Probabilistic random walk after 22834 steps, saw 22287 distinct states, run finished after 391 ms. (steps per millisecond=58 ) properties seen :2
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 p1)), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 9 factoid took 463 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 26 ms :[(AND (NOT p0) (NOT p1))]
// Phase 1: matrix 801 rows 801 cols
[2022-05-20 21:57:06] [INFO ] Computed 400 place invariants in 4 ms
[2022-05-20 21:57:06] [INFO ] [Real]Absence check using 400 positive place invariants in 57 ms returned sat
[2022-05-20 21:57:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 21:57:06] [INFO ] [Real]Absence check using state equation in 225 ms returned sat
[2022-05-20 21:57:06] [INFO ] Computed and/alt/rep : 800/3493/800 causal constraints (skipped 0 transitions) in 43 ms.
[2022-05-20 21:57:06] [INFO ] Added : 0 causal constraints over 0 iterations in 119 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 741 ms.
Product exploration explored 100000 steps with 0 reset in 872 ms.
Built C files in :
/tmp/ltsmin13836561627497125634
[2022-05-20 21:57:08] [INFO ] Computing symmetric may disable matrix : 801 transitions.
[2022-05-20 21:57:08] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 21:57:08] [INFO ] Computing symmetric may enable matrix : 801 transitions.
[2022-05-20 21:57:08] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 21:57:08] [INFO ] Computing Do-Not-Accords matrix : 801 transitions.
[2022-05-20 21:57:08] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 21:57:08] [INFO ] Built C files in 70ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13836561627497125634
Running compilation step : cd /tmp/ltsmin13836561627497125634;'/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 2162 ms.
Running link step : cd /tmp/ltsmin13836561627497125634;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin13836561627497125634;'/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/stateBased5065634475584132939.hoa' '--buchi-type=spotba'
LTSmin run took 4257 ms.
FORMULA ShieldRVt-PT-100A-LTLCardinality-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldRVt-PT-100A-LTLCardinality-14 finished in 20369 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G(p1))))'
Found a SL insensitive property : ShieldRVt-PT-100A-LTLCardinality-07
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (NOT p1), true]
Support contains 4 out of 803 places. Attempting structural reductions.
Starting structural reductions in SLCL_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 0 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 35 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:57:15] [INFO ] Computed 400 place invariants in 2 ms
[2022-05-20 21:57:15] [INFO ] Implicit Places using invariants in 342 ms returned []
// Phase 1: matrix 800 rows 800 cols
[2022-05-20 21:57:15] [INFO ] Computed 400 place invariants in 5 ms
[2022-05-20 21:57:16] [INFO ] Implicit Places using invariants and state equation in 653 ms returned []
Implicit Place search using SMT with State Equation took 998 ms to find 0 implicit places.
// Phase 1: matrix 800 rows 800 cols
[2022-05-20 21:57:16] [INFO ] Computed 400 place invariants in 5 ms
[2022-05-20 21:57:16] [INFO ] Dead Transitions using invariants and state equation in 446 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 800/803 places, 800/802 transitions.
Finished structural reductions, in 1 iterations. Remains : 800/803 places, 800/802 transitions.
Running random walk in product with property : ShieldRVt-PT-100A-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(OR (EQ s538 0) (EQ s210 1) (EQ s460 0) (EQ s698 1)), p0:(OR (EQ s460 0) (EQ s698 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 696 ms.
Product exploration explored 100000 steps with 0 reset in 842 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X p0), true, (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 394 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), (NOT p1), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 299 ms. (steps per millisecond=33 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 342847 steps, run timeout after 3301 ms. (steps per millisecond=103 ) properties seen :{0=1, 1=1, 2=1}
Probabilistic random walk after 342847 steps, saw 340069 distinct states, run finished after 3302 ms. (steps per millisecond=103 ) properties seen :3
Running SMT prover for 1 properties.
// Phase 1: matrix 800 rows 800 cols
[2022-05-20 21:57:22] [INFO ] Computed 400 place invariants in 1 ms
[2022-05-20 21:57:22] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X p0), true, (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X p0)), (G (NOT (AND (NOT p1) p0)))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p1 p0))), (F (NOT p0))]
Knowledge based reduction with 11 factoid took 459 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 76 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 76 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 800 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 800/800 places, 800/800 transitions.
Applied a total of 0 rules in 14 ms. Remains 800 /800 variables (removed 0) and now considering 800/800 (removed 0) transitions.
// Phase 1: matrix 800 rows 800 cols
[2022-05-20 21:57:23] [INFO ] Computed 400 place invariants in 3 ms
[2022-05-20 21:57:23] [INFO ] Implicit Places using invariants in 316 ms returned []
// Phase 1: matrix 800 rows 800 cols
[2022-05-20 21:57:23] [INFO ] Computed 400 place invariants in 4 ms
[2022-05-20 21:57:24] [INFO ] Implicit Places using invariants and state equation in 691 ms returned []
Implicit Place search using SMT with State Equation took 1009 ms to find 0 implicit places.
// Phase 1: matrix 800 rows 800 cols
[2022-05-20 21:57:24] [INFO ] Computed 400 place invariants in 2 ms
[2022-05-20 21:57:24] [INFO ] Dead Transitions using invariants and state equation in 395 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 800/800 places, 800/800 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), true, (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 549 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 77 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 2) seen :0
Finished probabilistic random walk after 5915 steps, run visited all 2 properties in 84 ms. (steps per millisecond=70 )
Probabilistic random walk after 5915 steps, saw 5743 distinct states, run finished after 85 ms. (steps per millisecond=69 ) properties seen :2
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), true, (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 266 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 67 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 75 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 62 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 714 ms.
Product exploration explored 100000 steps with 0 reset in 891 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 68 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 800 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 800/800 places, 800/800 transitions.
Applied a total of 0 rules in 22 ms. Remains 800 /800 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2022-05-20 21:57:27] [INFO ] Redundant transitions in 16 ms returned []
// Phase 1: matrix 800 rows 800 cols
[2022-05-20 21:57:27] [INFO ] Computed 400 place invariants in 3 ms
[2022-05-20 21:57:28] [INFO ] Dead Transitions using invariants and state equation in 393 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 800/800 places, 800/800 transitions.
Product exploration explored 100000 steps with 0 reset in 691 ms.
Product exploration explored 100000 steps with 0 reset in 826 ms.
Built C files in :
/tmp/ltsmin5457659010221500948
[2022-05-20 21:57:29] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5457659010221500948
Running compilation step : cd /tmp/ltsmin5457659010221500948;'/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 1231 ms.
Running link step : cd /tmp/ltsmin5457659010221500948;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin5457659010221500948;'/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/stateBased11378107855070719378.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 800 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 800/800 places, 800/800 transitions.
Applied a total of 0 rules in 19 ms. Remains 800 /800 variables (removed 0) and now considering 800/800 (removed 0) transitions.
// Phase 1: matrix 800 rows 800 cols
[2022-05-20 21:57:45] [INFO ] Computed 400 place invariants in 4 ms
[2022-05-20 21:57:45] [INFO ] Implicit Places using invariants in 320 ms returned []
// Phase 1: matrix 800 rows 800 cols
[2022-05-20 21:57:45] [INFO ] Computed 400 place invariants in 4 ms
[2022-05-20 21:57:45] [INFO ] Implicit Places using invariants and state equation in 653 ms returned []
Implicit Place search using SMT with State Equation took 978 ms to find 0 implicit places.
// Phase 1: matrix 800 rows 800 cols
[2022-05-20 21:57:46] [INFO ] Computed 400 place invariants in 2 ms
[2022-05-20 21:57:46] [INFO ] Dead Transitions using invariants and state equation in 444 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 800/800 places, 800/800 transitions.
Built C files in :
/tmp/ltsmin16794365494797247888
[2022-05-20 21:57:46] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16794365494797247888
Running compilation step : cd /tmp/ltsmin16794365494797247888;'/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 1294 ms.
Running link step : cd /tmp/ltsmin16794365494797247888;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin16794365494797247888;'/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/stateBased16862564118923201498.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 21:58:01] [INFO ] Flatten gal took : 26 ms
[2022-05-20 21:58:01] [INFO ] Flatten gal took : 25 ms
[2022-05-20 21:58:01] [INFO ] Time to serialize gal into /tmp/LTL3471069281270320937.gal : 5 ms
[2022-05-20 21:58:01] [INFO ] Time to serialize properties into /tmp/LTL12538053513510454355.ltl : 0 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/LTL3471069281270320937.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12538053513510454355.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/LTL3471069...267
Read 1 LTL properties
Checking formula 0 : !((("((p461==0)||(p699==1))")U(X(G("(((p539==0)||(p211==1))||((p461==0)||(p699==1)))")))))
Formula 0 simplified : !("((p461==0)||(p699==1))" U XG"(((p539==0)||(p211==1))||((p461==0)||(p699==1)))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2022-05-20 21:58:16] [INFO ] Flatten gal took : 36 ms
[2022-05-20 21:58:16] [INFO ] Applying decomposition
[2022-05-20 21:58:16] [INFO ] Flatten gal took : 27 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/graph14199679697216562251.txt' '-o' '/tmp/graph14199679697216562251.bin' '-w' '/tmp/graph14199679697216562251.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14199679697216562251.bin' '-l' '-1' '-v' '-w' '/tmp/graph14199679697216562251.weights' '-q' '0' '-e' '0.001'
[2022-05-20 21:58:16] [INFO ] Decomposing Gal with order
[2022-05-20 21:58:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 21:58:16] [INFO ] Removed a total of 299 redundant transitions.
[2022-05-20 21:58:16] [INFO ] Flatten gal took : 49 ms
[2022-05-20 21:58:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2022-05-20 21:58:16] [INFO ] Time to serialize gal into /tmp/LTL14839208085752889655.gal : 8 ms
[2022-05-20 21:58:16] [INFO ] Time to serialize properties into /tmp/LTL17255693065074736607.ltl : 0 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/LTL14839208085752889655.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17255693065074736607.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/LTL1483920...247
Read 1 LTL properties
Checking formula 0 : !((("((i19.u230.p461==0)||(i29.i0.i1.u349.p699==1))")U(X(G("(((i22.i1.i0.u269.p539==0)||(i8.i1.i1.u105.p211==1))||((i19.u230.p461==0)|...188
Formula 0 simplified : !("((i19.u230.p461==0)||(i29.i0.i1.u349.p699==1))" U XG"(((i22.i1.i0.u269.p539==0)||(i8.i1.i1.u105.p211==1))||((i19.u230.p461==0)||(...182
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6440006353511273867
[2022-05-20 21:58:32] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6440006353511273867
Running compilation step : cd /tmp/ltsmin6440006353511273867;'/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 1344 ms.
Running link step : cd /tmp/ltsmin6440006353511273867;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin6440006353511273867;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((LTLAPp0==true) U X([]((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVt-PT-100A-LTLCardinality-07 finished in 92173 ms.
[2022-05-20 21:58:47] [INFO ] Flatten gal took : 41 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14708022563777653894
[2022-05-20 21:58:47] [INFO ] Computing symmetric may disable matrix : 802 transitions.
[2022-05-20 21:58:47] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 21:58:47] [INFO ] Computing symmetric may enable matrix : 802 transitions.
[2022-05-20 21:58:47] [INFO ] Applying decomposition
[2022-05-20 21:58:47] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 21:58:47] [INFO ] Flatten gal took : 39 ms
[2022-05-20 21:58:47] [INFO ] Computing Do-Not-Accords matrix : 802 transitions.
[2022-05-20 21:58:47] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 21:58:47] [INFO ] Built C files in 89ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14708022563777653894
Running compilation step : cd /tmp/ltsmin14708022563777653894;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' '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'
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/graph4659504528507637670.txt' '-o' '/tmp/graph4659504528507637670.bin' '-w' '/tmp/graph4659504528507637670.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4659504528507637670.bin' '-l' '-1' '-v' '-w' '/tmp/graph4659504528507637670.weights' '-q' '0' '-e' '0.001'
[2022-05-20 21:58:47] [INFO ] Decomposing Gal with order
[2022-05-20 21:58:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 21:58:47] [INFO ] Removed a total of 300 redundant transitions.
[2022-05-20 21:58:47] [INFO ] Flatten gal took : 55 ms
[2022-05-20 21:58:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 42 ms.
[2022-05-20 21:58:47] [INFO ] Time to serialize gal into /tmp/LTLCardinality7986814883489925651.gal : 22 ms
[2022-05-20 21:58:47] [INFO ] Time to serialize properties into /tmp/LTLCardinality8904027571751449405.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/LTLCardinality7986814883489925651.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8904027571751449405.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/LTLCardina...267
Read 1 LTL properties
Checking formula 0 : !((("((i18.i0.i0.u230.p461==0)||(i27.u349.p699==1))")U(X(G("(((i20.i1.i1.u269.p539==0)||(i8.u105.p211==1))||((i18.i0.i0.u230.p461==0)|...182
Formula 0 simplified : !("((i18.i0.i0.u230.p461==0)||(i27.u349.p699==1))" U XG"(((i20.i1.i1.u269.p539==0)||(i8.u105.p211==1))||((i18.i0.i0.u230.p461==0)||(...176
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Compilation finished in 2213 ms.
Running link step : cd /tmp/ltsmin14708022563777653894;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin14708022563777653894;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((LTLAPp0==true) U X([]((LTLAPp1==true))))' '--buchi-type=spotba'
LTSmin run took 188472 ms.
FORMULA ShieldRVt-PT-100A-LTLCardinality-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 463203 ms.

BK_STOP 1653084118182

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="LTLCardinality"
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 LTLCardinality"
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-165286026201043"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;