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-165286025000292.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 ShieldIIPt-PT-030A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025000292
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 384K
-rw-r--r-- 1 mcc users 5.9K Apr 29 19:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Apr 29 19:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 29 18:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 29 18:50 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 4.0K May 9 08:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 08:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:50 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 159K 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 ShieldIIPt-PT-030A-LTLFireability-00
FORMULA_NAME ShieldIIPt-PT-030A-LTLFireability-01
FORMULA_NAME ShieldIIPt-PT-030A-LTLFireability-02
FORMULA_NAME ShieldIIPt-PT-030A-LTLFireability-03
FORMULA_NAME ShieldIIPt-PT-030A-LTLFireability-04
FORMULA_NAME ShieldIIPt-PT-030A-LTLFireability-05
FORMULA_NAME ShieldIIPt-PT-030A-LTLFireability-06
FORMULA_NAME ShieldIIPt-PT-030A-LTLFireability-07
FORMULA_NAME ShieldIIPt-PT-030A-LTLFireability-08
FORMULA_NAME ShieldIIPt-PT-030A-LTLFireability-09
FORMULA_NAME ShieldIIPt-PT-030A-LTLFireability-10
FORMULA_NAME ShieldIIPt-PT-030A-LTLFireability-11
FORMULA_NAME ShieldIIPt-PT-030A-LTLFireability-12
FORMULA_NAME ShieldIIPt-PT-030A-LTLFireability-13
FORMULA_NAME ShieldIIPt-PT-030A-LTLFireability-14
FORMULA_NAME ShieldIIPt-PT-030A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652959841968

Running Version 202205111006
[2022-05-19 11:30:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-19 11:30:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 11:30:43] [INFO ] Load time of PNML (sax parser for PT used): 117 ms
[2022-05-19 11:30:43] [INFO ] Transformed 573 places.
[2022-05-19 11:30:43] [INFO ] Transformed 423 transitions.
[2022-05-19 11:30:43] [INFO ] Found NUPN structural information;
[2022-05-19 11:30:43] [INFO ] Parsed PT model containing 573 places and 423 transitions in 244 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldIIPt-PT-030A-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-030A-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-030A-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 64 out of 573 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 573/573 places, 422/422 transitions.
Applied a total of 0 rules in 52 ms. Remains 573 /573 variables (removed 0) and now considering 422/422 (removed 0) transitions.
// Phase 1: matrix 422 rows 573 cols
[2022-05-19 11:30:44] [INFO ] Computed 271 place invariants in 22 ms
[2022-05-19 11:30:44] [INFO ] Implicit Places using invariants in 455 ms returned []
// Phase 1: matrix 422 rows 573 cols
[2022-05-19 11:30:44] [INFO ] Computed 271 place invariants in 11 ms
[2022-05-19 11:30:45] [INFO ] Implicit Places using invariants and state equation in 562 ms returned []
Implicit Place search using SMT with State Equation took 1043 ms to find 0 implicit places.
// Phase 1: matrix 422 rows 573 cols
[2022-05-19 11:30:45] [INFO ] Computed 271 place invariants in 3 ms
[2022-05-19 11:30:45] [INFO ] Dead Transitions using invariants and state equation in 284 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 573/573 places, 422/422 transitions.
Support contains 64 out of 573 places after structural reductions.
[2022-05-19 11:30:45] [INFO ] Flatten gal took : 168 ms
[2022-05-19 11:30:45] [INFO ] Flatten gal took : 62 ms
[2022-05-19 11:30:46] [INFO ] Input system was already deterministic with 422 transitions.
Support contains 61 out of 573 places (down from 64) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 655 ms. (steps per millisecond=15 ) properties (out of 32) seen :12
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
// Phase 1: matrix 422 rows 573 cols
[2022-05-19 11:30:46] [INFO ] Computed 271 place invariants in 3 ms
[2022-05-19 11:30:47] [INFO ] [Real]Absence check using 271 positive place invariants in 50 ms returned sat
[2022-05-19 11:30:48] [INFO ] After 1671ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2022-05-19 11:30:48] [INFO ] [Nat]Absence check using 271 positive place invariants in 64 ms returned sat
[2022-05-19 11:30:50] [INFO ] After 1140ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :20
[2022-05-19 11:30:51] [INFO ] After 2247ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :20
Attempting to minimize the solution found.
Minimization took 804 ms.
[2022-05-19 11:30:52] [INFO ] After 3640ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :20
Parikh walk visited 6 properties in 1800 ms.
Support contains 25 out of 573 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 573/573 places, 422/422 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 573 transition count 421
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 572 transition count 421
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 4 place count 571 transition count 420
Partial Free-agglomeration rule applied 53 times.
Drop transitions removed 53 transitions
Iterating global reduction 0 with 53 rules applied. Total rules applied 57 place count 571 transition count 420
Applied a total of 57 rules in 103 ms. Remains 571 /573 variables (removed 2) and now considering 420/422 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 571/573 places, 420/422 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 293 ms. (steps per millisecond=34 ) properties (out of 14) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 420 rows 571 cols
[2022-05-19 11:30:55] [INFO ] Computed 271 place invariants in 4 ms
[2022-05-19 11:30:55] [INFO ] [Real]Absence check using 271 positive place invariants in 35 ms returned sat
[2022-05-19 11:30:56] [INFO ] After 1189ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2022-05-19 11:30:56] [INFO ] [Nat]Absence check using 271 positive place invariants in 37 ms returned sat
[2022-05-19 11:30:57] [INFO ] After 599ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2022-05-19 11:30:57] [INFO ] State equation strengthened by 29 read => feed constraints.
[2022-05-19 11:30:57] [INFO ] After 409ms SMT Verify possible using 29 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2022-05-19 11:30:58] [INFO ] After 945ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 493 ms.
[2022-05-19 11:30:58] [INFO ] After 2371ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 869 ms.
Support contains 20 out of 571 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 571/571 places, 420/420 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 571 transition count 420
Applied a total of 1 rules in 53 ms. Remains 571 /571 variables (removed 0) and now considering 420/420 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 571/571 places, 420/420 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 381 ms. (steps per millisecond=26 ) properties (out of 11) 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 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 11) 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 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 11) 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 11) 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 11) seen :0
Finished probabilistic random walk after 37356 steps, run visited all 11 properties in 480 ms. (steps per millisecond=77 )
Probabilistic random walk after 37356 steps, saw 36136 distinct states, run finished after 481 ms. (steps per millisecond=77 ) properties seen :11
FORMULA ShieldIIPt-PT-030A-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA ShieldIIPt-PT-030A-LTLFireability-13 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' '!((F((p0 U X(p1)))&&(X(F(p0))||F(p2)||G(p3))))'
Support contains 8 out of 573 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 573/573 places, 422/422 transitions.
Applied a total of 0 rules in 29 ms. Remains 573 /573 variables (removed 0) and now considering 422/422 (removed 0) transitions.
// Phase 1: matrix 422 rows 573 cols
[2022-05-19 11:31:01] [INFO ] Computed 271 place invariants in 8 ms
[2022-05-19 11:31:02] [INFO ] Implicit Places using invariants in 399 ms returned []
// Phase 1: matrix 422 rows 573 cols
[2022-05-19 11:31:02] [INFO ] Computed 271 place invariants in 2 ms
[2022-05-19 11:31:02] [INFO ] Implicit Places using invariants and state equation in 521 ms returned []
Implicit Place search using SMT with State Equation took 922 ms to find 0 implicit places.
// Phase 1: matrix 422 rows 573 cols
[2022-05-19 11:31:02] [INFO ] Computed 271 place invariants in 8 ms
[2022-05-19 11:31:03] [INFO ] Dead Transitions using invariants and state equation in 284 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 573/573 places, 422/422 transitions.
Stuttering acceptance computed with spot in 483 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2) (NOT p3))), (NOT p1), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p3))]
Running random walk in product with property : ShieldIIPt-PT-030A-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p3), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p3 (NOT p0)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s375 1) (EQ s390 1)), p3:(AND (EQ s164 1) (EQ s189 1)), p1:(AND (EQ s176 1) (EQ s187 1)), p0:(AND (EQ s139 1) (EQ s148 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 695 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 1 ms.
FORMULA ShieldIIPt-PT-030A-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-030A-LTLFireability-00 finished in 2479 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 573 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 573/573 places, 422/422 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 573 transition count 421
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 572 transition count 421
Applied a total of 2 rules in 33 ms. Remains 572 /573 variables (removed 1) and now considering 421/422 (removed 1) transitions.
// Phase 1: matrix 421 rows 572 cols
[2022-05-19 11:31:04] [INFO ] Computed 271 place invariants in 2 ms
[2022-05-19 11:31:04] [INFO ] Implicit Places using invariants in 324 ms returned [563]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 328 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 571/573 places, 421/422 transitions.
Applied a total of 0 rules in 20 ms. Remains 571 /571 variables (removed 0) and now considering 421/421 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 571/573 places, 421/422 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-030A-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s562 1) (EQ s564 1) (EQ s570 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 559 ms.
Stack based approach found an accepted trace after 60 steps with 0 reset with depth 61 and stack size 61 in 1 ms.
FORMULA ShieldIIPt-PT-030A-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-030A-LTLFireability-02 finished in 999 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((((G(X(p0))||!p1) U p2)&&G(G(p3)))))'
Support contains 5 out of 573 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 573/573 places, 422/422 transitions.
Applied a total of 0 rules in 8 ms. Remains 573 /573 variables (removed 0) and now considering 422/422 (removed 0) transitions.
// Phase 1: matrix 422 rows 573 cols
[2022-05-19 11:31:05] [INFO ] Computed 271 place invariants in 1 ms
[2022-05-19 11:31:05] [INFO ] Implicit Places using invariants in 277 ms returned []
// Phase 1: matrix 422 rows 573 cols
[2022-05-19 11:31:05] [INFO ] Computed 271 place invariants in 2 ms
[2022-05-19 11:31:06] [INFO ] Implicit Places using invariants and state equation in 525 ms returned []
Implicit Place search using SMT with State Equation took 804 ms to find 0 implicit places.
// Phase 1: matrix 422 rows 573 cols
[2022-05-19 11:31:06] [INFO ] Computed 271 place invariants in 2 ms
[2022-05-19 11:31:06] [INFO ] Dead Transitions using invariants and state equation in 277 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 573/573 places, 422/422 transitions.
Stuttering acceptance computed with spot in 216 ms :[(OR (NOT p3) (NOT p0) (NOT p2)), (NOT p3), (OR (NOT p0) (NOT p3)), true, (OR (NOT p2) (NOT p3)), (OR (NOT p3) (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-030A-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND p3 (NOT p2) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p3 p2 p0), acceptance={0} source=0 dest: 2}, { cond=(OR (NOT p3) (NOT p0)), acceptance={0} source=0 dest: 3}], [{ cond=p3, acceptance={} source=1 dest: 1}, { cond=(NOT p3), acceptance={} source=1 dest: 3}], [{ cond=(AND p3 p0), acceptance={} source=2 dest: 2}, { cond=(OR (NOT p3) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(AND p3 (NOT p2) p1), acceptance={0} source=5 dest: 0}, { cond=(AND p3 p2), acceptance={0} source=5 dest: 1}, { cond=(NOT p3), acceptance={0} source=5 dest: 3}, { cond=(AND p3 (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=4, aps=[p3:(OR (EQ s385 0) (EQ s396 0)), p2:(AND (EQ s52 1) (EQ s67 1)), p0:(EQ s227 1), p1:(AND (EQ s385 1) (EQ s396 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3902 steps with 0 reset in 40 ms.
FORMULA ShieldIIPt-PT-030A-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030A-LTLFireability-03 finished in 1375 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(X(p0))||p1)))'
Support contains 3 out of 573 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 573/573 places, 422/422 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 572 transition count 420
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 570 transition count 420
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 6 place count 568 transition count 419
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 6 place count 568 transition count 418
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 567 transition count 418
Applied a total of 8 rules in 33 ms. Remains 567 /573 variables (removed 6) and now considering 418/422 (removed 4) transitions.
// Phase 1: matrix 418 rows 567 cols
[2022-05-19 11:31:06] [INFO ] Computed 269 place invariants in 3 ms
[2022-05-19 11:31:06] [INFO ] Implicit Places using invariants in 287 ms returned [556]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 288 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 566/573 places, 418/422 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 565 transition count 417
Applied a total of 2 rules in 38 ms. Remains 565 /566 variables (removed 1) and now considering 417/418 (removed 1) transitions.
// Phase 1: matrix 417 rows 565 cols
[2022-05-19 11:31:07] [INFO ] Computed 268 place invariants in 3 ms
[2022-05-19 11:31:07] [INFO ] Implicit Places using invariants in 276 ms returned []
// Phase 1: matrix 417 rows 565 cols
[2022-05-19 11:31:07] [INFO ] Computed 268 place invariants in 4 ms
[2022-05-19 11:31:07] [INFO ] Implicit Places using invariants and state equation in 474 ms returned []
Implicit Place search using SMT with State Equation took 753 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 565/573 places, 417/422 transitions.
Finished structural reductions, in 2 iterations. Remains : 565/573 places, 417/422 transitions.
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-030A-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s414 0), p0:(AND (EQ s310 1) (EQ s312 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 5 reset in 587 ms.
Stack based approach found an accepted trace after 4351 steps with 0 reset with depth 4352 and stack size 3497 in 33 ms.
FORMULA ShieldIIPt-PT-030A-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-030A-LTLFireability-05 finished in 1799 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 573 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 573/573 places, 422/422 transitions.
Applied a total of 0 rules in 6 ms. Remains 573 /573 variables (removed 0) and now considering 422/422 (removed 0) transitions.
// Phase 1: matrix 422 rows 573 cols
[2022-05-19 11:31:08] [INFO ] Computed 271 place invariants in 2 ms
[2022-05-19 11:31:08] [INFO ] Implicit Places using invariants in 271 ms returned []
// Phase 1: matrix 422 rows 573 cols
[2022-05-19 11:31:08] [INFO ] Computed 271 place invariants in 4 ms
[2022-05-19 11:31:09] [INFO ] Implicit Places using invariants and state equation in 502 ms returned []
Implicit Place search using SMT with State Equation took 774 ms to find 0 implicit places.
// Phase 1: matrix 422 rows 573 cols
[2022-05-19 11:31:09] [INFO ] Computed 271 place invariants in 1 ms
[2022-05-19 11:31:09] [INFO ] Dead Transitions using invariants and state equation in 249 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 573/573 places, 422/422 transitions.
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-030A-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s240 0) (EQ s265 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 5124 steps with 0 reset in 28 ms.
FORMULA ShieldIIPt-PT-030A-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030A-LTLFireability-06 finished in 1169 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0) U !F(p1)))'
Support contains 5 out of 573 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 573/573 places, 422/422 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 573 transition count 421
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 572 transition count 421
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 571 transition count 420
Applied a total of 4 rules in 24 ms. Remains 571 /573 variables (removed 2) and now considering 420/422 (removed 2) transitions.
// Phase 1: matrix 420 rows 571 cols
[2022-05-19 11:31:09] [INFO ] Computed 271 place invariants in 2 ms
[2022-05-19 11:31:10] [INFO ] Implicit Places using invariants in 351 ms returned [563, 564]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 363 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 569/573 places, 420/422 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 569 transition count 419
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 568 transition count 419
Applied a total of 2 rules in 16 ms. Remains 568 /569 variables (removed 1) and now considering 419/420 (removed 1) transitions.
// Phase 1: matrix 419 rows 568 cols
[2022-05-19 11:31:10] [INFO ] Computed 269 place invariants in 1 ms
[2022-05-19 11:31:10] [INFO ] Implicit Places using invariants in 370 ms returned [557]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 375 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 567/573 places, 419/422 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 566 transition count 418
Applied a total of 2 rules in 30 ms. Remains 566 /567 variables (removed 1) and now considering 418/419 (removed 1) transitions.
// Phase 1: matrix 418 rows 566 cols
[2022-05-19 11:31:10] [INFO ] Computed 268 place invariants in 1 ms
[2022-05-19 11:31:10] [INFO ] Implicit Places using invariants in 304 ms returned []
// Phase 1: matrix 418 rows 566 cols
[2022-05-19 11:31:10] [INFO ] Computed 268 place invariants in 2 ms
[2022-05-19 11:31:11] [INFO ] Implicit Places using invariants and state equation in 555 ms returned []
Implicit Place search using SMT with State Equation took 887 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 566/573 places, 418/422 transitions.
Finished structural reductions, in 3 iterations. Remains : 566/573 places, 418/422 transitions.
Stuttering acceptance computed with spot in 1262 ms :[p1, true, p1, (AND (NOT p1) p0)]
Running random walk in product with property : ShieldIIPt-PT-030A-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s233 1) (EQ s244 1) (EQ s64 1) (EQ s66 1) (EQ s267 1)), p0:(AND (EQ s64 1) (EQ s66 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 634 ms.
Product exploration explored 100000 steps with 0 reset in 821 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 478 ms. Reduced automaton from 4 states, 10 edges and 2 AP to 4 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 100 ms :[p1, true, p1, (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 301870 steps, run timeout after 3001 ms. (steps per millisecond=100 ) properties seen :{0=1, 2=1, 3=1, 4=1}
Probabilistic random walk after 301870 steps, saw 296493 distinct states, run finished after 3001 ms. (steps per millisecond=100 ) properties seen :4
Running SMT prover for 1 properties.
// Phase 1: matrix 418 rows 566 cols
[2022-05-19 11:31:18] [INFO ] Computed 268 place invariants in 1 ms
[2022-05-19 11:31:18] [INFO ] After 145ms 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 (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(F p1), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 p1))]
Property proved to be false thanks to negative knowledge :(F p1)
Knowledge based reduction with 13 factoid took 263 ms. Reduced automaton from 4 states, 10 edges and 2 AP to 1 states, 1 edges and 0 AP.
FORMULA ShieldIIPt-PT-030A-LTLFireability-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-030A-LTLFireability-07 finished in 8965 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0)||p1) U X((!(G(p2)||p3)||p2))))'
Support contains 7 out of 573 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 573/573 places, 422/422 transitions.
Applied a total of 0 rules in 6 ms. Remains 573 /573 variables (removed 0) and now considering 422/422 (removed 0) transitions.
// Phase 1: matrix 422 rows 573 cols
[2022-05-19 11:31:18] [INFO ] Computed 271 place invariants in 1 ms
[2022-05-19 11:31:18] [INFO ] Implicit Places using invariants in 285 ms returned []
// Phase 1: matrix 422 rows 573 cols
[2022-05-19 11:31:18] [INFO ] Computed 271 place invariants in 1 ms
[2022-05-19 11:31:19] [INFO ] Implicit Places using invariants and state equation in 491 ms returned []
Implicit Place search using SMT with State Equation took 798 ms to find 0 implicit places.
// Phase 1: matrix 422 rows 573 cols
[2022-05-19 11:31:19] [INFO ] Computed 271 place invariants in 1 ms
[2022-05-19 11:31:19] [INFO ] Dead Transitions using invariants and state equation in 275 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 573/573 places, 422/422 transitions.
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p2) p3), (AND (NOT p0) (NOT p2) p3), (AND (NOT p2) p3), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-030A-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) p3), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2) p3), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p3), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s556 1) (EQ s567 1)), p0:(AND (EQ s309 1) (EQ s320 1)), p2:(AND (EQ s293 1) (EQ s304 1)), p3:(EQ s571 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1792 ms.
Product exploration explored 100000 steps with 50000 reset in 1815 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (X (NOT (AND (NOT p0) (NOT p2) p3))), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) p3))), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) p3))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p2) p3)))
Knowledge based reduction with 8 factoid took 231 ms. Reduced automaton from 4 states, 6 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldIIPt-PT-030A-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-030A-LTLFireability-08 finished in 5167 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p1)&&p0))))'
Support contains 5 out of 573 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 573/573 places, 422/422 transitions.
Applied a total of 0 rules in 5 ms. Remains 573 /573 variables (removed 0) and now considering 422/422 (removed 0) transitions.
// Phase 1: matrix 422 rows 573 cols
[2022-05-19 11:31:23] [INFO ] Computed 271 place invariants in 1 ms
[2022-05-19 11:31:24] [INFO ] Implicit Places using invariants in 399 ms returned []
// Phase 1: matrix 422 rows 573 cols
[2022-05-19 11:31:24] [INFO ] Computed 271 place invariants in 1 ms
[2022-05-19 11:31:24] [INFO ] Implicit Places using invariants and state equation in 477 ms returned []
Implicit Place search using SMT with State Equation took 908 ms to find 0 implicit places.
// Phase 1: matrix 422 rows 573 cols
[2022-05-19 11:31:24] [INFO ] Computed 271 place invariants in 1 ms
[2022-05-19 11:31:24] [INFO ] Dead Transitions using invariants and state equation in 276 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 573/573 places, 422/422 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-030A-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s96 1) (EQ s65 1) (EQ s76 1)), p1:(OR (EQ s194 0) (EQ s207 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 557 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 0 ms.
FORMULA ShieldIIPt-PT-030A-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-030A-LTLFireability-10 finished in 1862 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)&&p0))))'
Support contains 4 out of 573 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 573/573 places, 422/422 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 573 transition count 421
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 572 transition count 421
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 4 place count 571 transition count 420
Applied a total of 4 rules in 63 ms. Remains 571 /573 variables (removed 2) and now considering 420/422 (removed 2) transitions.
// Phase 1: matrix 420 rows 571 cols
[2022-05-19 11:31:25] [INFO ] Computed 271 place invariants in 2 ms
[2022-05-19 11:31:26] [INFO ] Implicit Places using invariants in 447 ms returned [563, 564]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 464 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 569/573 places, 420/422 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 569 transition count 419
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 568 transition count 419
Applied a total of 2 rules in 12 ms. Remains 568 /569 variables (removed 1) and now considering 419/420 (removed 1) transitions.
// Phase 1: matrix 419 rows 568 cols
[2022-05-19 11:31:26] [INFO ] Computed 269 place invariants in 1 ms
[2022-05-19 11:31:26] [INFO ] Implicit Places using invariants in 411 ms returned [557]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 435 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 567/573 places, 419/422 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 566 transition count 418
Applied a total of 2 rules in 17 ms. Remains 566 /567 variables (removed 1) and now considering 418/419 (removed 1) transitions.
// Phase 1: matrix 418 rows 566 cols
[2022-05-19 11:31:26] [INFO ] Computed 268 place invariants in 1 ms
[2022-05-19 11:31:27] [INFO ] Implicit Places using invariants in 398 ms returned []
// Phase 1: matrix 418 rows 566 cols
[2022-05-19 11:31:27] [INFO ] Computed 268 place invariants in 1 ms
[2022-05-19 11:31:27] [INFO ] Implicit Places using invariants and state equation in 472 ms returned []
Implicit Place search using SMT with State Equation took 901 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 566/573 places, 418/422 transitions.
Finished structural reductions, in 3 iterations. Remains : 566/573 places, 418/422 transitions.
Stuttering acceptance computed with spot in 470 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-030A-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s41 1) (EQ s58 1)), p1:(AND (EQ s502 1) (EQ s513 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 526 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 0 ms.
FORMULA ShieldIIPt-PT-030A-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-030A-LTLFireability-11 finished in 2916 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(p0)||X(X((p1 U p2)))))))'
Support contains 8 out of 573 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 573/573 places, 422/422 transitions.
Applied a total of 0 rules in 7 ms. Remains 573 /573 variables (removed 0) and now considering 422/422 (removed 0) transitions.
// Phase 1: matrix 422 rows 573 cols
[2022-05-19 11:31:28] [INFO ] Computed 271 place invariants in 2 ms
[2022-05-19 11:31:28] [INFO ] Implicit Places using invariants in 313 ms returned []
// Phase 1: matrix 422 rows 573 cols
[2022-05-19 11:31:28] [INFO ] Computed 271 place invariants in 1 ms
[2022-05-19 11:31:29] [INFO ] Implicit Places using invariants and state equation in 466 ms returned []
Implicit Place search using SMT with State Equation took 819 ms to find 0 implicit places.
// Phase 1: matrix 422 rows 573 cols
[2022-05-19 11:31:29] [INFO ] Computed 271 place invariants in 2 ms
[2022-05-19 11:31:29] [INFO ] Dead Transitions using invariants and state equation in 260 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 573/573 places, 422/422 transitions.
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-030A-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s441 1) (EQ s454 1)), p2:(AND (EQ s539 1) (EQ s541 1)), p1:(OR (EQ s565 1) (AND (EQ s201 1) (EQ s205 1) (EQ s211 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 907 reset in 592 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 0 ms.
FORMULA ShieldIIPt-PT-030A-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-030A-LTLFireability-14 finished in 1772 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 573 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 573/573 places, 422/422 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 572 transition count 420
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 570 transition count 420
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 6 place count 568 transition count 419
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 6 place count 568 transition count 418
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 567 transition count 418
Applied a total of 8 rules in 34 ms. Remains 567 /573 variables (removed 6) and now considering 418/422 (removed 4) transitions.
// Phase 1: matrix 418 rows 567 cols
[2022-05-19 11:31:30] [INFO ] Computed 269 place invariants in 2 ms
[2022-05-19 11:31:30] [INFO ] Implicit Places using invariants in 415 ms returned [556]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 425 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 566/573 places, 418/422 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 565 transition count 417
Applied a total of 2 rules in 17 ms. Remains 565 /566 variables (removed 1) and now considering 417/418 (removed 1) transitions.
// Phase 1: matrix 417 rows 565 cols
[2022-05-19 11:31:30] [INFO ] Computed 268 place invariants in 1 ms
[2022-05-19 11:31:31] [INFO ] Implicit Places using invariants in 274 ms returned []
// Phase 1: matrix 417 rows 565 cols
[2022-05-19 11:31:31] [INFO ] Computed 268 place invariants in 1 ms
[2022-05-19 11:31:31] [INFO ] Implicit Places using invariants and state equation in 463 ms returned []
Implicit Place search using SMT with State Equation took 766 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 565/573 places, 417/422 transitions.
Finished structural reductions, in 2 iterations. Remains : 565/573 places, 417/422 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-030A-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s108 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 557 ms.
Stack based approach found an accepted trace after 2 steps with 0 reset with depth 3 and stack size 3 in 0 ms.
FORMULA ShieldIIPt-PT-030A-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-030A-LTLFireability-15 finished in 1846 ms.
All properties solved by simple procedures.
Total runtime 49057 ms.

BK_STOP 1652959892232

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPt-PT-030A"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ShieldIIPt-PT-030A, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r222-tall-165286025000292"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-030A.tgz
mv ShieldIIPt-PT-030A execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;