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.r102-smll-162075331100132.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 FlexibleBarrier-PT-20a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r102-smll-162075331100132
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 760K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 138K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 119K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 23 11:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 23 11:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 22 19:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 22 19:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 321K May 5 16:51 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 FlexibleBarrier-PT-20a-00
FORMULA_NAME FlexibleBarrier-PT-20a-01
FORMULA_NAME FlexibleBarrier-PT-20a-02
FORMULA_NAME FlexibleBarrier-PT-20a-03
FORMULA_NAME FlexibleBarrier-PT-20a-04
FORMULA_NAME FlexibleBarrier-PT-20a-05
FORMULA_NAME FlexibleBarrier-PT-20a-06
FORMULA_NAME FlexibleBarrier-PT-20a-07
FORMULA_NAME FlexibleBarrier-PT-20a-08
FORMULA_NAME FlexibleBarrier-PT-20a-09
FORMULA_NAME FlexibleBarrier-PT-20a-10
FORMULA_NAME FlexibleBarrier-PT-20a-11
FORMULA_NAME FlexibleBarrier-PT-20a-12
FORMULA_NAME FlexibleBarrier-PT-20a-13
FORMULA_NAME FlexibleBarrier-PT-20a-14
FORMULA_NAME FlexibleBarrier-PT-20a-15

=== Now, execution of the tool begins

BK_START 1621174300417

Running Version 0
[2021-05-16 14:11:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-16 14:11:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 14:11:43] [INFO ] Load time of PNML (sax parser for PT used): 250 ms
[2021-05-16 14:11:43] [INFO ] Transformed 243 places.
[2021-05-16 14:11:43] [INFO ] Transformed 1064 transitions.
[2021-05-16 14:11:43] [INFO ] Found NUPN structural information;
[2021-05-16 14:11:43] [INFO ] Parsed PT model containing 243 places and 1064 transitions in 353 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
[2021-05-16 14:11:43] [INFO ] Initial state test concluded for 4 properties.
Ensure Unique test removed 362 transitions
Reduce redundant transitions removed 362 transitions.
FORMULA FlexibleBarrier-PT-20a-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-20a-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-20a-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-20a-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 243 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 243/243 places, 702/702 transitions.
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 243 transition count 682
Applied a total of 20 rules in 95 ms. Remains 243 /243 variables (removed 0) and now considering 682/702 (removed 20) transitions.
// Phase 1: matrix 682 rows 243 cols
[2021-05-16 14:11:44] [INFO ] Computed 22 place invariants in 29 ms
[2021-05-16 14:11:45] [INFO ] Implicit Places using invariants in 1020 ms returned [241, 242]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1082 ms to find 2 implicit places.
// Phase 1: matrix 682 rows 241 cols
[2021-05-16 14:11:45] [INFO ] Computed 20 place invariants in 8 ms
[2021-05-16 14:11:45] [INFO ] Dead Transitions using invariants and state equation in 471 ms returned []
Starting structural reductions, iteration 1 : 241/243 places, 682/702 transitions.
Applied a total of 0 rules in 15 ms. Remains 241 /241 variables (removed 0) and now considering 682/682 (removed 0) transitions.
// Phase 1: matrix 682 rows 241 cols
[2021-05-16 14:11:45] [INFO ] Computed 20 place invariants in 10 ms
[2021-05-16 14:11:46] [INFO ] Dead Transitions using invariants and state equation in 505 ms returned []
Finished structural reductions, in 2 iterations. Remains : 241/243 places, 682/702 transitions.
[2021-05-16 14:11:46] [INFO ] Initial state reduction rules for LTL removed 4 formulas.
[2021-05-16 14:11:46] [INFO ] Flatten gal took : 125 ms
FORMULA FlexibleBarrier-PT-20a-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-20a-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-20a-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-20a-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 14:11:46] [INFO ] Flatten gal took : 58 ms
[2021-05-16 14:11:46] [INFO ] Input system was already deterministic with 682 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 872 ms. (steps per millisecond=114 ) properties (out of 18) seen :17
Running SMT prover for 1 properties.
// Phase 1: matrix 682 rows 241 cols
[2021-05-16 14:11:47] [INFO ] Computed 20 place invariants in 3 ms
[2021-05-16 14:11:47] [INFO ] [Real]Absence check using 20 positive place invariants in 10 ms returned sat
[2021-05-16 14:11:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:11:48] [INFO ] [Real]Absence check using state equation in 190 ms returned sat
[2021-05-16 14:11:48] [INFO ] Solution in real domain found non-integer solution.
Successfully simplified 1 atomic propositions for a total of 8 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((G((X(p0) U ((X(p0)&&G(p1))||X(G(p0)))))||(F(p2)&&(X(p0) U ((X(p0)&&G(p1))||X(G(p0)))))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 241 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 241/241 places, 682/682 transitions.
Applied a total of 0 rules in 9 ms. Remains 241 /241 variables (removed 0) and now considering 682/682 (removed 0) transitions.
// Phase 1: matrix 682 rows 241 cols
[2021-05-16 14:11:48] [INFO ] Computed 20 place invariants in 3 ms
[2021-05-16 14:11:48] [INFO ] Implicit Places using invariants in 97 ms returned []
// Phase 1: matrix 682 rows 241 cols
[2021-05-16 14:11:48] [INFO ] Computed 20 place invariants in 5 ms
[2021-05-16 14:11:48] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
// Phase 1: matrix 682 rows 241 cols
[2021-05-16 14:11:48] [INFO ] Computed 20 place invariants in 7 ms
[2021-05-16 14:11:49] [INFO ] Dead Transitions using invariants and state equation in 733 ms returned []
Finished structural reductions, in 1 iterations. Remains : 241/241 places, 682/682 transitions.
Stuttering acceptance computed with spot in 457 ms :[(NOT p0), (AND (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-20a-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=2 dest: 3}, { cond=(AND p1 p0), acceptance={0} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={1} source=2 dest: 4}, { cond=(AND p1 p0), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={1} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=4 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={1} source=4 dest: 4}, { cond=(AND p1 p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(NEQ s73 1), p1:(AND (NEQ s41 0) (NEQ s1 1)), p0:(NEQ s208 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 89 reset in 1303 ms.
Stack based approach found an accepted trace after 6875 steps with 6 reset with depth 1227 and stack size 1207 in 55 ms.
FORMULA FlexibleBarrier-PT-20a-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20a-01 finished in 3110 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 241 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 241/241 places, 682/682 transitions.
Graph (trivial) has 314 edges and 241 vertex of which 234 / 241 are part of one of the 20 SCC in 13 ms
Free SCC test removed 214 places
Ensure Unique test removed 461 transitions
Reduce isomorphic transitions removed 461 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 206 transitions
Reduce isomorphic transitions removed 206 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 225 rules applied. Total rules applied 226 place count 8 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 227 place count 7 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 227 place count 7 transition count 12
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 229 place count 6 transition count 12
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 232 place count 6 transition count 9
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 236 place count 4 transition count 7
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 238 place count 4 transition count 5
Applied a total of 238 rules in 53 ms. Remains 4 /241 variables (removed 237) and now considering 5/682 (removed 677) transitions.
// Phase 1: matrix 5 rows 4 cols
[2021-05-16 14:11:51] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-16 14:11:51] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2021-05-16 14:11:51] [INFO ] Computed 2 place invariants in 7 ms
[2021-05-16 14:11:51] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
[2021-05-16 14:11:51] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2021-05-16 14:11:51] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-16 14:11:51] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/241 places, 5/682 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-20a-05 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:(AND (NEQ s0 0) (NEQ s2 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 FlexibleBarrier-PT-20a-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20a-05 finished in 458 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0 U (p1||G(p0))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 241 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 241/241 places, 682/682 transitions.
Applied a total of 0 rules in 17 ms. Remains 241 /241 variables (removed 0) and now considering 682/682 (removed 0) transitions.
// Phase 1: matrix 682 rows 241 cols
[2021-05-16 14:11:51] [INFO ] Computed 20 place invariants in 7 ms
[2021-05-16 14:11:51] [INFO ] Implicit Places using invariants in 93 ms returned []
// Phase 1: matrix 682 rows 241 cols
[2021-05-16 14:11:51] [INFO ] Computed 20 place invariants in 3 ms
[2021-05-16 14:11:52] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 412 ms to find 0 implicit places.
// Phase 1: matrix 682 rows 241 cols
[2021-05-16 14:11:52] [INFO ] Computed 20 place invariants in 3 ms
[2021-05-16 14:11:52] [INFO ] Dead Transitions using invariants and state equation in 513 ms returned []
Finished structural reductions, in 1 iterations. Remains : 241/241 places, 682/682 transitions.
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-20a-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NEQ s223 0) (NEQ s178 1) (OR (NEQ s178 0) (NEQ s223 1) (AND (NEQ s72 0) (NEQ s118 1)))), p0:(OR (NEQ s178 0) (NEQ s223 1) (AND (NEQ s72 0) (NEQ s118 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 71 reset in 846 ms.
Stack based approach found an accepted trace after 4017 steps with 4 reset with depth 513 and stack size 508 in 33 ms.
FORMULA FlexibleBarrier-PT-20a-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20a-07 finished in 1952 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 241 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 241/241 places, 682/682 transitions.
Graph (trivial) has 314 edges and 241 vertex of which 232 / 241 are part of one of the 24 SCC in 2 ms
Free SCC test removed 208 places
Ensure Unique test removed 451 transitions
Reduce isomorphic transitions removed 451 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 206 transitions
Reduce isomorphic transitions removed 206 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 226 rules applied. Total rules applied 227 place count 14 transition count 22
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 229 place count 12 transition count 22
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 230 place count 11 transition count 20
Iterating global reduction 2 with 1 rules applied. Total rules applied 231 place count 11 transition count 20
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 2 with 2 rules applied. Total rules applied 233 place count 11 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 234 place count 10 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 236 place count 9 transition count 17
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 242 place count 9 transition count 11
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 243 place count 9 transition count 10
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 245 place count 8 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 246 place count 7 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 246 place count 7 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 248 place count 6 transition count 8
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 249 place count 5 transition count 7
Iterating global reduction 7 with 1 rules applied. Total rules applied 250 place count 5 transition count 7
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 251 place count 5 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 251 place count 5 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 253 place count 4 transition count 5
Applied a total of 253 rules in 21 ms. Remains 4 /241 variables (removed 237) and now considering 5/682 (removed 677) transitions.
// Phase 1: matrix 5 rows 4 cols
[2021-05-16 14:11:53] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-16 14:11:53] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2021-05-16 14:11:53] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-16 14:11:53] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
[2021-05-16 14:11:53] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2021-05-16 14:11:53] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-16 14:11:53] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/241 places, 5/682 transitions.
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-20a-08 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}]], initial=1, aps=[p0:(OR (EQ s2 0) (EQ s0 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-20a-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20a-08 finished in 172 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0) U X(X(G(((G(p3)&&p2)||p1))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 241 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 241/241 places, 682/682 transitions.
Applied a total of 0 rules in 10 ms. Remains 241 /241 variables (removed 0) and now considering 682/682 (removed 0) transitions.
// Phase 1: matrix 682 rows 241 cols
[2021-05-16 14:11:54] [INFO ] Computed 20 place invariants in 4 ms
[2021-05-16 14:11:54] [INFO ] Implicit Places using invariants in 166 ms returned []
// Phase 1: matrix 682 rows 241 cols
[2021-05-16 14:11:54] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-16 14:11:54] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 417 ms to find 0 implicit places.
// Phase 1: matrix 682 rows 241 cols
[2021-05-16 14:11:54] [INFO ] Computed 20 place invariants in 3 ms
[2021-05-16 14:11:54] [INFO ] Dead Transitions using invariants and state equation in 441 ms returned []
Finished structural reductions, in 1 iterations. Remains : 241/241 places, 682/682 transitions.
Stuttering acceptance computed with spot in 557 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), true, (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : FlexibleBarrier-PT-20a-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 5}], [{ cond=(OR p1 (AND p2 p3)), acceptance={} source=2 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p2 p3), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0, 1} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={} source=4 dest: 3}, { cond=p3, acceptance={} source=4 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2 p3), acceptance={} source=5 dest: 4}, { cond=(OR (AND p0 (NOT p1) (NOT p2)) (AND p0 (NOT p1) (NOT p3))), acceptance={} source=5 dest: 7}, { cond=(AND p0 (NOT p1) p2 p3), acceptance={} source=5 dest: 8}], [{ cond=(NOT p0), acceptance={} source=6 dest: 0}, { cond=p0, acceptance={} source=6 dest: 1}, { cond=(OR (AND p0 (NOT p1) (NOT p2)) (AND p0 (NOT p1) (NOT p3))), acceptance={0, 1} source=6 dest: 6}, { cond=(OR (AND p0 p1) (AND p0 p2 p3)), acceptance={0} source=6 dest: 6}, { cond=(AND p0 (NOT p1) p2 p3), acceptance={1} source=6 dest: 12}], [{ cond=(NOT p0), acceptance={} source=7 dest: 3}, { cond=p0, acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=8 dest: 3}, { cond=(AND (NOT p0) p3), acceptance={} source=8 dest: 4}, { cond=(AND p0 (NOT p3)), acceptance={} source=8 dest: 7}, { cond=(AND p0 p3), acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=9 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p3), acceptance={} source=9 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=9 dest: 7}, { cond=(AND p0 (NOT p1) p3), acceptance={} source=9 dest: 8}], [{ cond=(AND p1 (NOT p3)), acceptance={} source=10 dest: 2}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=10 dest: 3}, { cond=(AND (NOT p1) p3), acceptance={} source=10 dest: 4}, { cond=(AND p1 p3), acceptance={} source=10 dest: 10}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=11 dest: 2}, { cond=(AND p0 (NOT p3)), acceptance={} source=11 dest: 5}, { cond=(AND p0 p3), acceptance={} source=11 dest: 9}, { cond=(AND (NOT p0) p3), acceptance={} source=11 dest: 10}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=12 dest: 0}, { cond=(AND p0 (NOT p3)), acceptance={} source=12 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={0, 1} source=12 dest: 6}, { cond=(AND p0 p1 (NOT p3)), acceptance={0} source=12 dest: 6}, { cond=(AND p0 p3), acceptance={} source=12 dest: 11}, { cond=(AND p0 (NOT p1) p3), acceptance={1} source=12 dest: 12}, { cond=(AND p0 p1 p3), acceptance={} source=12 dest: 12}, { cond=(AND (NOT p0) p3), acceptance={} source=12 dest: 13}], [{ cond=(NOT p3), acceptance={} source=13 dest: 2}, { cond=p3, acceptance={} source=13 dest: 10}]], initial=6, aps=[p0:(OR (EQ s58 0) (EQ s142 1)), p1:(OR (EQ s155 0) (EQ s9 1)), p2:(AND (EQ s142 0) (EQ s58 1)), p3:(OR (EQ s31 0) (EQ s10 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 195 steps with 19 reset in 17 ms.
FORMULA FlexibleBarrier-PT-20a-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20a-10 finished in 1488 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((X((X(p2)&&p1))||p0))))], workingDir=/home/mcc/execution]
Support contains 5 out of 241 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 241/241 places, 682/682 transitions.
Applied a total of 0 rules in 5 ms. Remains 241 /241 variables (removed 0) and now considering 682/682 (removed 0) transitions.
// Phase 1: matrix 682 rows 241 cols
[2021-05-16 14:11:55] [INFO ] Computed 20 place invariants in 2 ms
[2021-05-16 14:11:55] [INFO ] Implicit Places using invariants in 65 ms returned []
// Phase 1: matrix 682 rows 241 cols
[2021-05-16 14:11:55] [INFO ] Computed 20 place invariants in 2 ms
[2021-05-16 14:11:55] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 391 ms to find 0 implicit places.
// Phase 1: matrix 682 rows 241 cols
[2021-05-16 14:11:55] [INFO ] Computed 20 place invariants in 3 ms
[2021-05-16 14:11:56] [INFO ] Dead Transitions using invariants and state equation in 400 ms returned []
Finished structural reductions, in 1 iterations. Remains : 241/241 places, 682/682 transitions.
Stuttering acceptance computed with spot in 146 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : FlexibleBarrier-PT-20a-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s123 0) (EQ s56 1)), p1:(AND (NEQ s182 0) (NEQ s165 1)), p2:(NEQ s126 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1678 ms.
Product exploration explored 100000 steps with 50000 reset in 1336 ms.
Knowledge obtained : [p0, (NOT p1), p2]
Stuttering acceptance computed with spot in 229 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Product exploration explored 100000 steps with 50000 reset in 1625 ms.
Product exploration explored 100000 steps with 50000 reset in 1530 ms.
[2021-05-16 14:12:03] [INFO ] Flatten gal took : 46 ms
[2021-05-16 14:12:03] [INFO ] Flatten gal took : 42 ms
[2021-05-16 14:12:03] [INFO ] Time to serialize gal into /tmp/LTL11029381136762408520.gal : 23 ms
[2021-05-16 14:12:03] [INFO ] Time to serialize properties into /tmp/LTL17378543776233950574.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/LTL11029381136762408520.gal, -t, CGAL, -LTL, /tmp/LTL17378543776233950574.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/LTL11029381136762408520.gal -t CGAL -LTL /tmp/LTL17378543776233950574.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F(("((p123==0)||(p56==1))")||(X(("((p182==1)&&(p165==0))")&&(X("(p126==0)"))))))))
Formula 0 simplified : !XF("((p123==0)||(p56==1))" | X("((p182==1)&&(p165==0))" & X"(p126==0)"))
Detected timeout of ITS tools.
[2021-05-16 14:12:18] [INFO ] Flatten gal took : 38 ms
[2021-05-16 14:12:18] [INFO ] Applying decomposition
[2021-05-16 14:12:18] [INFO ] Flatten gal took : 58 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/graph8181811784774399011.txt, -o, /tmp/graph8181811784774399011.bin, -w, /tmp/graph8181811784774399011.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/graph8181811784774399011.bin, -l, -1, -v, -w, /tmp/graph8181811784774399011.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 14:12:18] [INFO ] Decomposing Gal with order
[2021-05-16 14:12:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 14:12:18] [INFO ] Removed a total of 720 redundant transitions.
[2021-05-16 14:12:19] [INFO ] Flatten gal took : 122 ms
[2021-05-16 14:12:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2021-05-16 14:12:19] [INFO ] Time to serialize gal into /tmp/LTL13959261522797242984.gal : 10 ms
[2021-05-16 14:12:19] [INFO ] Time to serialize properties into /tmp/LTL2843249005888328054.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/LTL13959261522797242984.gal, -t, CGAL, -LTL, /tmp/LTL2843249005888328054.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/LTL13959261522797242984.gal -t CGAL -LTL /tmp/LTL2843249005888328054.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F(("((i10.u50.p123==0)||(i4.u22.p56==1))")||(X(("((i15.u74.p182==1)&&(i13.u67.p165==0))")&&(X("(i10.u51.p126==0)"))))))))
Formula 0 simplified : !XF("((i10.u50.p123==0)||(i4.u22.p56==1))" | X("((i15.u74.p182==1)&&(i13.u67.p165==0))" & X"(i10.u51.p126==0)"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
7 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,0.131263,19268,1,0,505,314,1894,296,130,333,1519
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA FlexibleBarrier-PT-20a-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property FlexibleBarrier-PT-20a-12 finished in 23735 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0&&X(X(p0)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 241 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 241/241 places, 682/682 transitions.
Applied a total of 0 rules in 4 ms. Remains 241 /241 variables (removed 0) and now considering 682/682 (removed 0) transitions.
// Phase 1: matrix 682 rows 241 cols
[2021-05-16 14:12:19] [INFO ] Computed 20 place invariants in 2 ms
[2021-05-16 14:12:19] [INFO ] Implicit Places using invariants in 92 ms returned []
// Phase 1: matrix 682 rows 241 cols
[2021-05-16 14:12:19] [INFO ] Computed 20 place invariants in 3 ms
[2021-05-16 14:12:19] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
// Phase 1: matrix 682 rows 241 cols
[2021-05-16 14:12:19] [INFO ] Computed 20 place invariants in 4 ms
[2021-05-16 14:12:20] [INFO ] Dead Transitions using invariants and state equation in 528 ms returned []
Finished structural reductions, in 1 iterations. Remains : 241/241 places, 682/682 transitions.
Stuttering acceptance computed with spot in 44 ms :[true, (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-20a-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}]], initial=1, aps=[p0:(OR (EQ s102 0) (EQ s224 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][false, false]]
Entered a terminal (fully accepting) state of product in 617 steps with 0 reset in 5 ms.
FORMULA FlexibleBarrier-PT-20a-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20a-13 finished in 1039 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 1 out of 241 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 241/241 places, 682/682 transitions.
Graph (trivial) has 317 edges and 241 vertex of which 233 / 241 are part of one of the 21 SCC in 1 ms
Free SCC test removed 212 places
Ensure Unique test removed 441 transitions
Reduce isomorphic transitions removed 441 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 29 transition count 239
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 27 transition count 239
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 6 place count 26 transition count 237
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 26 transition count 237
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 2 with 2 rules applied. Total rules applied 9 place count 26 transition count 235
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 10 place count 25 transition count 235
Drop transitions removed 171 transitions
Redundant transition composition rules discarded 171 transitions
Iterating global reduction 4 with 171 rules applied. Total rules applied 181 place count 25 transition count 64
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 197 place count 9 transition count 16
Iterating global reduction 4 with 16 rules applied. Total rules applied 213 place count 9 transition count 16
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 214 place count 9 transition count 16
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 215 place count 8 transition count 15
Iterating global reduction 4 with 1 rules applied. Total rules applied 216 place count 8 transition count 15
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 217 place count 8 transition count 14
Applied a total of 217 rules in 27 ms. Remains 8 /241 variables (removed 233) and now considering 14/682 (removed 668) transitions.
[2021-05-16 14:12:20] [INFO ] Flow matrix only has 7 transitions (discarded 7 similar events)
// Phase 1: matrix 7 rows 8 cols
[2021-05-16 14:12:20] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-16 14:12:20] [INFO ] Implicit Places using invariants in 12 ms returned []
[2021-05-16 14:12:20] [INFO ] Flow matrix only has 7 transitions (discarded 7 similar events)
// Phase 1: matrix 7 rows 8 cols
[2021-05-16 14:12:20] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-16 14:12:20] [INFO ] State equation strengthened by 3 read => feed constraints.
[2021-05-16 14:12:20] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
[2021-05-16 14:12:20] [INFO ] Redundant transitions in 9 ms returned [4, 5, 8]
Found 3 redundant transitions using SMT.
Drop transitions removed 3 transitions
Redundant transitions reduction (with SMT) removed 3 transitions :[8, 5, 4]
[2021-05-16 14:12:20] [INFO ] Flow matrix only has 7 transitions (discarded 4 similar events)
// Phase 1: matrix 7 rows 8 cols
[2021-05-16 14:12:20] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-16 14:12:20] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Starting structural reductions, iteration 1 : 8/241 places, 11/682 transitions.
Applied a total of 0 rules in 2 ms. Remains 8 /8 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2021-05-16 14:12:20] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-16 14:12:20] [INFO ] Flow matrix only has 7 transitions (discarded 4 similar events)
// Phase 1: matrix 7 rows 8 cols
[2021-05-16 14:12:20] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-16 14:12:20] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 2 iterations. Remains : 8/241 places, 11/682 transitions.
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-20a-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s5 1), p1:(NEQ s5 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 6 steps with 2 reset in 0 ms.
FORMULA FlexibleBarrier-PT-20a-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20a-14 finished in 283 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621174341507

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -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 LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/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="FlexibleBarrier-PT-20a"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is FlexibleBarrier-PT-20a, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r102-smll-162075331100132"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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