Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r389-oct2-167903713400307.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is ShieldIIPt-PT-040A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r389-oct2-167903713400307
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 5.9K Feb 25 17:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 25 17:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 17:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 17:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Feb 25 17:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K Feb 25 17:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Feb 25 17:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Feb 25 17:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:57 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 212K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldIIPt-PT-040A-LTLCardinality-00
FORMULA_NAME ShieldIIPt-PT-040A-LTLCardinality-01
FORMULA_NAME ShieldIIPt-PT-040A-LTLCardinality-02
FORMULA_NAME ShieldIIPt-PT-040A-LTLCardinality-03
FORMULA_NAME ShieldIIPt-PT-040A-LTLCardinality-04
FORMULA_NAME ShieldIIPt-PT-040A-LTLCardinality-05
FORMULA_NAME ShieldIIPt-PT-040A-LTLCardinality-06
FORMULA_NAME ShieldIIPt-PT-040A-LTLCardinality-07
FORMULA_NAME ShieldIIPt-PT-040A-LTLCardinality-08
FORMULA_NAME ShieldIIPt-PT-040A-LTLCardinality-09
FORMULA_NAME ShieldIIPt-PT-040A-LTLCardinality-10
FORMULA_NAME ShieldIIPt-PT-040A-LTLCardinality-11
FORMULA_NAME ShieldIIPt-PT-040A-LTLCardinality-12
FORMULA_NAME ShieldIIPt-PT-040A-LTLCardinality-13
FORMULA_NAME ShieldIIPt-PT-040A-LTLCardinality-14
FORMULA_NAME ShieldIIPt-PT-040A-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679187886858

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-040A
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-19 01:04:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-19 01:04:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 01:04:49] [INFO ] Load time of PNML (sax parser for PT used): 99 ms
[2023-03-19 01:04:49] [INFO ] Transformed 763 places.
[2023-03-19 01:04:49] [INFO ] Transformed 563 transitions.
[2023-03-19 01:04:49] [INFO ] Found NUPN structural information;
[2023-03-19 01:04:49] [INFO ] Parsed PT model containing 763 places and 563 transitions and 2406 arcs in 174 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 7 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.
Initial state reduction rules removed 2 formulas.
FORMULA ShieldIIPt-PT-040A-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040A-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040A-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040A-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040A-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040A-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040A-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040A-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040A-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040A-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 77 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
// Phase 1: matrix 562 rows 763 cols
[2023-03-19 01:04:49] [INFO ] Computed 361 place invariants in 21 ms
[2023-03-19 01:04:50] [INFO ] Implicit Places using invariants in 747 ms returned []
[2023-03-19 01:04:50] [INFO ] Invariant cache hit.
[2023-03-19 01:04:51] [INFO ] Implicit Places using invariants and state equation in 1014 ms returned []
Implicit Place search using SMT with State Equation took 1815 ms to find 0 implicit places.
[2023-03-19 01:04:51] [INFO ] Invariant cache hit.
[2023-03-19 01:04:52] [INFO ] Dead Transitions using invariants and state equation in 661 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2569 ms. Remains : 763/763 places, 562/562 transitions.
Support contains 24 out of 763 places after structural reductions.
[2023-03-19 01:04:52] [INFO ] Flatten gal took : 123 ms
[2023-03-19 01:04:52] [INFO ] Flatten gal took : 70 ms
[2023-03-19 01:04:52] [INFO ] Input system was already deterministic with 562 transitions.
Support contains 22 out of 763 places (down from 24) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 564 ms. (steps per millisecond=17 ) properties (out of 14) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 9) 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 9) 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 9) seen :0
Running SMT prover for 9 properties.
[2023-03-19 01:04:54] [INFO ] Invariant cache hit.
[2023-03-19 01:04:54] [INFO ] [Real]Absence check using 361 positive place invariants in 104 ms returned sat
[2023-03-19 01:04:55] [INFO ] After 1091ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-19 01:04:55] [INFO ] [Nat]Absence check using 361 positive place invariants in 73 ms returned sat
[2023-03-19 01:04:56] [INFO ] After 804ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-19 01:04:57] [INFO ] After 1685ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 525 ms.
[2023-03-19 01:04:58] [INFO ] After 2790ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 225 ms.
Support contains 15 out of 763 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 763/763 places, 562/562 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 763 transition count 561
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 762 transition count 561
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 761 transition count 560
Partial Free-agglomeration rule applied 75 times.
Drop transitions removed 75 transitions
Iterating global reduction 0 with 75 rules applied. Total rules applied 79 place count 761 transition count 560
Applied a total of 79 rules in 128 ms. Remains 761 /763 variables (removed 2) and now considering 560/562 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 761/763 places, 560/562 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 261 ms. (steps per millisecond=38 ) properties (out of 9) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 560 rows 761 cols
[2023-03-19 01:04:59] [INFO ] Computed 361 place invariants in 5 ms
[2023-03-19 01:04:59] [INFO ] [Real]Absence check using 361 positive place invariants in 66 ms returned sat
[2023-03-19 01:04:59] [INFO ] After 469ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:5
[2023-03-19 01:04:59] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-19 01:04:59] [INFO ] After 47ms SMT Verify possible using 43 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-19 01:04:59] [INFO ] After 919ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-19 01:05:00] [INFO ] [Nat]Absence check using 361 positive place invariants in 137 ms returned sat
[2023-03-19 01:05:01] [INFO ] After 600ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-19 01:05:01] [INFO ] After 346ms SMT Verify possible using 43 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-19 01:05:01] [INFO ] After 859ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 337 ms.
[2023-03-19 01:05:02] [INFO ] After 2320ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 269 ms.
Support contains 10 out of 761 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 761/761 places, 560/560 transitions.
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 761 transition count 560
Applied a total of 2 rules in 90 ms. Remains 761 /761 variables (removed 0) and now considering 560/560 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 761/761 places, 560/560 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) 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 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 162209 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :{0=1, 2=1, 3=1, 4=1}
Probabilistic random walk after 162209 steps, saw 156348 distinct states, run finished after 3002 ms. (steps per millisecond=54 ) properties seen :4
Running SMT prover for 2 properties.
// Phase 1: matrix 560 rows 761 cols
[2023-03-19 01:05:06] [INFO ] Computed 361 place invariants in 9 ms
[2023-03-19 01:05:06] [INFO ] [Real]Absence check using 361 positive place invariants in 61 ms returned sat
[2023-03-19 01:05:06] [INFO ] After 321ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-19 01:05:06] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-19 01:05:06] [INFO ] After 62ms SMT Verify possible using 43 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 01:05:06] [INFO ] After 596ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 01:05:07] [INFO ] [Nat]Absence check using 361 positive place invariants in 57 ms returned sat
[2023-03-19 01:05:07] [INFO ] After 339ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 01:05:07] [INFO ] After 136ms SMT Verify possible using 43 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-19 01:05:07] [INFO ] After 288ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 125 ms.
[2023-03-19 01:05:07] [INFO ] After 1035ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 63 ms.
Support contains 4 out of 761 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 761/761 places, 560/560 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 761 transition count 560
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 760 transition count 559
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 758 transition count 559
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 758 transition count 558
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 757 transition count 558
Applied a total of 6 rules in 116 ms. Remains 757 /761 variables (removed 4) and now considering 558/560 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116 ms. Remains : 757/761 places, 558/560 transitions.
Finished random walk after 5403 steps, including 1 resets, run visited all 2 properties in 83 ms. (steps per millisecond=65 )
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 4 out of 763 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 763/763 places, 562/562 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 763 transition count 561
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 762 transition count 561
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 761 transition count 560
Applied a total of 4 rules in 103 ms. Remains 761 /763 variables (removed 2) and now considering 560/562 (removed 2) transitions.
// Phase 1: matrix 560 rows 761 cols
[2023-03-19 01:05:08] [INFO ] Computed 361 place invariants in 7 ms
[2023-03-19 01:05:09] [INFO ] Implicit Places using invariants in 520 ms returned [753, 754]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 522 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 759/763 places, 560/562 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 759 transition count 559
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 758 transition count 559
Applied a total of 2 rules in 28 ms. Remains 758 /759 variables (removed 1) and now considering 559/560 (removed 1) transitions.
// Phase 1: matrix 559 rows 758 cols
[2023-03-19 01:05:09] [INFO ] Computed 359 place invariants in 48 ms
[2023-03-19 01:05:09] [INFO ] Implicit Places using invariants in 546 ms returned [747]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 550 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 757/763 places, 559/562 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 756 transition count 558
Applied a total of 2 rules in 43 ms. Remains 756 /757 variables (removed 1) and now considering 558/559 (removed 1) transitions.
// Phase 1: matrix 558 rows 756 cols
[2023-03-19 01:05:09] [INFO ] Computed 358 place invariants in 3 ms
[2023-03-19 01:05:10] [INFO ] Implicit Places using invariants in 421 ms returned []
[2023-03-19 01:05:10] [INFO ] Invariant cache hit.
[2023-03-19 01:05:11] [INFO ] Implicit Places using invariants and state equation in 1092 ms returned []
Implicit Place search using SMT with State Equation took 1534 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 756/763 places, 558/562 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 2782 ms. Remains : 756/763 places, 558/562 transitions.
Stuttering acceptance computed with spot in 352 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-040A-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s177 0) (EQ s729 1)), p0:(OR (EQ s7 0) (EQ s186 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 806 ms.
Product exploration explored 100000 steps with 0 reset in 946 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 334 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 313167 steps, run timeout after 3001 ms. (steps per millisecond=104 ) properties seen :{1=1}
Probabilistic random walk after 313167 steps, saw 309318 distinct states, run finished after 3002 ms. (steps per millisecond=104 ) properties seen :1
Running SMT prover for 1 properties.
[2023-03-19 01:05:17] [INFO ] Invariant cache hit.
[2023-03-19 01:05:17] [INFO ] [Real]Absence check using 358 positive place invariants in 51 ms returned sat
[2023-03-19 01:05:17] [INFO ] After 336ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-19 01:05:17] [INFO ] After 403ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 01:05:17] [INFO ] After 683ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 01:05:18] [INFO ] [Nat]Absence check using 358 positive place invariants in 54 ms returned sat
[2023-03-19 01:05:18] [INFO ] After 266ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 01:05:18] [INFO ] After 367ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-19 01:05:18] [INFO ] After 682ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 756 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 756/756 places, 558/558 transitions.
Partial Free-agglomeration rule applied 77 times.
Drop transitions removed 77 transitions
Iterating global reduction 0 with 77 rules applied. Total rules applied 77 place count 756 transition count 558
Applied a total of 77 rules in 70 ms. Remains 756 /756 variables (removed 0) and now considering 558/558 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 756/756 places, 558/558 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 343313 steps, run timeout after 3021 ms. (steps per millisecond=113 ) properties seen :{}
Probabilistic random walk after 343313 steps, saw 323315 distinct states, run finished after 3022 ms. (steps per millisecond=113 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 558 rows 756 cols
[2023-03-19 01:05:21] [INFO ] Computed 358 place invariants in 2 ms
[2023-03-19 01:05:22] [INFO ] [Real]Absence check using 358 positive place invariants in 47 ms returned sat
[2023-03-19 01:05:22] [INFO ] After 443ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 01:05:22] [INFO ] [Nat]Absence check using 358 positive place invariants in 52 ms returned sat
[2023-03-19 01:05:23] [INFO ] After 615ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 01:05:23] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-19 01:05:23] [INFO ] After 115ms SMT Verify possible using 40 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 01:05:23] [INFO ] After 238ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 79 ms.
[2023-03-19 01:05:23] [INFO ] After 1215ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 232 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=58 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 485 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 756 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 756/756 places, 558/558 transitions.
Applied a total of 0 rules in 35 ms. Remains 756 /756 variables (removed 0) and now considering 558/558 (removed 0) transitions.
// Phase 1: matrix 558 rows 756 cols
[2023-03-19 01:05:24] [INFO ] Computed 358 place invariants in 6 ms
[2023-03-19 01:05:24] [INFO ] Implicit Places using invariants in 500 ms returned []
[2023-03-19 01:05:24] [INFO ] Invariant cache hit.
[2023-03-19 01:05:26] [INFO ] Implicit Places using invariants and state equation in 1184 ms returned []
Implicit Place search using SMT with State Equation took 1702 ms to find 0 implicit places.
[2023-03-19 01:05:26] [INFO ] Redundant transitions in 57 ms returned []
[2023-03-19 01:05:26] [INFO ] Invariant cache hit.
[2023-03-19 01:05:26] [INFO ] Dead Transitions using invariants and state equation in 489 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2307 ms. Remains : 756/756 places, 558/558 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 282 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 317734 steps, run timeout after 3001 ms. (steps per millisecond=105 ) properties seen :{1=1}
Probabilistic random walk after 317734 steps, saw 313828 distinct states, run finished after 3007 ms. (steps per millisecond=105 ) properties seen :1
Running SMT prover for 1 properties.
[2023-03-19 01:05:30] [INFO ] Invariant cache hit.
[2023-03-19 01:05:30] [INFO ] [Real]Absence check using 358 positive place invariants in 127 ms returned sat
[2023-03-19 01:05:31] [INFO ] After 441ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-19 01:05:31] [INFO ] After 535ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 01:05:31] [INFO ] After 927ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 01:05:31] [INFO ] [Nat]Absence check using 358 positive place invariants in 68 ms returned sat
[2023-03-19 01:05:32] [INFO ] After 306ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 01:05:32] [INFO ] After 392ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-03-19 01:05:32] [INFO ] After 738ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 756 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 756/756 places, 558/558 transitions.
Partial Free-agglomeration rule applied 77 times.
Drop transitions removed 77 transitions
Iterating global reduction 0 with 77 rules applied. Total rules applied 77 place count 756 transition count 558
Applied a total of 77 rules in 49 ms. Remains 756 /756 variables (removed 0) and now considering 558/558 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 756/756 places, 558/558 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 329713 steps, run timeout after 3001 ms. (steps per millisecond=109 ) properties seen :{}
Probabilistic random walk after 329713 steps, saw 311037 distinct states, run finished after 3001 ms. (steps per millisecond=109 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 558 rows 756 cols
[2023-03-19 01:05:35] [INFO ] Computed 358 place invariants in 5 ms
[2023-03-19 01:05:35] [INFO ] [Real]Absence check using 358 positive place invariants in 60 ms returned sat
[2023-03-19 01:05:35] [INFO ] After 524ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 01:05:36] [INFO ] [Nat]Absence check using 358 positive place invariants in 55 ms returned sat
[2023-03-19 01:05:36] [INFO ] After 289ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 01:05:36] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-19 01:05:36] [INFO ] After 115ms SMT Verify possible using 40 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 01:05:36] [INFO ] After 201ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 72 ms.
[2023-03-19 01:05:36] [INFO ] After 841ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 232 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=58 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 389 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 613 ms.
Product exploration explored 100000 steps with 0 reset in 829 ms.
Built C files in :
/tmp/ltsmin12684055616848939328
[2023-03-19 01:05:39] [INFO ] Computing symmetric may disable matrix : 558 transitions.
[2023-03-19 01:05:39] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 01:05:39] [INFO ] Computing symmetric may enable matrix : 558 transitions.
[2023-03-19 01:05:39] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 01:05:39] [INFO ] Computing Do-Not-Accords matrix : 558 transitions.
[2023-03-19 01:05:39] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 01:05:39] [INFO ] Built C files in 101ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12684055616848939328
Running compilation step : cd /tmp/ltsmin12684055616848939328;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1535 ms.
Running link step : cd /tmp/ltsmin12684055616848939328;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 109 ms.
Running LTSmin : cd /tmp/ltsmin12684055616848939328;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1334245002803753527.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 756 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 756/756 places, 558/558 transitions.
Applied a total of 0 rules in 43 ms. Remains 756 /756 variables (removed 0) and now considering 558/558 (removed 0) transitions.
// Phase 1: matrix 558 rows 756 cols
[2023-03-19 01:05:54] [INFO ] Computed 358 place invariants in 2 ms
[2023-03-19 01:05:54] [INFO ] Implicit Places using invariants in 447 ms returned []
[2023-03-19 01:05:54] [INFO ] Invariant cache hit.
[2023-03-19 01:05:55] [INFO ] Implicit Places using invariants and state equation in 945 ms returned []
Implicit Place search using SMT with State Equation took 1400 ms to find 0 implicit places.
[2023-03-19 01:05:55] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-19 01:05:55] [INFO ] Invariant cache hit.
[2023-03-19 01:05:56] [INFO ] Dead Transitions using invariants and state equation in 428 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1896 ms. Remains : 756/756 places, 558/558 transitions.
Built C files in :
/tmp/ltsmin14895831872879044923
[2023-03-19 01:05:56] [INFO ] Computing symmetric may disable matrix : 558 transitions.
[2023-03-19 01:05:56] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 01:05:56] [INFO ] Computing symmetric may enable matrix : 558 transitions.
[2023-03-19 01:05:56] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 01:05:56] [INFO ] Computing Do-Not-Accords matrix : 558 transitions.
[2023-03-19 01:05:56] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 01:05:56] [INFO ] Built C files in 72ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14895831872879044923
Running compilation step : cd /tmp/ltsmin14895831872879044923;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1395 ms.
Running link step : cd /tmp/ltsmin14895831872879044923;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 78 ms.
Running LTSmin : cd /tmp/ltsmin14895831872879044923;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9209619223564969423.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-19 01:06:11] [INFO ] Flatten gal took : 44 ms
[2023-03-19 01:06:11] [INFO ] Flatten gal took : 41 ms
[2023-03-19 01:06:11] [INFO ] Time to serialize gal into /tmp/LTL2316887787631186963.gal : 7 ms
[2023-03-19 01:06:11] [INFO ] Time to serialize properties into /tmp/LTL15388569971091088654.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2316887787631186963.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11607859066152808261.hoa' '-atoms' '/tmp/LTL15388569971091088654.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL15388569971091088654.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11607859066152808261.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
712 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,7.27358,132812,1,0,14,643890,34,6,19220,293236,45
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-040A-LTLCardinality-02 FALSE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ShieldIIPt-PT-040A-LTLCardinality-02 finished in 70892 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&F(p1))))'
Support contains 3 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 21 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
// Phase 1: matrix 562 rows 763 cols
[2023-03-19 01:06:19] [INFO ] Computed 361 place invariants in 3 ms
[2023-03-19 01:06:19] [INFO ] Implicit Places using invariants in 555 ms returned []
[2023-03-19 01:06:19] [INFO ] Invariant cache hit.
[2023-03-19 01:06:20] [INFO ] Implicit Places using invariants and state equation in 969 ms returned []
Implicit Place search using SMT with State Equation took 1550 ms to find 0 implicit places.
[2023-03-19 01:06:20] [INFO ] Invariant cache hit.
[2023-03-19 01:06:21] [INFO ] Dead Transitions using invariants and state equation in 412 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2000 ms. Remains : 763/763 places, 562/562 transitions.
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-040A-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s748 1), p0:(OR (EQ s413 0) (EQ s503 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 2158 reset in 823 ms.
Stack based approach found an accepted trace after 113 steps with 2 reset with depth 6 and stack size 6 in 1 ms.
FORMULA ShieldIIPt-PT-040A-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-040A-LTLCardinality-05 finished in 3111 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(F(p1))))))'
Support contains 3 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 9 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
[2023-03-19 01:06:22] [INFO ] Invariant cache hit.
[2023-03-19 01:06:22] [INFO ] Implicit Places using invariants in 470 ms returned []
[2023-03-19 01:06:22] [INFO ] Invariant cache hit.
[2023-03-19 01:06:24] [INFO ] Implicit Places using invariants and state equation in 1050 ms returned []
Implicit Place search using SMT with State Equation took 1535 ms to find 0 implicit places.
[2023-03-19 01:06:24] [INFO ] Invariant cache hit.
[2023-03-19 01:06:24] [INFO ] Dead Transitions using invariants and state equation in 573 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2131 ms. Remains : 763/763 places, 562/562 transitions.
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-040A-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s215 0), p1:(AND (NEQ s272 0) (NEQ s335 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 650 ms.
Product exploration explored 100000 steps with 0 reset in 754 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 p0), true, (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 273 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Finished probabilistic random walk after 21412 steps, run visited all 2 properties in 270 ms. (steps per millisecond=79 )
Probabilistic random walk after 21412 steps, saw 20844 distinct states, run finished after 271 ms. (steps per millisecond=79 ) properties seen :2
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), true, (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 5 factoid took 354 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 19 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
[2023-03-19 01:06:27] [INFO ] Invariant cache hit.
[2023-03-19 01:06:28] [INFO ] Implicit Places using invariants in 497 ms returned []
[2023-03-19 01:06:28] [INFO ] Invariant cache hit.
[2023-03-19 01:06:29] [INFO ] Implicit Places using invariants and state equation in 856 ms returned []
Implicit Place search using SMT with State Equation took 1369 ms to find 0 implicit places.
[2023-03-19 01:06:29] [INFO ] Invariant cache hit.
[2023-03-19 01:06:29] [INFO ] Dead Transitions using invariants and state equation in 479 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1867 ms. Remains : 763/763 places, 562/562 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 p0), true, (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 210 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :0
Finished probabilistic random walk after 21412 steps, run visited all 2 properties in 269 ms. (steps per millisecond=79 )
Probabilistic random walk after 21412 steps, saw 20844 distinct states, run finished after 270 ms. (steps per millisecond=79 ) properties seen :2
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), true, (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 5 factoid took 206 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 703 ms.
Product exploration explored 100000 steps with 0 reset in 788 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 763 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 763/763 places, 562/562 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 763 transition count 562
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 763 transition count 562
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 763 transition count 562
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 2 rules in 129 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
[2023-03-19 01:06:33] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 562 rows 763 cols
[2023-03-19 01:06:33] [INFO ] Computed 361 place invariants in 4 ms
[2023-03-19 01:06:34] [INFO ] Dead Transitions using invariants and state equation in 539 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 763/763 places, 562/562 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 685 ms. Remains : 763/763 places, 562/562 transitions.
Built C files in :
/tmp/ltsmin12142044244858567798
[2023-03-19 01:06:34] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12142044244858567798
Running compilation step : cd /tmp/ltsmin12142044244858567798;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 963 ms.
Running link step : cd /tmp/ltsmin12142044244858567798;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin12142044244858567798;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1230540269467444241.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 14 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
// Phase 1: matrix 562 rows 763 cols
[2023-03-19 01:06:49] [INFO ] Computed 361 place invariants in 4 ms
[2023-03-19 01:06:49] [INFO ] Implicit Places using invariants in 606 ms returned []
[2023-03-19 01:06:49] [INFO ] Invariant cache hit.
[2023-03-19 01:06:50] [INFO ] Implicit Places using invariants and state equation in 957 ms returned []
Implicit Place search using SMT with State Equation took 1587 ms to find 0 implicit places.
[2023-03-19 01:06:50] [INFO ] Invariant cache hit.
[2023-03-19 01:06:51] [INFO ] Dead Transitions using invariants and state equation in 452 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2054 ms. Remains : 763/763 places, 562/562 transitions.
Built C files in :
/tmp/ltsmin10841713410846773522
[2023-03-19 01:06:51] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10841713410846773522
Running compilation step : cd /tmp/ltsmin10841713410846773522;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 917 ms.
Running link step : cd /tmp/ltsmin10841713410846773522;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin10841713410846773522;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12917019827407847688.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-19 01:07:06] [INFO ] Flatten gal took : 57 ms
[2023-03-19 01:07:06] [INFO ] Flatten gal took : 37 ms
[2023-03-19 01:07:06] [INFO ] Time to serialize gal into /tmp/LTL13747133038410003439.gal : 4 ms
[2023-03-19 01:07:06] [INFO ] Time to serialize properties into /tmp/LTL1663921921982960574.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13747133038410003439.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2589696912972879241.hoa' '-atoms' '/tmp/LTL1663921921982960574.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL1663921921982960574.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2589696912972879241.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
568 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,5.75104,139188,1,0,18,689046,27,4,19384,341446,43
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-040A-LTLCardinality-08 FALSE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ShieldIIPt-PT-040A-LTLCardinality-08 finished in 50292 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((X(p0) U p1)) U !(X(p1)||F(p2))))'
Support contains 2 out of 763 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 10 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
[2023-03-19 01:07:12] [INFO ] Invariant cache hit.
[2023-03-19 01:07:13] [INFO ] Implicit Places using invariants in 469 ms returned []
[2023-03-19 01:07:13] [INFO ] Invariant cache hit.
[2023-03-19 01:07:14] [INFO ] Implicit Places using invariants and state equation in 825 ms returned []
Implicit Place search using SMT with State Equation took 1310 ms to find 0 implicit places.
[2023-03-19 01:07:14] [INFO ] Invariant cache hit.
[2023-03-19 01:07:14] [INFO ] Dead Transitions using invariants and state equation in 466 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1787 ms. Remains : 763/763 places, 562/562 transitions.
Stuttering acceptance computed with spot in 394 ms :[(OR p2 p1), p1, p2, (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-040A-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={0} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(AND p2 p1), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 2}], [{ cond=p2, acceptance={0} source=2 dest: 0}, { cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(NEQ s465 1), p1:(EQ s150 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 689 ms.
Stack based approach found an accepted trace after 95 steps with 1 reset with depth 94 and stack size 94 in 1 ms.
FORMULA ShieldIIPt-PT-040A-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-040A-LTLCardinality-12 finished in 2894 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!p0 U p1)||G(p2))))'
Support contains 5 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 23 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
[2023-03-19 01:07:15] [INFO ] Invariant cache hit.
[2023-03-19 01:07:16] [INFO ] Implicit Places using invariants in 506 ms returned []
[2023-03-19 01:07:16] [INFO ] Invariant cache hit.
[2023-03-19 01:07:17] [INFO ] Implicit Places using invariants and state equation in 1020 ms returned []
Implicit Place search using SMT with State Equation took 1528 ms to find 0 implicit places.
[2023-03-19 01:07:17] [INFO ] Invariant cache hit.
[2023-03-19 01:07:17] [INFO ] Dead Transitions using invariants and state equation in 475 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2027 ms. Remains : 763/763 places, 562/562 transitions.
Stuttering acceptance computed with spot in 178 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-040A-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(NEQ s398 1), p0:(OR (EQ s470 0) (EQ s241 1)), p2:(OR (EQ s298 0) (EQ s653 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1971 ms.
Product exploration explored 100000 steps with 50000 reset in 2005 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), true, (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 p0 p2)
Knowledge based reduction with 13 factoid took 418 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-040A-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-040A-LTLCardinality-13 finished in 6638 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&F(p1)))'
Support contains 3 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 22 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
[2023-03-19 01:07:22] [INFO ] Invariant cache hit.
[2023-03-19 01:07:22] [INFO ] Implicit Places using invariants in 517 ms returned []
[2023-03-19 01:07:22] [INFO ] Invariant cache hit.
[2023-03-19 01:07:23] [INFO ] Implicit Places using invariants and state equation in 1010 ms returned []
Implicit Place search using SMT with State Equation took 1530 ms to find 0 implicit places.
[2023-03-19 01:07:23] [INFO ] Invariant cache hit.
[2023-03-19 01:07:24] [INFO ] Dead Transitions using invariants and state equation in 548 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2101 ms. Remains : 763/763 places, 562/562 transitions.
Stuttering acceptance computed with spot in 210 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-040A-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(EQ s88 1), p1:(AND (EQ s754 0) (EQ s29 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 661 ms.
Product exploration explored 100000 steps with 0 reset in 817 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X p0), true, (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 541 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X p0), true, (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (X (X p0))]
False Knowledge obtained : [(F p0)]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 501 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
[2023-03-19 01:07:27] [INFO ] Invariant cache hit.
[2023-03-19 01:07:28] [INFO ] [Real]Absence check using 361 positive place invariants in 232 ms returned sat
[2023-03-19 01:07:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 01:07:28] [INFO ] [Real]Absence check using state equation in 271 ms returned sat
[2023-03-19 01:07:28] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints (skipped 0 transitions) in 45 ms.
[2023-03-19 01:07:28] [INFO ] Added : 0 causal constraints over 0 iterations in 146 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 763 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 17 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
[2023-03-19 01:07:29] [INFO ] Invariant cache hit.
[2023-03-19 01:07:29] [INFO ] Implicit Places using invariants in 493 ms returned []
[2023-03-19 01:07:29] [INFO ] Invariant cache hit.
[2023-03-19 01:07:30] [INFO ] Implicit Places using invariants and state equation in 860 ms returned []
Implicit Place search using SMT with State Equation took 1360 ms to find 0 implicit places.
[2023-03-19 01:07:30] [INFO ] Invariant cache hit.
[2023-03-19 01:07:30] [INFO ] Dead Transitions using invariants and state equation in 447 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1825 ms. Remains : 763/763 places, 562/562 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 81 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X (X p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 168 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
[2023-03-19 01:07:31] [INFO ] Invariant cache hit.
[2023-03-19 01:07:32] [INFO ] [Real]Absence check using 361 positive place invariants in 235 ms returned sat
[2023-03-19 01:07:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 01:07:32] [INFO ] [Real]Absence check using state equation in 275 ms returned sat
[2023-03-19 01:07:32] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints (skipped 0 transitions) in 60 ms.
[2023-03-19 01:07:32] [INFO ] Added : 0 causal constraints over 0 iterations in 171 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 187 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 683 ms.
Product exploration explored 100000 steps with 0 reset in 783 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 200 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 763 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 763/763 places, 562/562 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 763 transition count 562
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 763 transition count 562
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 763 transition count 562
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 2 rules in 49 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
[2023-03-19 01:07:34] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 562 rows 763 cols
[2023-03-19 01:07:34] [INFO ] Computed 361 place invariants in 2 ms
[2023-03-19 01:07:35] [INFO ] Dead Transitions using invariants and state equation in 488 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 763/763 places, 562/562 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 560 ms. Remains : 763/763 places, 562/562 transitions.
Built C files in :
/tmp/ltsmin2334863510910569666
[2023-03-19 01:07:35] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2334863510910569666
Running compilation step : cd /tmp/ltsmin2334863510910569666;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 920 ms.
Running link step : cd /tmp/ltsmin2334863510910569666;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin2334863510910569666;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7391813529518081664.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 10 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
// Phase 1: matrix 562 rows 763 cols
[2023-03-19 01:07:50] [INFO ] Computed 361 place invariants in 3 ms
[2023-03-19 01:07:50] [INFO ] Implicit Places using invariants in 640 ms returned []
[2023-03-19 01:07:50] [INFO ] Invariant cache hit.
[2023-03-19 01:07:52] [INFO ] Implicit Places using invariants and state equation in 1099 ms returned []
Implicit Place search using SMT with State Equation took 1750 ms to find 0 implicit places.
[2023-03-19 01:07:52] [INFO ] Invariant cache hit.
[2023-03-19 01:07:52] [INFO ] Dead Transitions using invariants and state equation in 377 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2138 ms. Remains : 763/763 places, 562/562 transitions.
Built C files in :
/tmp/ltsmin16494566411071058197
[2023-03-19 01:07:52] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16494566411071058197
Running compilation step : cd /tmp/ltsmin16494566411071058197;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 920 ms.
Running link step : cd /tmp/ltsmin16494566411071058197;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin16494566411071058197;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6459160684662798622.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-19 01:08:07] [INFO ] Flatten gal took : 50 ms
[2023-03-19 01:08:07] [INFO ] Flatten gal took : 46 ms
[2023-03-19 01:08:07] [INFO ] Time to serialize gal into /tmp/LTL2264689529160589161.gal : 3 ms
[2023-03-19 01:08:07] [INFO ] Time to serialize properties into /tmp/LTL2330505767525527759.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2264689529160589161.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10679366693373463270.hoa' '-atoms' '/tmp/LTL2330505767525527759.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL2330505767525527759.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10679366693373463270.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2023-03-19 01:08:22] [INFO ] Flatten gal took : 34 ms
[2023-03-19 01:08:22] [INFO ] Flatten gal took : 30 ms
[2023-03-19 01:08:22] [INFO ] Time to serialize gal into /tmp/LTL14535312222524867232.gal : 4 ms
[2023-03-19 01:08:22] [INFO ] Time to serialize properties into /tmp/LTL380955881650176373.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14535312222524867232.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL380955881650176373.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((X(G("(p88==1)")))&&(F("((p754==0)&&(p29==1))"))))
Formula 0 simplified : XF!"(p88==1)" | G!"((p754==0)&&(p29==1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2023-03-19 01:08:37] [INFO ] Flatten gal took : 48 ms
[2023-03-19 01:08:37] [INFO ] Applying decomposition
[2023-03-19 01:08:37] [INFO ] Flatten gal took : 34 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph12344470988010913479.txt' '-o' '/tmp/graph12344470988010913479.bin' '-w' '/tmp/graph12344470988010913479.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph12344470988010913479.bin' '-l' '-1' '-v' '-w' '/tmp/graph12344470988010913479.weights' '-q' '0' '-e' '0.001'
[2023-03-19 01:08:38] [INFO ] Decomposing Gal with order
[2023-03-19 01:08:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 01:08:38] [INFO ] Removed a total of 120 redundant transitions.
[2023-03-19 01:08:38] [INFO ] Flatten gal took : 115 ms
[2023-03-19 01:08:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 45 ms.
[2023-03-19 01:08:38] [INFO ] Time to serialize gal into /tmp/LTL10541817188733163792.gal : 14 ms
[2023-03-19 01:08:38] [INFO ] Time to serialize properties into /tmp/LTL5640403595344574523.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10541817188733163792.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5640403595344574523.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((X(G("(i4.u36.p88==1)")))&&(F("((i24.u316.p754==0)&&(i0.u11.p29==1))"))))
Formula 0 simplified : XF!"(i4.u36.p88==1)" | G!"((i24.u316.p754==0)&&(i0.u11.p29==1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
97 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,1.07144,38488,1,0,46925,453,3732,92544,122,1740,97217
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-040A-LTLCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ShieldIIPt-PT-040A-LTLCardinality-14 finished in 77286 ms.
All properties solved by simple procedures.
Total runtime 230277 ms.

BK_STOP 1679188119869

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-040A"
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-5348"
echo " Executing tool itstools"
echo " Input is ShieldIIPt-PT-040A, 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 r389-oct2-167903713400307"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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