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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 796K
-rw-r--r-- 1 mcc users 7.4K Apr 29 19:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 29 19:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 29 18:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 29 18:59 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:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 9 08:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:51 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 539K 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-100A-LTLCardinality-00
FORMULA_NAME ShieldIIPt-PT-100A-LTLCardinality-01
FORMULA_NAME ShieldIIPt-PT-100A-LTLCardinality-02
FORMULA_NAME ShieldIIPt-PT-100A-LTLCardinality-03
FORMULA_NAME ShieldIIPt-PT-100A-LTLCardinality-04
FORMULA_NAME ShieldIIPt-PT-100A-LTLCardinality-05
FORMULA_NAME ShieldIIPt-PT-100A-LTLCardinality-06
FORMULA_NAME ShieldIIPt-PT-100A-LTLCardinality-07
FORMULA_NAME ShieldIIPt-PT-100A-LTLCardinality-08
FORMULA_NAME ShieldIIPt-PT-100A-LTLCardinality-09
FORMULA_NAME ShieldIIPt-PT-100A-LTLCardinality-10
FORMULA_NAME ShieldIIPt-PT-100A-LTLCardinality-11
FORMULA_NAME ShieldIIPt-PT-100A-LTLCardinality-12
FORMULA_NAME ShieldIIPt-PT-100A-LTLCardinality-13
FORMULA_NAME ShieldIIPt-PT-100A-LTLCardinality-14
FORMULA_NAME ShieldIIPt-PT-100A-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652967973529

Running Version 202205111006
[2022-05-19 13:46: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-19 13:46:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 13:46:15] [INFO ] Load time of PNML (sax parser for PT used): 178 ms
[2022-05-19 13:46:15] [INFO ] Transformed 1903 places.
[2022-05-19 13:46:15] [INFO ] Transformed 1403 transitions.
[2022-05-19 13:46:15] [INFO ] Found NUPN structural information;
[2022-05-19 13:46:15] [INFO ] Parsed PT model containing 1903 places and 1403 transitions in 322 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 5 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldIIPt-PT-100A-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-100A-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-100A-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-100A-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-100A-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-100A-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-100A-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-100A-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-100A-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-100A-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 224 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 13:46:15] [INFO ] Computed 901 place invariants in 40 ms
[2022-05-19 13:46:16] [INFO ] Implicit Places using invariants in 1302 ms returned []
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 13:46:16] [INFO ] Computed 901 place invariants in 8 ms
[2022-05-19 13:46:19] [INFO ] Implicit Places using invariants and state equation in 2709 ms returned []
Implicit Place search using SMT with State Equation took 4061 ms to find 0 implicit places.
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 13:46:19] [INFO ] Computed 901 place invariants in 10 ms
[2022-05-19 13:46:20] [INFO ] Dead Transitions using invariants and state equation in 1160 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1903/1903 places, 1402/1402 transitions.
Support contains 19 out of 1903 places after structural reductions.
[2022-05-19 13:46:21] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-05-19 13:46:21] [INFO ] Flatten gal took : 293 ms
FORMULA ShieldIIPt-PT-100A-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-19 13:46:21] [INFO ] Flatten gal took : 145 ms
[2022-05-19 13:46:21] [INFO ] Input system was already deterministic with 1402 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 573 ms. (steps per millisecond=17 ) properties (out of 12) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 13:46:23] [INFO ] Computed 901 place invariants in 14 ms
[2022-05-19 13:46:23] [INFO ] [Real]Absence check using 901 positive place invariants in 154 ms returned sat
[2022-05-19 13:46:25] [INFO ] After 2279ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-19 13:46:26] [INFO ] [Nat]Absence check using 901 positive place invariants in 154 ms returned sat
[2022-05-19 13:46:30] [INFO ] After 4271ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2022-05-19 13:46:33] [INFO ] After 6845ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 2376 ms.
[2022-05-19 13:46:35] [INFO ] After 10107ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 1637 ms.
Support contains 11 out of 1903 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1903/1903 places, 1402/1402 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 1903 transition count 1401
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1902 transition count 1401
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1901 transition count 1400
Partial Free-agglomeration rule applied 195 times.
Drop transitions removed 195 transitions
Iterating global reduction 0 with 195 rules applied. Total rules applied 199 place count 1901 transition count 1400
Applied a total of 199 rules in 567 ms. Remains 1901 /1903 variables (removed 2) and now considering 1400/1402 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 1901/1903 places, 1400/1402 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 449 ms. (steps per millisecond=22 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 7) seen :0
Finished probabilistic random walk after 89006 steps, run visited all 7 properties in 2941 ms. (steps per millisecond=30 )
Probabilistic random walk after 89006 steps, saw 87581 distinct states, run finished after 2945 ms. (steps per millisecond=30 ) properties seen :7
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' '!(G(F((p0||(p1&&G(p2))))))'
Support contains 5 out of 1903 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1903/1903 places, 1402/1402 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 1903 transition count 1401
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1902 transition count 1401
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1901 transition count 1400
Applied a total of 4 rules in 202 ms. Remains 1901 /1903 variables (removed 2) and now considering 1400/1402 (removed 2) transitions.
// Phase 1: matrix 1400 rows 1901 cols
[2022-05-19 13:46:42] [INFO ] Computed 901 place invariants in 5 ms
[2022-05-19 13:46:43] [INFO ] Implicit Places using invariants in 1333 ms returned [1893, 1894]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1339 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1899/1903 places, 1400/1402 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 1899 transition count 1399
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1898 transition count 1399
Applied a total of 2 rules in 97 ms. Remains 1898 /1899 variables (removed 1) and now considering 1399/1400 (removed 1) transitions.
// Phase 1: matrix 1399 rows 1898 cols
[2022-05-19 13:46:44] [INFO ] Computed 899 place invariants in 12 ms
[2022-05-19 13:46:45] [INFO ] Implicit Places using invariants in 1240 ms returned [1887]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1243 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1897/1903 places, 1399/1402 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 1896 transition count 1398
Applied a total of 2 rules in 117 ms. Remains 1896 /1897 variables (removed 1) and now considering 1398/1399 (removed 1) transitions.
// Phase 1: matrix 1398 rows 1896 cols
[2022-05-19 13:46:45] [INFO ] Computed 898 place invariants in 6 ms
[2022-05-19 13:46:46] [INFO ] Implicit Places using invariants in 1281 ms returned []
// Phase 1: matrix 1398 rows 1896 cols
[2022-05-19 13:46:46] [INFO ] Computed 898 place invariants in 6 ms
[2022-05-19 13:46:49] [INFO ] Implicit Places using invariants and state equation in 2578 ms returned []
Implicit Place search using SMT with State Equation took 3862 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1896/1903 places, 1398/1402 transitions.
Finished structural reductions, in 3 iterations. Remains : 1896/1903 places, 1398/1402 transitions.
Stuttering acceptance computed with spot in 337 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-100A-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(NEQ s749 1), p0:(AND (NEQ s1278 0) (NEQ s47 1)), p2:(AND (NEQ s1157 0) (NEQ s677 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 2 reset in 1572 ms.
Product exploration explored 100000 steps with 0 reset in 1882 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) (NOT p2)), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))))), (X (NOT (AND p1 (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 263 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 3 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 127 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 238 ms. (steps per millisecond=42 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1398 rows 1896 cols
[2022-05-19 13:46:54] [INFO ] Computed 898 place invariants in 8 ms
[2022-05-19 13:46:54] [INFO ] [Real]Absence check using 898 positive place invariants in 174 ms returned sat
[2022-05-19 13:46:55] [INFO ] After 1545ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 13:46:56] [INFO ] [Nat]Absence check using 898 positive place invariants in 142 ms returned sat
[2022-05-19 13:46:58] [INFO ] After 2642ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 13:46:58] [INFO ] After 2909ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 182 ms.
[2022-05-19 13:46:59] [INFO ] After 3594ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 435 ms.
Support contains 5 out of 1896 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1896/1896 places, 1398/1398 transitions.
Partial Free-agglomeration rule applied 196 times.
Drop transitions removed 196 transitions
Iterating global reduction 0 with 196 rules applied. Total rules applied 196 place count 1896 transition count 1398
Applied a total of 196 rules in 120 ms. Remains 1896 /1896 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1896/1896 places, 1398/1398 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 268 ms. (steps per millisecond=37 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 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 120 ms. (steps per millisecond=83 ) properties (out of 2) seen :0
Finished probabilistic random walk after 49482 steps, run visited all 2 properties in 1349 ms. (steps per millisecond=36 )
Probabilistic random walk after 49482 steps, saw 48326 distinct states, run finished after 1351 ms. (steps per millisecond=36 ) properties seen :2
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))))), (X (NOT (AND p1 (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) p2))))]
False Knowledge obtained : [(F (AND (NOT p0) p2)), (F (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND (NOT p0) p1 p2))]
Knowledge based reduction with 7 factoid took 361 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 3 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 116 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 90 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
// Phase 1: matrix 1398 rows 1896 cols
[2022-05-19 13:47:02] [INFO ] Computed 898 place invariants in 4 ms
[2022-05-19 13:47:04] [INFO ] [Real]Absence check using 898 positive place invariants in 1445 ms returned sat
[2022-05-19 13:47:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 13:47:05] [INFO ] [Real]Absence check using state equation in 648 ms returned sat
[2022-05-19 13:47:05] [INFO ] Computed and/alt/rep : 1397/4987/1397 causal constraints (skipped 0 transitions) in 89 ms.
[2022-05-19 13:47:05] [INFO ] Added : 0 causal constraints over 0 iterations in 223 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 5 out of 1896 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1896/1896 places, 1398/1398 transitions.
Applied a total of 0 rules in 62 ms. Remains 1896 /1896 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
// Phase 1: matrix 1398 rows 1896 cols
[2022-05-19 13:47:05] [INFO ] Computed 898 place invariants in 4 ms
[2022-05-19 13:47:07] [INFO ] Implicit Places using invariants in 1189 ms returned []
// Phase 1: matrix 1398 rows 1896 cols
[2022-05-19 13:47:07] [INFO ] Computed 898 place invariants in 4 ms
[2022-05-19 13:47:09] [INFO ] Implicit Places using invariants and state equation in 2630 ms returned []
Implicit Place search using SMT with State Equation took 3822 ms to find 0 implicit places.
[2022-05-19 13:47:09] [INFO ] Redundant transitions in 103 ms returned []
// Phase 1: matrix 1398 rows 1896 cols
[2022-05-19 13:47:09] [INFO ] Computed 898 place invariants in 5 ms
[2022-05-19 13:47:10] [INFO ] Dead Transitions using invariants and state equation in 1005 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1896/1896 places, 1398/1398 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) p1 (NOT p2)), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 292 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 3 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 129 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 247 ms. (steps per millisecond=40 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1398 rows 1896 cols
[2022-05-19 13:47:11] [INFO ] Computed 898 place invariants in 5 ms
[2022-05-19 13:47:12] [INFO ] [Real]Absence check using 898 positive place invariants in 143 ms returned sat
[2022-05-19 13:47:13] [INFO ] After 1389ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 13:47:13] [INFO ] [Nat]Absence check using 898 positive place invariants in 152 ms returned sat
[2022-05-19 13:47:16] [INFO ] After 2651ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 13:47:16] [INFO ] After 2935ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 177 ms.
[2022-05-19 13:47:16] [INFO ] After 3665ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 405 ms.
Support contains 5 out of 1896 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1896/1896 places, 1398/1398 transitions.
Partial Free-agglomeration rule applied 196 times.
Drop transitions removed 196 transitions
Iterating global reduction 0 with 196 rules applied. Total rules applied 196 place count 1896 transition count 1398
Applied a total of 196 rules in 112 ms. Remains 1896 /1896 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1896/1896 places, 1398/1398 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 241 ms. (steps per millisecond=41 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 2) seen :0
Finished probabilistic random walk after 49482 steps, run visited all 2 properties in 1183 ms. (steps per millisecond=41 )
Probabilistic random walk after 49482 steps, saw 48326 distinct states, run finished after 1184 ms. (steps per millisecond=41 ) properties seen :2
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p0) p2)), (F (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p1 (NOT p0) p2))]
Knowledge based reduction with 7 factoid took 339 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 3 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 124 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 119 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
// Phase 1: matrix 1398 rows 1896 cols
[2022-05-19 13:47:19] [INFO ] Computed 898 place invariants in 7 ms
[2022-05-19 13:47:22] [INFO ] [Real]Absence check using 898 positive place invariants in 1347 ms returned sat
[2022-05-19 13:47:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 13:47:22] [INFO ] [Real]Absence check using state equation in 673 ms returned sat
[2022-05-19 13:47:22] [INFO ] Computed and/alt/rep : 1397/4987/1397 causal constraints (skipped 0 transitions) in 86 ms.
[2022-05-19 13:47:23] [INFO ] Added : 0 causal constraints over 0 iterations in 206 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 121 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 1494 ms.
Product exploration explored 100000 steps with 0 reset in 1977 ms.
Built C files in :
/tmp/ltsmin9602185622785266197
[2022-05-19 13:47:26] [INFO ] Computing symmetric may disable matrix : 1398 transitions.
[2022-05-19 13:47:26] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 13:47:26] [INFO ] Computing symmetric may enable matrix : 1398 transitions.
[2022-05-19 13:47:26] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 13:47:27] [INFO ] Computing Do-Not-Accords matrix : 1398 transitions.
[2022-05-19 13:47:27] [INFO ] Computation of Completed DNA matrix. took 52 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 13:47:27] [INFO ] Built C files in 392ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9602185622785266197
Running compilation step : cd /tmp/ltsmin9602185622785266197;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9602185622785266197;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9602185622785266197;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 5 out of 1896 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1896/1896 places, 1398/1398 transitions.
Applied a total of 0 rules in 58 ms. Remains 1896 /1896 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
// Phase 1: matrix 1398 rows 1896 cols
[2022-05-19 13:47:30] [INFO ] Computed 898 place invariants in 3 ms
[2022-05-19 13:47:31] [INFO ] Implicit Places using invariants in 1552 ms returned []
// Phase 1: matrix 1398 rows 1896 cols
[2022-05-19 13:47:31] [INFO ] Computed 898 place invariants in 5 ms
[2022-05-19 13:47:34] [INFO ] Implicit Places using invariants and state equation in 2522 ms returned []
Implicit Place search using SMT with State Equation took 4077 ms to find 0 implicit places.
[2022-05-19 13:47:34] [INFO ] Redundant transitions in 27 ms returned []
// Phase 1: matrix 1398 rows 1896 cols
[2022-05-19 13:47:34] [INFO ] Computed 898 place invariants in 5 ms
[2022-05-19 13:47:35] [INFO ] Dead Transitions using invariants and state equation in 931 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1896/1896 places, 1398/1398 transitions.
Built C files in :
/tmp/ltsmin13793013759980313896
[2022-05-19 13:47:35] [INFO ] Computing symmetric may disable matrix : 1398 transitions.
[2022-05-19 13:47:35] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 13:47:35] [INFO ] Computing symmetric may enable matrix : 1398 transitions.
[2022-05-19 13:47:35] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 13:47:35] [INFO ] Computing Do-Not-Accords matrix : 1398 transitions.
[2022-05-19 13:47:35] [INFO ] Computation of Completed DNA matrix. took 28 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 13:47:35] [INFO ] Built C files in 235ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13793013759980313896
Running compilation step : cd /tmp/ltsmin13793013759980313896;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13793013759980313896;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13793013759980313896;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-19 13:47:39] [INFO ] Flatten gal took : 252 ms
[2022-05-19 13:47:39] [INFO ] Flatten gal took : 159 ms
[2022-05-19 13:47:39] [INFO ] Time to serialize gal into /tmp/LTL6565423552154597880.gal : 19 ms
[2022-05-19 13:47:39] [INFO ] Time to serialize properties into /tmp/LTL6406982776269828140.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/LTL6565423552154597880.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6406982776269828140.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/LTL6565423...266
Read 1 LTL properties
Checking formula 0 : !((G(F(("((p1278==1)&&(p47==0))")||(("(p749==0)")&&(G("((p1157==1)&&(p677==0))")))))))
Formula 0 simplified : !GF("((p1278==1)&&(p47==0))" | ("(p749==0)" & G"((p1157==1)&&(p677==0))"))
Detected timeout of ITS tools.
[2022-05-19 13:47:54] [INFO ] Flatten gal took : 114 ms
[2022-05-19 13:47:54] [INFO ] Applying decomposition
[2022-05-19 13:47:54] [INFO ] Flatten gal took : 114 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/graph6960315489631582012.txt' '-o' '/tmp/graph6960315489631582012.bin' '-w' '/tmp/graph6960315489631582012.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6960315489631582012.bin' '-l' '-1' '-v' '-w' '/tmp/graph6960315489631582012.weights' '-q' '0' '-e' '0.001'
[2022-05-19 13:47:54] [INFO ] Decomposing Gal with order
[2022-05-19 13:47:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 13:47:55] [INFO ] Removed a total of 299 redundant transitions.
[2022-05-19 13:47:55] [INFO ] Flatten gal took : 158 ms
[2022-05-19 13:47:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 147 ms.
[2022-05-19 13:47:55] [INFO ] Time to serialize gal into /tmp/LTL15740587357647247248.gal : 28 ms
[2022-05-19 13:47:55] [INFO ] Time to serialize properties into /tmp/LTL510238650915977241.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/LTL15740587357647247248.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL510238650915977241.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/LTL1574058...245
Read 1 LTL properties
Checking formula 0 : !((G(F(("((i29.i1.i1.u538.p1278==1)&&(i1.i0.i1.u18.p47==0))")||(("(i16.i0.i1.u314.p749==0)")&&(G("((i26.i0.i3.u486.p1157==1)&&(i14.i2....180
Formula 0 simplified : !GF("((i29.i1.i1.u538.p1278==1)&&(i1.i0.i1.u18.p47==0))" | ("(i16.i0.i1.u314.p749==0)" & G"((i26.i0.i3.u486.p1157==1)&&(i14.i2.i0.u2...170
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
323 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.51502,96784,1,0,155974,927,6211,378797,124,7841,201641
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-100A-LTLCardinality-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ShieldIIPt-PT-100A-LTLCardinality-01 finished in 77163 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((G(X(p0))||F((G(F(p0)) U F(p1)))))))'
Support contains 3 out of 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 50 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 13:47:59] [INFO ] Computed 901 place invariants in 7 ms
[2022-05-19 13:48:00] [INFO ] Implicit Places using invariants in 1200 ms returned []
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 13:48:00] [INFO ] Computed 901 place invariants in 9 ms
[2022-05-19 13:48:03] [INFO ] Implicit Places using invariants and state equation in 2615 ms returned []
Implicit Place search using SMT with State Equation took 3829 ms to find 0 implicit places.
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 13:48:03] [INFO ] Computed 901 place invariants in 12 ms
[2022-05-19 13:48:04] [INFO ] Dead Transitions using invariants and state equation in 1057 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1903/1903 places, 1402/1402 transitions.
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-100A-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p0:(OR (EQ s1434 0) (EQ s123 1)), p1:(EQ s138 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 7060 ms.
Product exploration explored 100000 steps with 50000 reset in 7357 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 180 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 13:48:19] [INFO ] Computed 901 place invariants in 8 ms
[2022-05-19 13:48:20] [INFO ] [Real]Absence check using 901 positive place invariants in 159 ms returned sat
[2022-05-19 13:48:20] [INFO ] After 1240ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 13:48:21] [INFO ] [Nat]Absence check using 901 positive place invariants in 158 ms returned sat
[2022-05-19 13:48:22] [INFO ] After 744ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 13:48:22] [INFO ] After 862ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 75 ms.
[2022-05-19 13:48:22] [INFO ] After 1427ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 35 ms.
Support contains 3 out of 1903 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1903/1903 places, 1402/1402 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 1903 transition count 1401
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1902 transition count 1401
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1901 transition count 1400
Partial Free-agglomeration rule applied 197 times.
Drop transitions removed 197 transitions
Iterating global reduction 0 with 197 rules applied. Total rules applied 201 place count 1901 transition count 1400
Applied a total of 201 rules in 208 ms. Remains 1901 /1903 variables (removed 2) and now considering 1400/1402 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 1901/1903 places, 1400/1402 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 1) seen :0
Finished probabilistic random walk after 92205 steps, run visited all 1 properties in 1930 ms. (steps per millisecond=47 )
Probabilistic random walk after 92205 steps, saw 90762 distinct states, run finished after 1935 ms. (steps per millisecond=47 ) properties seen :1
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 238 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 50 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 13:48:25] [INFO ] Computed 901 place invariants in 6 ms
[2022-05-19 13:48:26] [INFO ] Implicit Places using invariants in 1245 ms returned []
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 13:48:26] [INFO ] Computed 901 place invariants in 7 ms
[2022-05-19 13:48:28] [INFO ] Implicit Places using invariants and state equation in 2501 ms returned []
Implicit Place search using SMT with State Equation took 3751 ms to find 0 implicit places.
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 13:48:28] [INFO ] Computed 901 place invariants in 6 ms
[2022-05-19 13:48:30] [INFO ] Dead Transitions using invariants and state equation in 1149 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1903/1903 places, 1402/1402 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 (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 148 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 13:48:30] [INFO ] Computed 901 place invariants in 7 ms
[2022-05-19 13:48:31] [INFO ] [Real]Absence check using 901 positive place invariants in 163 ms returned sat
[2022-05-19 13:48:31] [INFO ] After 1204ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 13:48:32] [INFO ] [Nat]Absence check using 901 positive place invariants in 156 ms returned sat
[2022-05-19 13:48:33] [INFO ] After 724ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 13:48:33] [INFO ] After 842ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 70 ms.
[2022-05-19 13:48:33] [INFO ] After 1395ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 33 ms.
Support contains 3 out of 1903 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1903/1903 places, 1402/1402 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 1903 transition count 1401
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1902 transition count 1401
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 4 place count 1901 transition count 1400
Partial Free-agglomeration rule applied 197 times.
Drop transitions removed 197 transitions
Iterating global reduction 0 with 197 rules applied. Total rules applied 201 place count 1901 transition count 1400
Applied a total of 201 rules in 188 ms. Remains 1901 /1903 variables (removed 2) and now considering 1400/1402 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 1901/1903 places, 1400/1402 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 1) seen :0
Finished probabilistic random walk after 92205 steps, run visited all 1 properties in 1804 ms. (steps per millisecond=51 )
Probabilistic random walk after 92205 steps, saw 90762 distinct states, run finished after 1807 ms. (steps per millisecond=51 ) properties seen :1
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 203 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 50000 reset in 7313 ms.
Product exploration explored 100000 steps with 50000 reset in 7370 ms.
Applying partial POR strategy [true, false]
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 1903 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1903/1903 places, 1402/1402 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 1903 transition count 1402
Deduced a syphon composed of 1 places in 3 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1903 transition count 1402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 3 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1903 transition count 1402
Deduced a syphon composed of 2 places in 2 ms
Applied a total of 2 rules in 346 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
[2022-05-19 13:48:51] [INFO ] Redundant transitions in 31 ms returned []
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 13:48:51] [INFO ] Computed 901 place invariants in 3 ms
[2022-05-19 13:48:52] [INFO ] Dead Transitions using invariants and state equation in 1164 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1903/1903 places, 1402/1402 transitions.
Finished structural reductions, in 1 iterations. Remains : 1903/1903 places, 1402/1402 transitions.
Product exploration timeout after 63480 steps with 31740 reset in 10002 ms.
Product exploration timeout after 64310 steps with 32155 reset in 10002 ms.
Built C files in :
/tmp/ltsmin17107398099516508314
[2022-05-19 13:49:12] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17107398099516508314
Running compilation step : cd /tmp/ltsmin17107398099516508314;'/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 2913 ms.
Running link step : cd /tmp/ltsmin17107398099516508314;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin17107398099516508314;'/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/stateBased17644919153367618322.hoa' '--buchi-type=spotba'
LTSmin run took 326 ms.
FORMULA ShieldIIPt-PT-100A-LTLCardinality-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldIIPt-PT-100A-LTLCardinality-03 finished in 76237 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X((p0 U !p0))&&F(X(p1)))))'
Support contains 2 out of 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 53 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 13:49:15] [INFO ] Computed 901 place invariants in 8 ms
[2022-05-19 13:49:17] [INFO ] Implicit Places using invariants in 1192 ms returned []
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 13:49:17] [INFO ] Computed 901 place invariants in 8 ms
[2022-05-19 13:49:19] [INFO ] Implicit Places using invariants and state equation in 2686 ms returned []
Implicit Place search using SMT with State Equation took 3883 ms to find 0 implicit places.
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 13:49:19] [INFO ] Computed 901 place invariants in 3 ms
[2022-05-19 13:49:20] [INFO ] Dead Transitions using invariants and state equation in 1073 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1903/1903 places, 1402/1402 transitions.
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p1) p0), (NOT p1), p0, (OR (NOT p1) p0)]
Running random walk in product with property : ShieldIIPt-PT-100A-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s824 0) (EQ s975 1)), p0:(OR (EQ s975 0) (EQ s824 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1539 ms.
Stack based approach found an accepted trace after 10 steps with 0 reset with depth 11 and stack size 11 in 1 ms.
FORMULA ShieldIIPt-PT-100A-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-100A-LTLCardinality-10 finished in 6739 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((!(F((F(!p0) U p1)) U p0)&&X(p1))))'
Support contains 4 out of 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 53 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 13:49:22] [INFO ] Computed 901 place invariants in 8 ms
[2022-05-19 13:49:23] [INFO ] Implicit Places using invariants in 1310 ms returned []
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 13:49:23] [INFO ] Computed 901 place invariants in 9 ms
[2022-05-19 13:49:26] [INFO ] Implicit Places using invariants and state equation in 2642 ms returned []
Implicit Place search using SMT with State Equation took 3956 ms to find 0 implicit places.
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 13:49:26] [INFO ] Computed 901 place invariants in 3 ms
[2022-05-19 13:49:27] [INFO ] Dead Transitions using invariants and state equation in 1061 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1903/1903 places, 1402/1402 transitions.
Stuttering acceptance computed with spot in 251 ms :[true, (OR (NOT p1) p0), (AND p0 p1), p1, (OR (NOT p1) p0), p0, (OR (NOT p1) p0)]
Running random walk in product with property : ShieldIIPt-PT-100A-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=p1, acceptance={} source=3 dest: 0}, { cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 0}, { cond=(NOT p0), acceptance={} source=4 dest: 6}], [{ cond=p0, acceptance={} source=5 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 5}], [{ cond=(OR (NOT p1) p0), acceptance={} source=6 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=6 dest: 5}]], initial=1, aps=[p1:(OR (EQ s1876 0) (EQ s1293 1)), p0:(OR (EQ s189 0) (EQ s208 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-100A-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-100A-LTLCardinality-13 finished in 5352 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U ((p1 U (p2 U p0))&&!X(X((F(p0)&&p2))))))'
Support contains 5 out of 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 47 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 13:49:27] [INFO ] Computed 901 place invariants in 7 ms
[2022-05-19 13:49:29] [INFO ] Implicit Places using invariants in 1287 ms returned []
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 13:49:29] [INFO ] Computed 901 place invariants in 3 ms
[2022-05-19 13:49:31] [INFO ] Implicit Places using invariants and state equation in 2487 ms returned []
Implicit Place search using SMT with State Equation took 3777 ms to find 0 implicit places.
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 13:49:31] [INFO ] Computed 901 place invariants in 3 ms
[2022-05-19 13:49:32] [INFO ] Dead Transitions using invariants and state equation in 1142 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1903/1903 places, 1402/1402 transitions.
Stuttering acceptance computed with spot in 553 ms :[(OR (NOT p0) p2), true, (AND p0 p2), (NOT p0), (NOT p0), (AND p0 p2), (AND p0 p2), p0, (AND p2 p0), false, false, (AND p0 p2), false, false]
Running random walk in product with property : ShieldIIPt-PT-100A-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 4}, { cond=p0, acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=5 dest: 6}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=5 dest: 8}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 9}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=5 dest: 10}, { cond=p0, acceptance={} source=5 dest: 11}], [{ cond=(AND p0 p2), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=6 dest: 7}], [{ cond=p0, acceptance={} source=7 dest: 1}, { cond=(NOT p0), acceptance={} source=7 dest: 7}], [{ cond=p2, acceptance={} source=8 dest: 6}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=9 dest: 12}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=9 dest: 13}], [{ cond=(AND (NOT p0) p2), acceptance={} source=10 dest: 12}], [{ cond=(AND (NOT p0) p2), acceptance={} source=11 dest: 8}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=11 dest: 9}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=11 dest: 10}, { cond=(AND p0 p2), acceptance={0} source=11 dest: 11}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=12 dest: 7}, { cond=(AND (NOT p0) p2), acceptance={} source=12 dest: 12}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=13 dest: 7}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=13 dest: 12}, { cond=(AND (NOT p0) p1), acceptance={} source=13 dest: 13}]], initial=0, aps=[p0:(EQ s1801 1), p2:(OR (EQ s1216 0) (EQ s1214 1)), p1:(OR (EQ s1459 0) (EQ s1614 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 8 steps with 3 reset in 2 ms.
FORMULA ShieldIIPt-PT-100A-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-100A-LTLCardinality-15 finished in 5553 ms.
All properties solved by simple procedures.
Total runtime 198704 ms.

BK_STOP 1652968173509

--------------------
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="ShieldIIPt-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 ShieldIIPt-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-165286025100339"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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