Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.5K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 91K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Mar 28 16:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 27 12:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 27 12:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 19:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 19:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 119K May 5 16:52 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1621256403796

Running Version 0
[2021-05-17 13:00:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-17 13:00:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 13:00:07] [INFO ] Load time of PNML (sax parser for PT used): 158 ms
[2021-05-17 13:00:07] [INFO ] Transformed 503 places.
[2021-05-17 13:00:07] [INFO ] Transformed 503 transitions.
[2021-05-17 13:00:07] [INFO ] Found NUPN structural information;
[2021-05-17 13:00:07] [INFO ] Parsed PT model containing 503 places and 503 transitions in 263 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 13:00:07] [INFO ] Initial state test concluded for 4 properties.
Support contains 42 out of 503 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 503/503 places, 503/503 transitions.
Discarding 98 places :
Symmetric choice reduction at 0 with 98 rule applications. Total rules 98 place count 405 transition count 405
Iterating global reduction 0 with 98 rules applied. Total rules applied 196 place count 405 transition count 405
Applied a total of 196 rules in 156 ms. Remains 405 /503 variables (removed 98) and now considering 405/503 (removed 98) transitions.
// Phase 1: matrix 405 rows 405 cols
[2021-05-17 13:00:07] [INFO ] Computed 41 place invariants in 35 ms
[2021-05-17 13:00:08] [INFO ] Implicit Places using invariants in 543 ms returned []
// Phase 1: matrix 405 rows 405 cols
[2021-05-17 13:00:08] [INFO ] Computed 41 place invariants in 9 ms
[2021-05-17 13:00:08] [INFO ] Implicit Places using invariants and state equation in 639 ms returned []
Implicit Place search using SMT with State Equation took 1235 ms to find 0 implicit places.
// Phase 1: matrix 405 rows 405 cols
[2021-05-17 13:00:08] [INFO ] Computed 41 place invariants in 9 ms
[2021-05-17 13:00:09] [INFO ] Dead Transitions using invariants and state equation in 564 ms returned []
Finished structural reductions, in 1 iterations. Remains : 405/503 places, 405/503 transitions.
[2021-05-17 13:00:09] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-17 13:00:09] [INFO ] Flatten gal took : 134 ms
FORMULA ShieldRVt-PT-010B-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 13:00:09] [INFO ] Flatten gal took : 57 ms
[2021-05-17 13:00:10] [INFO ] Input system was already deterministic with 405 transitions.
Incomplete random walk after 100000 steps, including 3 resets, run finished after 305 ms. (steps per millisecond=327 ) properties (out of 33) seen :31
Running SMT prover for 2 properties.
// Phase 1: matrix 405 rows 405 cols
[2021-05-17 13:00:10] [INFO ] Computed 41 place invariants in 5 ms
[2021-05-17 13:00:10] [INFO ] [Real]Absence check using 41 positive place invariants in 16 ms returned unsat
[2021-05-17 13:00:10] [INFO ] [Real]Absence check using 41 positive place invariants in 16 ms returned sat
[2021-05-17 13:00:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 13:00:10] [INFO ] [Real]Absence check using state equation in 232 ms returned sat
[2021-05-17 13:00:11] [INFO ] Deduced a trap composed of 24 places in 284 ms of which 9 ms to minimize.
[2021-05-17 13:00:11] [INFO ] Deduced a trap composed of 18 places in 181 ms of which 2 ms to minimize.
[2021-05-17 13:00:11] [INFO ] Deduced a trap composed of 21 places in 126 ms of which 2 ms to minimize.
[2021-05-17 13:00:11] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 1 ms to minimize.
[2021-05-17 13:00:11] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 1 ms to minimize.
[2021-05-17 13:00:11] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1038 ms
[2021-05-17 13:00:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 13:00:12] [INFO ] [Nat]Absence check using 41 positive place invariants in 28 ms returned sat
[2021-05-17 13:00:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 13:00:12] [INFO ] [Nat]Absence check using state equation in 244 ms returned sat
[2021-05-17 13:00:12] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 1 ms to minimize.
[2021-05-17 13:00:12] [INFO ] Deduced a trap composed of 18 places in 114 ms of which 1 ms to minimize.
[2021-05-17 13:00:12] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 1 ms to minimize.
[2021-05-17 13:00:12] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 1 ms to minimize.
[2021-05-17 13:00:12] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 1 ms to minimize.
[2021-05-17 13:00:13] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 761 ms
[2021-05-17 13:00:13] [INFO ] Computed and/alt/rep : 404/593/404 causal constraints (skipped 0 transitions) in 68 ms.
[2021-05-17 13:00:17] [INFO ] Added : 401 causal constraints over 81 iterations in 4435 ms. Result :sat
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((X(p0)||(p0&&G(p1))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 405 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 405/405 places, 405/405 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 392 transition count 392
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 392 transition count 392
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 391 transition count 391
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 391 transition count 391
Applied a total of 28 rules in 76 ms. Remains 391 /405 variables (removed 14) and now considering 391/405 (removed 14) transitions.
// Phase 1: matrix 391 rows 391 cols
[2021-05-17 13:00:17] [INFO ] Computed 41 place invariants in 2 ms
[2021-05-17 13:00:17] [INFO ] Implicit Places using invariants in 159 ms returned []
// Phase 1: matrix 391 rows 391 cols
[2021-05-17 13:00:17] [INFO ] Computed 41 place invariants in 3 ms
[2021-05-17 13:00:18] [INFO ] Implicit Places using invariants and state equation in 434 ms returned []
Implicit Place search using SMT with State Equation took 596 ms to find 0 implicit places.
// Phase 1: matrix 391 rows 391 cols
[2021-05-17 13:00:18] [INFO ] Computed 41 place invariants in 3 ms
[2021-05-17 13:00:18] [INFO ] Dead Transitions using invariants and state equation in 278 ms returned []
Finished structural reductions, in 1 iterations. Remains : 391/405 places, 391/405 transitions.
Stuttering acceptance computed with spot in 355 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-010B-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s276 1), p1:(EQ s383 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 303 reset in 737 ms.
Stack based approach found an accepted trace after 4616 steps with 17 reset with depth 318 and stack size 318 in 21 ms.
FORMULA ShieldRVt-PT-010B-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-010B-00 finished in 2170 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 405 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 405/405 places, 405/405 transitions.
Drop transitions removed 112 transitions
Trivial Post-agglo rules discarded 112 transitions
Performed 112 trivial Post agglomeration. Transition count delta: 112
Iterating post reduction 0 with 112 rules applied. Total rules applied 112 place count 405 transition count 293
Reduce places removed 112 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 114 rules applied. Total rules applied 226 place count 293 transition count 291
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 227 place count 292 transition count 291
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 73 Pre rules applied. Total rules applied 227 place count 292 transition count 218
Deduced a syphon composed of 73 places in 1 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 3 with 146 rules applied. Total rules applied 373 place count 219 transition count 218
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 383 place count 209 transition count 208
Iterating global reduction 3 with 10 rules applied. Total rules applied 393 place count 209 transition count 208
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 393 place count 209 transition count 200
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 409 place count 201 transition count 200
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 1 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 3 with 174 rules applied. Total rules applied 583 place count 114 transition count 113
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 641 place count 85 transition count 141
Applied a total of 641 rules in 78 ms. Remains 85 /405 variables (removed 320) and now considering 141/405 (removed 264) transitions.
// Phase 1: matrix 141 rows 85 cols
[2021-05-17 13:00:19] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-17 13:00:19] [INFO ] Implicit Places using invariants in 78 ms returned [78]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 85 ms to find 1 implicit places.
[2021-05-17 13:00:19] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 141 rows 84 cols
[2021-05-17 13:00:19] [INFO ] Computed 40 place invariants in 1 ms
[2021-05-17 13:00:19] [INFO ] Dead Transitions using invariants and state equation in 103 ms returned []
Starting structural reductions, iteration 1 : 84/405 places, 141/405 transitions.
Applied a total of 0 rules in 8 ms. Remains 84 /84 variables (removed 0) and now considering 141/141 (removed 0) transitions.
[2021-05-17 13:00:19] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 141 rows 84 cols
[2021-05-17 13:00:19] [INFO ] Computed 40 place invariants in 0 ms
[2021-05-17 13:00:20] [INFO ] Dead Transitions using invariants and state equation in 100 ms returned []
Finished structural reductions, in 2 iterations. Remains : 84/405 places, 141/405 transitions.
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-010B-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s54 1) (EQ s65 1)), p0:(EQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-010B-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-010B-01 finished in 548 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F((p0&&(p1 U p2)))||(G(!p0) U X(p3))))], workingDir=/home/mcc/execution]
Support contains 5 out of 405 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 405/405 places, 405/405 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 393 transition count 393
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 393 transition count 393
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 392 transition count 392
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 392 transition count 392
Applied a total of 26 rules in 311 ms. Remains 392 /405 variables (removed 13) and now considering 392/405 (removed 13) transitions.
// Phase 1: matrix 392 rows 392 cols
[2021-05-17 13:00:20] [INFO ] Computed 41 place invariants in 3 ms
[2021-05-17 13:00:20] [INFO ] Implicit Places using invariants in 149 ms returned []
// Phase 1: matrix 392 rows 392 cols
[2021-05-17 13:00:20] [INFO ] Computed 41 place invariants in 2 ms
[2021-05-17 13:00:21] [INFO ] Implicit Places using invariants and state equation in 394 ms returned []
Implicit Place search using SMT with State Equation took 545 ms to find 0 implicit places.
// Phase 1: matrix 392 rows 392 cols
[2021-05-17 13:00:21] [INFO ] Computed 41 place invariants in 2 ms
[2021-05-17 13:00:21] [INFO ] Dead Transitions using invariants and state equation in 409 ms returned []
Finished structural reductions, in 1 iterations. Remains : 392/405 places, 392/405 transitions.
Stuttering acceptance computed with spot in 333 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (NOT p2) (NOT p0)), (AND p0 (NOT p2)), (NOT p2)]
Running random walk in product with property : ShieldRVt-PT-010B-02 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1) (NOT p3)), acceptance={0} source=1 dest: 4}, { cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=1 dest: 5}, { cond=(AND p0 (NOT p2) p1 (NOT p3)), acceptance={0} source=1 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=2 dest: 6}], [{ cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3))), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p2) p1 (NOT p3)), acceptance={} source=3 dest: 6}], [{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={0} source=4 dest: 4}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=4 dest: 6}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(NOT p0), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s74 1), p2:(EQ s352 1), p1:(AND (EQ s10 1) (EQ s37 1)), p3:(EQ s326 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 67291 steps with 3 reset in 375 ms.
FORMULA ShieldRVt-PT-010B-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-010B-02 finished in 2005 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((p0||(p1&&((p2&&F(p3))||G(p2)))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 405 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 405/405 places, 405/405 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 394 transition count 394
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 394 transition count 394
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 393 transition count 393
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 393 transition count 393
Applied a total of 24 rules in 57 ms. Remains 393 /405 variables (removed 12) and now considering 393/405 (removed 12) transitions.
// Phase 1: matrix 393 rows 393 cols
[2021-05-17 13:00:22] [INFO ] Computed 41 place invariants in 2 ms
[2021-05-17 13:00:22] [INFO ] Implicit Places using invariants in 143 ms returned []
// Phase 1: matrix 393 rows 393 cols
[2021-05-17 13:00:22] [INFO ] Computed 41 place invariants in 2 ms
[2021-05-17 13:00:22] [INFO ] Implicit Places using invariants and state equation in 402 ms returned []
Implicit Place search using SMT with State Equation took 551 ms to find 0 implicit places.
// Phase 1: matrix 393 rows 393 cols
[2021-05-17 13:00:22] [INFO ] Computed 41 place invariants in 2 ms
[2021-05-17 13:00:23] [INFO ] Dead Transitions using invariants and state equation in 377 ms returned []
Finished structural reductions, in 1 iterations. Remains : 393/405 places, 393/405 transitions.
Stuttering acceptance computed with spot in 235 ms :[true, (NOT p3), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p3) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : ShieldRVt-PT-010B-04 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1 p2 (NOT p3)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(AND p2 (NOT p3)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 2}]], initial=4, aps=[p3:(OR (NEQ s32 1) (NEQ s46 1)), p0:(EQ s391 1), p1:(EQ s370 0), p2:(NEQ s365 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 411 ms.
Product exploration explored 100000 steps with 33333 reset in 289 ms.
Knowledge obtained : [p3, (NOT p0), p1, p2]
Stuttering acceptance computed with spot in 225 ms :[true, (NOT p3), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p3) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Product exploration explored 100000 steps with 33333 reset in 280 ms.
Product exploration explored 100000 steps with 33333 reset in 364 ms.
Applying partial POR strategy [true, true, true, true, false, false]
Stuttering acceptance computed with spot in 234 ms :[true, (NOT p3), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p3) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Support contains 5 out of 393 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 393/393 places, 393/393 transitions.
Performed 105 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 105 rules applied. Total rules applied 105 place count 393 transition count 393
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 51 Pre rules applied. Total rules applied 105 place count 393 transition count 465
Deduced a syphon composed of 156 places in 1 ms
Iterating global reduction 1 with 51 rules applied. Total rules applied 156 place count 393 transition count 465
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 267 places in 1 ms
Iterating global reduction 1 with 111 rules applied. Total rules applied 267 place count 393 transition count 466
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 269 place count 393 transition count 464
Discarding 70 places :
Symmetric choice reduction at 2 with 70 rule applications. Total rules 339 place count 323 transition count 393
Deduced a syphon composed of 197 places in 0 ms
Iterating global reduction 2 with 70 rules applied. Total rules applied 409 place count 323 transition count 393
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 198 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 410 place count 323 transition count 393
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 412 place count 321 transition count 391
Deduced a syphon composed of 196 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 414 place count 321 transition count 391
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -229
Deduced a syphon composed of 224 places in 1 ms
Iterating global reduction 2 with 28 rules applied. Total rules applied 442 place count 321 transition count 620
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 471 place count 292 transition count 562
Deduced a syphon composed of 195 places in 1 ms
Iterating global reduction 2 with 29 rules applied. Total rules applied 500 place count 292 transition count 562
Deduced a syphon composed of 195 places in 0 ms
Applied a total of 500 rules in 246 ms. Remains 292 /393 variables (removed 101) and now considering 562/393 (removed -169) transitions.
[2021-05-17 13:00:26] [INFO ] Redundant transitions in 48 ms returned []
// Phase 1: matrix 562 rows 292 cols
[2021-05-17 13:00:26] [INFO ] Computed 41 place invariants in 5 ms
[2021-05-17 13:00:26] [INFO ] Dead Transitions using invariants and state equation in 420 ms returned []
Finished structural reductions, in 1 iterations. Remains : 292/393 places, 562/393 transitions.
Product exploration explored 100000 steps with 33333 reset in 1400 ms.
Product exploration explored 100000 steps with 33333 reset in 1185 ms.
[2021-05-17 13:00:29] [INFO ] Flatten gal took : 31 ms
[2021-05-17 13:00:29] [INFO ] Flatten gal took : 27 ms
[2021-05-17 13:00:29] [INFO ] Time to serialize gal into /tmp/LTL4390327517044483291.gal : 15 ms
[2021-05-17 13:00:29] [INFO ] Time to serialize properties into /tmp/LTL10968201747599976951.ltl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL4390327517044483291.gal, -t, CGAL, -LTL, /tmp/LTL10968201747599976951.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4390327517044483291.gal -t CGAL -LTL /tmp/LTL10968201747599976951.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(("(p500==1)")||(("(p474==0)")&&((G("(p466!=1)"))||(("(p466!=1)")&&(F("((p36!=1)||(p55!=1))")))))))))
Formula 0 simplified : !XX("(p500==1)" | ("(p474==0)" & (G"(p466!=1)" | ("(p466!=1)" & F"((p36!=1)||(p55!=1))"))))
Detected timeout of ITS tools.
[2021-05-17 13:00:44] [INFO ] Flatten gal took : 26 ms
[2021-05-17 13:00:44] [INFO ] Applying decomposition
[2021-05-17 13:00:44] [INFO ] Flatten gal took : 40 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph16844744087660316977.txt, -o, /tmp/graph16844744087660316977.bin, -w, /tmp/graph16844744087660316977.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph16844744087660316977.bin, -l, -1, -v, -w, /tmp/graph16844744087660316977.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 13:00:44] [INFO ] Decomposing Gal with order
[2021-05-17 13:00:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 13:00:44] [INFO ] Removed a total of 97 redundant transitions.
[2021-05-17 13:00:44] [INFO ] Flatten gal took : 103 ms
[2021-05-17 13:00:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2021-05-17 13:00:44] [INFO ] Time to serialize gal into /tmp/LTL12077876420105901119.gal : 12 ms
[2021-05-17 13:00:44] [INFO ] Time to serialize properties into /tmp/LTL7708577338645666648.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL12077876420105901119.gal, -t, CGAL, -LTL, /tmp/LTL7708577338645666648.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL12077876420105901119.gal -t CGAL -LTL /tmp/LTL7708577338645666648.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(("(i18.u153.p500==1)")||(("(i18.u145.p474==0)")&&((G("(i0.u143.p466!=1)"))||(("(i0.u143.p466!=1)")&&(F("((i3.u11.p36!=1)||(i3.u19.p55!=1))")))))))))
Formula 0 simplified : !XX("(i18.u153.p500==1)" | ("(i18.u145.p474==0)" & (G"(i0.u143.p466!=1)" | ("(i0.u143.p466!=1)" & F"((i3.u11.p36!=1)||(i3.u19.p55!=1))"))))
Reverse transition relation is NOT exact ! Due to transitions t20, t366, t368, t370, t372, t375, t377, t379, t381, i0.t34, i0.u142.t32, i0.u143.t30, i0.u143.t36, i1.i0.i2.t120, i1.i0.i2.u106.t125, i1.i1.i0.t134, i1.i1.i0.t130, i1.i1.i1.t115, i1.i1.i1.u108.t111, i2.t243, i2.t239, i2.t230, i2.t225, i2.u61.t234, i2.u63.t221, i3.t355, i3.t352, i3.t348, i3.t339, i3.t334, i3.u5.t362, i3.u10.t359, i3.u16.t343, i3.u18.t330, i4.t320, i4.t317, i4.t313, i4.t297, i4.u24.t324, i4.u33.t293, i5.t302, i5.u31.t308, i6.t282, i6.t279, i6.t275, i6.t260, i6.u40.t287, i6.u48.t256, i7.t265, i7.u46.t270, i8.t246, i8.u54.t250, i9.t208, i9.t204, i9.t194, i9.t189, i9.u76.t199, i9.u78.t184, i10.t211, i10.u69.t215, i11.t174, i11.t171, i11.t167, i11.t152, i11.u85.t178, i11.u93.t148, i12.t157, i12.u90.t162, i13.t137, i13.u99.t142, i14.t98, i14.t94, i14.t84, i14.t79, i14.u122.t89, i14.u123.t75, i15.t101, i15.u114.t105, i16.t65, i16.u129.t69, i17.t62, i17.t58, i17.t49, i17.u136.t53, i17.u139.t40, i17.u139.t44, i18.t26, i18.t22, i18.t13, i18.t8, i18.u151.t17, i18.u152.t3, i18.u153.t10, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/300/93/393
Computing Next relation with stutter on 1.6593e+07 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
314 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.21512,66028,1,0,110827,675,4060,232619,230,1755,182294
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldRVt-PT-010B-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ShieldRVt-PT-010B-04 finished in 26108 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||G(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 405 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 405/405 places, 405/405 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 112 transitions
Trivial Post-agglo rules discarded 112 transitions
Performed 112 trivial Post agglomeration. Transition count delta: 112
Iterating post reduction 0 with 112 rules applied. Total rules applied 112 place count 404 transition count 292
Reduce places removed 112 places and 0 transitions.
Iterating post reduction 1 with 112 rules applied. Total rules applied 224 place count 292 transition count 292
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 224 place count 292 transition count 219
Deduced a syphon composed of 73 places in 1 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 370 place count 219 transition count 219
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 379 place count 210 transition count 210
Iterating global reduction 2 with 9 rules applied. Total rules applied 388 place count 210 transition count 210
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 388 place count 210 transition count 202
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 404 place count 202 transition count 202
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 2 with 172 rules applied. Total rules applied 576 place count 116 transition count 116
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 636 place count 86 transition count 145
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 637 place count 85 transition count 144
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 638 place count 84 transition count 143
Applied a total of 638 rules in 36 ms. Remains 84 /405 variables (removed 321) and now considering 143/405 (removed 262) transitions.
// Phase 1: matrix 143 rows 84 cols
[2021-05-17 13:00:48] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-17 13:00:48] [INFO ] Implicit Places using invariants in 94 ms returned []
// Phase 1: matrix 143 rows 84 cols
[2021-05-17 13:00:48] [INFO ] Computed 41 place invariants in 7 ms
[2021-05-17 13:00:48] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
[2021-05-17 13:00:48] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 143 rows 84 cols
[2021-05-17 13:00:48] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-17 13:00:48] [INFO ] Dead Transitions using invariants and state equation in 140 ms returned []
Finished structural reductions, in 1 iterations. Remains : 84/405 places, 143/405 transitions.
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-010B-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s76 1), p1:(NEQ s46 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 29 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-010B-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-010B-05 finished in 525 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||X(p1)))], workingDir=/home/mcc/execution]
Support contains 1 out of 405 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 405/405 places, 405/405 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 393 transition count 393
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 393 transition count 393
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 392 transition count 392
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 392 transition count 392
Applied a total of 26 rules in 29 ms. Remains 392 /405 variables (removed 13) and now considering 392/405 (removed 13) transitions.
// Phase 1: matrix 392 rows 392 cols
[2021-05-17 13:00:48] [INFO ] Computed 41 place invariants in 2 ms
[2021-05-17 13:00:49] [INFO ] Implicit Places using invariants in 173 ms returned []
// Phase 1: matrix 392 rows 392 cols
[2021-05-17 13:00:49] [INFO ] Computed 41 place invariants in 3 ms
[2021-05-17 13:00:49] [INFO ] Implicit Places using invariants and state equation in 460 ms returned []
Implicit Place search using SMT with State Equation took 637 ms to find 0 implicit places.
// Phase 1: matrix 392 rows 392 cols
[2021-05-17 13:00:49] [INFO ] Computed 41 place invariants in 2 ms
[2021-05-17 13:00:49] [INFO ] Dead Transitions using invariants and state equation in 414 ms returned []
Finished structural reductions, in 1 iterations. Remains : 392/405 places, 392/405 transitions.
Stuttering acceptance computed with spot in 148 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-010B-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(EQ s100 1), p0:(EQ s100 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 19369 steps with 1 reset in 69 ms.
FORMULA ShieldRVt-PT-010B-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-010B-06 finished in 1319 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 405 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 405/405 places, 405/405 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 113 transitions
Trivial Post-agglo rules discarded 113 transitions
Performed 113 trivial Post agglomeration. Transition count delta: 113
Iterating post reduction 0 with 113 rules applied. Total rules applied 113 place count 404 transition count 291
Reduce places removed 113 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 115 rules applied. Total rules applied 228 place count 291 transition count 289
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 230 place count 290 transition count 288
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 231 place count 289 transition count 288
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 72 Pre rules applied. Total rules applied 231 place count 289 transition count 216
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 4 with 144 rules applied. Total rules applied 375 place count 217 transition count 216
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 386 place count 206 transition count 205
Iterating global reduction 4 with 11 rules applied. Total rules applied 397 place count 206 transition count 205
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 397 place count 206 transition count 196
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 415 place count 197 transition count 196
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 4 with 166 rules applied. Total rules applied 581 place count 114 transition count 113
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 639 place count 85 transition count 141
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 640 place count 84 transition count 140
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 641 place count 83 transition count 140
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 642 place count 82 transition count 139
Applied a total of 642 rules in 66 ms. Remains 82 /405 variables (removed 323) and now considering 139/405 (removed 266) transitions.
// Phase 1: matrix 139 rows 82 cols
[2021-05-17 13:00:50] [INFO ] Computed 40 place invariants in 0 ms
[2021-05-17 13:00:50] [INFO ] Implicit Places using invariants in 137 ms returned []
// Phase 1: matrix 139 rows 82 cols
[2021-05-17 13:00:50] [INFO ] Computed 40 place invariants in 0 ms
[2021-05-17 13:00:50] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
[2021-05-17 13:00:50] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 139 rows 82 cols
[2021-05-17 13:00:50] [INFO ] Computed 40 place invariants in 1 ms
[2021-05-17 13:00:50] [INFO ] Dead Transitions using invariants and state equation in 118 ms returned []
Finished structural reductions, in 1 iterations. Remains : 82/405 places, 139/405 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-010B-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s30 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 140 steps with 1 reset in 3 ms.
FORMULA ShieldRVt-PT-010B-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-010B-07 finished in 627 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(G(p0))||(X(X(p2))&&p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 405 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 405/405 places, 405/405 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 394 transition count 394
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 394 transition count 394
Applied a total of 22 rules in 28 ms. Remains 394 /405 variables (removed 11) and now considering 394/405 (removed 11) transitions.
// Phase 1: matrix 394 rows 394 cols
[2021-05-17 13:00:50] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-17 13:00:51] [INFO ] Implicit Places using invariants in 226 ms returned []
// Phase 1: matrix 394 rows 394 cols
[2021-05-17 13:00:51] [INFO ] Computed 41 place invariants in 2 ms
[2021-05-17 13:00:51] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 574 ms to find 0 implicit places.
// Phase 1: matrix 394 rows 394 cols
[2021-05-17 13:00:51] [INFO ] Computed 41 place invariants in 2 ms
[2021-05-17 13:00:51] [INFO ] Dead Transitions using invariants and state equation in 479 ms returned []
Finished structural reductions, in 1 iterations. Remains : 394/405 places, 394/405 transitions.
Stuttering acceptance computed with spot in 290 ms :[true, (NOT p2), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : ShieldRVt-PT-010B-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 2}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={} source=6 dest: 2}, { cond=p1, acceptance={} source=6 dest: 3}]], initial=5, aps=[p2:(EQ s14 1), p0:(EQ s309 1), p1:(AND (EQ s361 1) (EQ s194 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-010B-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-010B-08 finished in 1410 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)||X(p1)))], workingDir=/home/mcc/execution]
Support contains 4 out of 405 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 405/405 places, 405/405 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 392 transition count 392
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 392 transition count 392
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 391 transition count 391
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 391 transition count 391
Applied a total of 28 rules in 22 ms. Remains 391 /405 variables (removed 14) and now considering 391/405 (removed 14) transitions.
// Phase 1: matrix 391 rows 391 cols
[2021-05-17 13:00:52] [INFO ] Computed 41 place invariants in 3 ms
[2021-05-17 13:00:52] [INFO ] Implicit Places using invariants in 140 ms returned []
// Phase 1: matrix 391 rows 391 cols
[2021-05-17 13:00:52] [INFO ] Computed 41 place invariants in 3 ms
[2021-05-17 13:00:52] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 588 ms to find 0 implicit places.
// Phase 1: matrix 391 rows 391 cols
[2021-05-17 13:00:52] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-17 13:00:53] [INFO ] Dead Transitions using invariants and state equation in 412 ms returned []
Finished structural reductions, in 1 iterations. Remains : 391/405 places, 391/405 transitions.
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-010B-09 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s286 1) (EQ s328 1) (EQ s354 1)), p1:(EQ s343 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 48203 steps with 55 reset in 166 ms.
FORMULA ShieldRVt-PT-010B-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-010B-09 finished in 1333 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 405 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 405/405 places, 405/405 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 113 transitions
Trivial Post-agglo rules discarded 113 transitions
Performed 113 trivial Post agglomeration. Transition count delta: 113
Iterating post reduction 0 with 113 rules applied. Total rules applied 113 place count 404 transition count 291
Reduce places removed 113 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 115 rules applied. Total rules applied 228 place count 291 transition count 289
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 229 place count 290 transition count 289
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 72 Pre rules applied. Total rules applied 229 place count 290 transition count 217
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 373 place count 218 transition count 217
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 384 place count 207 transition count 206
Iterating global reduction 3 with 11 rules applied. Total rules applied 395 place count 207 transition count 206
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 395 place count 207 transition count 197
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 413 place count 198 transition count 197
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 3 with 170 rules applied. Total rules applied 583 place count 113 transition count 112
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 639 place count 85 transition count 138
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 640 place count 84 transition count 137
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 641 place count 83 transition count 137
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 642 place count 82 transition count 136
Applied a total of 642 rules in 37 ms. Remains 82 /405 variables (removed 323) and now considering 136/405 (removed 269) transitions.
// Phase 1: matrix 136 rows 82 cols
[2021-05-17 13:00:53] [INFO ] Computed 40 place invariants in 1 ms
[2021-05-17 13:00:53] [INFO ] Implicit Places using invariants in 98 ms returned []
// Phase 1: matrix 136 rows 82 cols
[2021-05-17 13:00:53] [INFO ] Computed 40 place invariants in 0 ms
[2021-05-17 13:00:53] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
[2021-05-17 13:00:53] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 136 rows 82 cols
[2021-05-17 13:00:53] [INFO ] Computed 40 place invariants in 1 ms
[2021-05-17 13:00:54] [INFO ] Dead Transitions using invariants and state equation in 164 ms returned []
Finished structural reductions, in 1 iterations. Remains : 82/405 places, 136/405 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-010B-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-010B-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-010B-10 finished in 575 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)||X(F(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 405 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 405/405 places, 405/405 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 392 transition count 392
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 392 transition count 392
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 391 transition count 391
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 391 transition count 391
Applied a total of 28 rules in 16 ms. Remains 391 /405 variables (removed 14) and now considering 391/405 (removed 14) transitions.
// Phase 1: matrix 391 rows 391 cols
[2021-05-17 13:00:54] [INFO ] Computed 41 place invariants in 3 ms
[2021-05-17 13:00:54] [INFO ] Implicit Places using invariants in 124 ms returned []
// Phase 1: matrix 391 rows 391 cols
[2021-05-17 13:00:54] [INFO ] Computed 41 place invariants in 9 ms
[2021-05-17 13:00:54] [INFO ] Implicit Places using invariants and state equation in 472 ms returned []
Implicit Place search using SMT with State Equation took 600 ms to find 0 implicit places.
// Phase 1: matrix 391 rows 391 cols
[2021-05-17 13:00:54] [INFO ] Computed 41 place invariants in 2 ms
[2021-05-17 13:00:55] [INFO ] Dead Transitions using invariants and state equation in 337 ms returned []
Finished structural reductions, in 1 iterations. Remains : 391/405 places, 391/405 transitions.
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-010B-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s93 1), p1:(NEQ s106 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 294 ms.
Product exploration explored 100000 steps with 50000 reset in 339 ms.
Knowledge obtained : [(NOT p0), p1]
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 50000 reset in 291 ms.
Product exploration explored 100000 steps with 50000 reset in 292 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 391 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 391/391 places, 391/391 transitions.
Performed 109 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 109 rules applied. Total rules applied 109 place count 391 transition count 391
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 49 Pre rules applied. Total rules applied 109 place count 391 transition count 460
Deduced a syphon composed of 158 places in 0 ms
Iterating global reduction 1 with 49 rules applied. Total rules applied 158 place count 391 transition count 460
Performed 108 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 266 places in 0 ms
Iterating global reduction 1 with 108 rules applied. Total rules applied 266 place count 391 transition count 460
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 267 place count 391 transition count 459
Discarding 69 places :
Symmetric choice reduction at 2 with 69 rule applications. Total rules 336 place count 322 transition count 390
Deduced a syphon composed of 197 places in 0 ms
Iterating global reduction 2 with 69 rules applied. Total rules applied 405 place count 322 transition count 390
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 198 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 406 place count 322 transition count 390
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 408 place count 320 transition count 388
Deduced a syphon composed of 196 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 410 place count 320 transition count 388
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -238
Deduced a syphon composed of 225 places in 0 ms
Iterating global reduction 2 with 29 rules applied. Total rules applied 439 place count 320 transition count 626
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 468 place count 291 transition count 568
Deduced a syphon composed of 196 places in 0 ms
Iterating global reduction 2 with 29 rules applied. Total rules applied 497 place count 291 transition count 568
Deduced a syphon composed of 196 places in 0 ms
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 506 place count 291 transition count 559
Deduced a syphon composed of 196 places in 1 ms
Applied a total of 506 rules in 101 ms. Remains 291 /391 variables (removed 100) and now considering 559/391 (removed -168) transitions.
[2021-05-17 13:00:56] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 559 rows 291 cols
[2021-05-17 13:00:56] [INFO ] Computed 41 place invariants in 2 ms
[2021-05-17 13:00:57] [INFO ] Dead Transitions using invariants and state equation in 338 ms returned []
Finished structural reductions, in 1 iterations. Remains : 291/391 places, 559/391 transitions.
Product exploration explored 100000 steps with 50000 reset in 1551 ms.
Product exploration explored 100000 steps with 50000 reset in 1563 ms.
[2021-05-17 13:01:00] [INFO ] Flatten gal took : 22 ms
[2021-05-17 13:01:00] [INFO ] Flatten gal took : 19 ms
[2021-05-17 13:01:00] [INFO ] Time to serialize gal into /tmp/LTL6072651646271227674.gal : 3 ms
[2021-05-17 13:01:00] [INFO ] Time to serialize properties into /tmp/LTL16714678404498590855.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL6072651646271227674.gal, -t, CGAL, -LTL, /tmp/LTL16714678404498590855.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6072651646271227674.gal -t CGAL -LTL /tmp/LTL16714678404498590855.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F("(p115==1)"))||(X(F("(p132!=1)")))))
Formula 0 simplified : !(F"(p115==1)" | XF"(p132!=1)")
Detected timeout of ITS tools.
[2021-05-17 13:01:15] [INFO ] Flatten gal took : 16 ms
[2021-05-17 13:01:15] [INFO ] Applying decomposition
[2021-05-17 13:01:15] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph17133414546385178356.txt, -o, /tmp/graph17133414546385178356.bin, -w, /tmp/graph17133414546385178356.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph17133414546385178356.bin, -l, -1, -v, -w, /tmp/graph17133414546385178356.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 13:01:15] [INFO ] Decomposing Gal with order
[2021-05-17 13:01:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 13:01:15] [INFO ] Removed a total of 102 redundant transitions.
[2021-05-17 13:01:15] [INFO ] Flatten gal took : 45 ms
[2021-05-17 13:01:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2021-05-17 13:01:15] [INFO ] Time to serialize gal into /tmp/LTL10184794575200028024.gal : 8 ms
[2021-05-17 13:01:15] [INFO ] Time to serialize properties into /tmp/LTL6202634198560091359.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL10184794575200028024.gal, -t, CGAL, -LTL, /tmp/LTL6202634198560091359.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL10184794575200028024.gal -t CGAL -LTL /tmp/LTL6202634198560091359.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((F("(i4.u39.p115==1)"))||(X(F("(i5.i1.u42.p132!=1)")))))
Formula 0 simplified : !(F"(i4.u39.p115==1)" | XF"(i5.i1.u42.p132!=1)")
Reverse transition relation is NOT exact ! Due to transitions t366, t368, t370, t372, t375, t377, t379, t381, t383, i0.i1.t167, i0.i1.t171, i0.i2.t152, i0.i2.u91.t148, i1.i1.t355, i1.i1.u9.t359, i1.i2.t352, i1.i3.t339, i1.i3.u16.t343, i1.i4.t334, i1.i4.u17.t330, i1.i5.u4.t362, i2.i1.t313, i2.i1.t317, i2.i2.t302, i2.i2.u30.t308, i2.i3.t297, i2.i3.u32.t293, i3.t320, i3.u23.t324, i4.t282, i4.u37.t287, i5.i1.t275, i5.i1.t279, i5.i2.t265, i5.i2.u44.t270, i5.i3.t260, i5.i3.u47.t256, i6.t246, i6.u54.t250, i7.i1.t239, i7.i1.t243, i7.i2.u62.t221, i7.i2.u62.t225, i8.t230, i8.u60.t234, i9.i1.t204, i9.i1.t208, i9.i2.t194, i9.i2.u74.t199, i9.i3.t189, i9.i3.u76.t184, i10.t211, i10.u66.t215, i11.t174, i11.u81.t178, i12.t157, i12.u89.t162, i13.t137, i13.u97.t142, i14.i1.t130, i14.i1.t134, i14.i2.t120, i14.i2.u103.t125, i14.i3.t115, i14.i3.u106.t111, i15.i0.t101, i15.i0.u112.t105, i15.i1.t84, i15.i1.u119.t89, i16.i1.t94, i16.i1.t98, i16.i2.t79, i16.i2.u122.t75, i17.i1.t65, i17.i1.u127.t69, i17.i2.t58, i17.i2.t62, i17.i3.t44, i17.i3.u136.t40, i18.t49, i18.u133.t53, i19.i1.t22, i19.i1.t26, i19.i2.t13, i19.i2.u148.t17, i19.i3.t8, i19.i3.u151.t3, i20.t34, i20.t32, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/302/89/391
Computing Next relation with stutter on 1.6593e+07 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
145 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.50761,44984,1,0,50757,476,3835,119082,224,1212,68154
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldRVt-PT-010B-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ShieldRVt-PT-010B-11 finished in 23132 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((F(p1)&&p0))))], workingDir=/home/mcc/execution]
Support contains 3 out of 405 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 405/405 places, 405/405 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 393 transition count 393
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 393 transition count 393
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 392 transition count 392
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 392 transition count 392
Applied a total of 26 rules in 41 ms. Remains 392 /405 variables (removed 13) and now considering 392/405 (removed 13) transitions.
// Phase 1: matrix 392 rows 392 cols
[2021-05-17 13:01:17] [INFO ] Computed 41 place invariants in 2 ms
[2021-05-17 13:01:17] [INFO ] Implicit Places using invariants in 172 ms returned []
// Phase 1: matrix 392 rows 392 cols
[2021-05-17 13:01:17] [INFO ] Computed 41 place invariants in 8 ms
[2021-05-17 13:01:17] [INFO ] Implicit Places using invariants and state equation in 351 ms returned []
Implicit Place search using SMT with State Equation took 525 ms to find 0 implicit places.
// Phase 1: matrix 392 rows 392 cols
[2021-05-17 13:01:17] [INFO ] Computed 41 place invariants in 2 ms
[2021-05-17 13:01:18] [INFO ] Dead Transitions using invariants and state equation in 274 ms returned []
Finished structural reductions, in 1 iterations. Remains : 392/405 places, 392/405 transitions.
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-010B-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s270 1), p0:(AND (EQ s382 1) (EQ s391 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 99777 steps with 12 reset in 199 ms.
FORMULA ShieldRVt-PT-010B-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-010B-12 finished in 1152 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 405 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 405/405 places, 405/405 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 392 transition count 392
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 392 transition count 392
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 391 transition count 391
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 391 transition count 391
Applied a total of 28 rules in 41 ms. Remains 391 /405 variables (removed 14) and now considering 391/405 (removed 14) transitions.
// Phase 1: matrix 391 rows 391 cols
[2021-05-17 13:01:18] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-17 13:01:18] [INFO ] Implicit Places using invariants in 137 ms returned []
// Phase 1: matrix 391 rows 391 cols
[2021-05-17 13:01:18] [INFO ] Computed 41 place invariants in 2 ms
[2021-05-17 13:01:18] [INFO ] Implicit Places using invariants and state equation in 332 ms returned []
Implicit Place search using SMT with State Equation took 471 ms to find 0 implicit places.
// Phase 1: matrix 391 rows 391 cols
[2021-05-17 13:01:18] [INFO ] Computed 41 place invariants in 3 ms
[2021-05-17 13:01:19] [INFO ] Dead Transitions using invariants and state equation in 257 ms returned []
Finished structural reductions, in 1 iterations. Remains : 391/405 places, 391/405 transitions.
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-010B-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s63 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-010B-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-010B-13 finished in 886 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0 U p1)&&F(G(p2))))], workingDir=/home/mcc/execution]
Support contains 3 out of 405 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 405/405 places, 405/405 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 110 transitions
Trivial Post-agglo rules discarded 110 transitions
Performed 110 trivial Post agglomeration. Transition count delta: 110
Iterating post reduction 0 with 110 rules applied. Total rules applied 110 place count 404 transition count 294
Reduce places removed 110 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 112 rules applied. Total rules applied 222 place count 294 transition count 292
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 223 place count 293 transition count 292
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 73 Pre rules applied. Total rules applied 223 place count 293 transition count 219
Deduced a syphon composed of 73 places in 1 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 3 with 146 rules applied. Total rules applied 369 place count 220 transition count 219
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 379 place count 210 transition count 209
Iterating global reduction 3 with 10 rules applied. Total rules applied 389 place count 210 transition count 209
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 389 place count 210 transition count 200
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 407 place count 201 transition count 200
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 3 with 170 rules applied. Total rules applied 577 place count 116 transition count 115
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 631 place count 89 transition count 139
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 632 place count 88 transition count 138
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 633 place count 87 transition count 138
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 634 place count 86 transition count 137
Applied a total of 634 rules in 37 ms. Remains 86 /405 variables (removed 319) and now considering 137/405 (removed 268) transitions.
// Phase 1: matrix 137 rows 86 cols
[2021-05-17 13:01:19] [INFO ] Computed 40 place invariants in 1 ms
[2021-05-17 13:01:19] [INFO ] Implicit Places using invariants in 74 ms returned []
// Phase 1: matrix 137 rows 86 cols
[2021-05-17 13:01:19] [INFO ] Computed 40 place invariants in 1 ms
[2021-05-17 13:01:19] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-17 13:01:19] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
[2021-05-17 13:01:19] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 137 rows 86 cols
[2021-05-17 13:01:19] [INFO ] Computed 40 place invariants in 1 ms
[2021-05-17 13:01:19] [INFO ] Dead Transitions using invariants and state equation in 101 ms returned []
Finished structural reductions, in 1 iterations. Remains : 86/405 places, 137/405 transitions.
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : ShieldRVt-PT-010B-14 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(OR p1 p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s43 1), p0:(EQ s73 0), p2:(EQ s17 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-010B-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-010B-14 finished in 509 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 405 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 405/405 places, 405/405 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 113 transitions
Trivial Post-agglo rules discarded 113 transitions
Performed 113 trivial Post agglomeration. Transition count delta: 113
Iterating post reduction 0 with 113 rules applied. Total rules applied 113 place count 404 transition count 291
Reduce places removed 113 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 115 rules applied. Total rules applied 228 place count 291 transition count 289
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 230 place count 290 transition count 288
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 231 place count 289 transition count 288
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 73 Pre rules applied. Total rules applied 231 place count 289 transition count 215
Deduced a syphon composed of 73 places in 1 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 4 with 146 rules applied. Total rules applied 377 place count 216 transition count 215
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 387 place count 206 transition count 205
Iterating global reduction 4 with 10 rules applied. Total rules applied 397 place count 206 transition count 205
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 397 place count 206 transition count 197
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 413 place count 198 transition count 197
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 84
Deduced a syphon composed of 84 places in 0 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 4 with 168 rules applied. Total rules applied 581 place count 114 transition count 113
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 639 place count 85 transition count 141
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 640 place count 84 transition count 140
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 641 place count 83 transition count 140
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 642 place count 82 transition count 139
Applied a total of 642 rules in 63 ms. Remains 82 /405 variables (removed 323) and now considering 139/405 (removed 266) transitions.
// Phase 1: matrix 139 rows 82 cols
[2021-05-17 13:01:19] [INFO ] Computed 40 place invariants in 1 ms
[2021-05-17 13:01:19] [INFO ] Implicit Places using invariants in 84 ms returned []
// Phase 1: matrix 139 rows 82 cols
[2021-05-17 13:01:19] [INFO ] Computed 40 place invariants in 1 ms
[2021-05-17 13:01:20] [INFO ] State equation strengthened by 8 read => feed constraints.
[2021-05-17 13:01:20] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
[2021-05-17 13:01:20] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 139 rows 82 cols
[2021-05-17 13:01:20] [INFO ] Computed 40 place invariants in 0 ms
[2021-05-17 13:01:20] [INFO ] Dead Transitions using invariants and state equation in 108 ms returned []
Finished structural reductions, in 1 iterations. Remains : 82/405 places, 139/405 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-010B-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s63 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-010B-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-010B-15 finished in 531 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621256481490

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ShieldRVt-PT-010B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r235-smll-162106564700269"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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