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.r007-tall-162037990300641.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 BART-PT-050, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-tall-162037990300641
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 12M
-rw-r--r-- 1 mcc users 4.2K Mar 20 13:27 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 20 13:27 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.2K Jun 8 09:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Jun 8 09:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Jun 8 09:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 8 09:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 8 09:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Jun 8 09:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Jun 8 09:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 8 09:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 8 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 8 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 20 13:27 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 20 13:27 instance
-rw-r--r-- 1 mcc users 6 Mar 20 13:27 iscolored
-rw-r--r-- 1 mcc users 12M Mar 20 13:27 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 BART-PT-050-00
FORMULA_NAME BART-PT-050-01
FORMULA_NAME BART-PT-050-02
FORMULA_NAME BART-PT-050-03
FORMULA_NAME BART-PT-050-04
FORMULA_NAME BART-PT-050-05
FORMULA_NAME BART-PT-050-06
FORMULA_NAME BART-PT-050-07
FORMULA_NAME BART-PT-050-08
FORMULA_NAME BART-PT-050-09
FORMULA_NAME BART-PT-050-10
FORMULA_NAME BART-PT-050-11
FORMULA_NAME BART-PT-050-12
FORMULA_NAME BART-PT-050-13
FORMULA_NAME BART-PT-050-14
FORMULA_NAME BART-PT-050-15

=== Now, execution of the tool begins

BK_START 1623177446082

Running Version 0
[2021-06-08 18:37:27] [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-06-08 18:37:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-06-08 18:37:28] [INFO ] Load time of PNML (sax parser for PT used): 457 ms
[2021-06-08 18:37:28] [INFO ] Transformed 6810 places.
[2021-06-08 18:37:28] [INFO ] Transformed 10100 transitions.
[2021-06-08 18:37:28] [INFO ] Found NUPN structural information;
[2021-06-08 18:37:28] [INFO ] Parsed PT model containing 6810 places and 10100 transitions in 590 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 29 ms.
Working with output stream class java.io.PrintStream
[2021-06-08 18:37:28] [INFO ] Initial state test concluded for 5 properties.
Reduce places removed 210 places and 0 transitions.
FORMULA BART-PT-050-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-050-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-050-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-050-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-050-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-050-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 6600 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 6600/6600 places, 10100/10100 transitions.
Discarding 1584 places :
Symmetric choice reduction at 0 with 1584 rule applications. Total rules 1584 place count 5016 transition count 8516
Iterating global reduction 0 with 1584 rules applied. Total rules applied 3168 place count 5016 transition count 8516
Discarding 1329 places :
Symmetric choice reduction at 0 with 1329 rule applications. Total rules 4497 place count 3687 transition count 7187
Iterating global reduction 0 with 1329 rules applied. Total rules applied 5826 place count 3687 transition count 7187
Discarding 198 places :
Symmetric choice reduction at 0 with 198 rule applications. Total rules 6024 place count 3489 transition count 6989
Iterating global reduction 0 with 198 rules applied. Total rules applied 6222 place count 3489 transition count 6989
Discarding 147 places :
Symmetric choice reduction at 0 with 147 rule applications. Total rules 6369 place count 3342 transition count 6842
Iterating global reduction 0 with 147 rules applied. Total rules applied 6516 place count 3342 transition count 6842
Discarding 145 places :
Symmetric choice reduction at 0 with 145 rule applications. Total rules 6661 place count 3197 transition count 6697
Iterating global reduction 0 with 145 rules applied. Total rules applied 6806 place count 3197 transition count 6697
Discarding 145 places :
Symmetric choice reduction at 0 with 145 rule applications. Total rules 6951 place count 3052 transition count 6552
Iterating global reduction 0 with 145 rules applied. Total rules applied 7096 place count 3052 transition count 6552
Discarding 144 places :
Symmetric choice reduction at 0 with 144 rule applications. Total rules 7240 place count 2908 transition count 6408
Iterating global reduction 0 with 144 rules applied. Total rules applied 7384 place count 2908 transition count 6408
Discarding 142 places :
Symmetric choice reduction at 0 with 142 rule applications. Total rules 7526 place count 2766 transition count 6266
Iterating global reduction 0 with 142 rules applied. Total rules applied 7668 place count 2766 transition count 6266
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 7764 place count 2670 transition count 6170
Iterating global reduction 0 with 96 rules applied. Total rules applied 7860 place count 2670 transition count 6170
Discarding 91 places :
Symmetric choice reduction at 0 with 91 rule applications. Total rules 7951 place count 2579 transition count 6079
Iterating global reduction 0 with 91 rules applied. Total rules applied 8042 place count 2579 transition count 6079
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 8091 place count 2530 transition count 6030
Iterating global reduction 0 with 49 rules applied. Total rules applied 8140 place count 2530 transition count 6030
Applied a total of 8140 rules in 4610 ms. Remains 2530 /6600 variables (removed 4070) and now considering 6030/10100 (removed 4070) transitions.
// Phase 1: matrix 6030 rows 2530 cols
[2021-06-08 18:37:33] [INFO ] Computed 50 place invariants in 48 ms
[2021-06-08 18:37:33] [INFO ] Implicit Places using invariants in 495 ms returned []
// Phase 1: matrix 6030 rows 2530 cols
[2021-06-08 18:37:33] [INFO ] Computed 50 place invariants in 20 ms
[2021-06-08 18:37:34] [INFO ] Implicit Places using invariants and state equation in 933 ms returned []
Implicit Place search using SMT with State Equation took 1453 ms to find 0 implicit places.
// Phase 1: matrix 6030 rows 2530 cols
[2021-06-08 18:37:34] [INFO ] Computed 50 place invariants in 24 ms
[2021-06-08 18:37:37] [INFO ] Dead Transitions using invariants and state equation in 2680 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2530/6600 places, 6030/10100 transitions.
[2021-06-08 18:37:37] [INFO ] Flatten gal took : 312 ms
[2021-06-08 18:37:38] [INFO ] Flatten gal took : 213 ms
[2021-06-08 18:37:38] [INFO ] Input system was already deterministic with 6030 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 990 ms. (steps per millisecond=101 ) properties (out of 24) seen :19
Running SMT prover for 5 properties.
// Phase 1: matrix 6030 rows 2530 cols
[2021-06-08 18:37:39] [INFO ] Computed 50 place invariants in 22 ms
[2021-06-08 18:37:39] [INFO ] SMT Verify possible in real domain returnedunsat :1 sat :0 real:4
[2021-06-08 18:37:40] [INFO ] [Nat]Absence check using 50 positive place invariants in 36 ms returned sat
[2021-06-08 18:37:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-08 18:37:42] [INFO ] [Nat]Absence check using state equation in 1639 ms returned unsat :3 sat :2
Attempting to minimize the solution found.
Minimization took 148 ms.
[2021-06-08 18:37:42] [INFO ] SMT Verify possible in nat domain returned unsat :3 sat :2
Successfully simplified 4 atomic propositions for a total of 10 simplifications.
[2021-06-08 18:37:42] [INFO ] Initial state test concluded for 2 properties.
FORMULA BART-PT-050-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-050-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 2530 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2530/2530 places, 6030/6030 transitions.
Graph (trivial) has 6024 edges and 2530 vertex of which 2527 / 2530 are part of one of the 50 SCC in 15 ms
Free SCC test removed 2477 places
Ensure Unique test removed 5975 transitions
Reduce isomorphic transitions removed 5975 transitions.
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 5 transition count 8
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 50 place count 5 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 50 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 1 with 2 rules applied. Total rules applied 52 place count 4 transition count 5
Applied a total of 52 rules in 38 ms. Remains 4 /2530 variables (removed 2526) and now considering 5/6030 (removed 6025) transitions.
// Phase 1: matrix 5 rows 4 cols
[2021-06-08 18:37:42] [INFO ] Computed 2 place invariants in 0 ms
[2021-06-08 18:37:42] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2021-06-08 18:37:42] [INFO ] Computed 2 place invariants in 1 ms
[2021-06-08 18:37:42] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 26 ms to find 0 implicit places.
[2021-06-08 18:37:42] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2021-06-08 18:37:42] [INFO ] Computed 2 place invariants in 0 ms
[2021-06-08 18:37:42] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/2530 places, 5/6030 transitions.
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p0)]
Running random walk in product with property : BART-PT-050-00 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 s1 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 16 steps with 0 reset in 1 ms.
FORMULA BART-PT-050-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-050-00 finished in 325 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U G(p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 2530 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2530/2530 places, 6030/6030 transitions.
Graph (trivial) has 6024 edges and 2530 vertex of which 2520 / 2530 are part of one of the 50 SCC in 10 ms
Free SCC test removed 2470 places
Ensure Unique test removed 5964 transitions
Reduce isomorphic transitions removed 5964 transitions.
Reduce places removed 47 places and 0 transitions.
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 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 48 rules applied. Total rules applied 49 place count 13 transition count 18
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 6 rules applied. Total rules applied 55 place count 11 transition count 14
Reduce places removed 2 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 2 with 4 rules applied. Total rules applied 59 place count 9 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 60 place count 8 transition count 12
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 63 place count 8 transition count 9
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 63 place count 8 transition count 7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 67 place count 6 transition count 7
Applied a total of 67 rules in 28 ms. Remains 6 /2530 variables (removed 2524) and now considering 7/6030 (removed 6023) transitions.
// Phase 1: matrix 7 rows 6 cols
[2021-06-08 18:37:42] [INFO ] Computed 3 place invariants in 1 ms
[2021-06-08 18:37:42] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 7 rows 6 cols
[2021-06-08 18:37:42] [INFO ] Computed 3 place invariants in 1 ms
[2021-06-08 18:37:42] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2021-06-08 18:37:42] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 6 cols
[2021-06-08 18:37:42] [INFO ] Computed 3 place invariants in 1 ms
[2021-06-08 18:37:42] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 6/2530 places, 7/6030 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : BART-PT-050-01 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s2 1), p0:(OR (EQ s1 0) (EQ s0 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BART-PT-050-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-050-01 finished in 188 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((G(p0)||X(p1)) U X(((F(p4)&&p3)||p2))))], workingDir=/home/mcc/execution]
Support contains 7 out of 2530 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2530/2530 places, 6030/6030 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 2512 transition count 6012
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 2512 transition count 6012
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 48 place count 2500 transition count 6000
Iterating global reduction 0 with 12 rules applied. Total rules applied 60 place count 2500 transition count 6000
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 67 place count 2493 transition count 5993
Iterating global reduction 0 with 7 rules applied. Total rules applied 74 place count 2493 transition count 5993
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 80 place count 2487 transition count 5987
Iterating global reduction 0 with 6 rules applied. Total rules applied 86 place count 2487 transition count 5987
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 91 place count 2482 transition count 5982
Iterating global reduction 0 with 5 rules applied. Total rules applied 96 place count 2482 transition count 5982
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 99 place count 2479 transition count 5979
Iterating global reduction 0 with 3 rules applied. Total rules applied 102 place count 2479 transition count 5979
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 105 place count 2476 transition count 5976
Iterating global reduction 0 with 3 rules applied. Total rules applied 108 place count 2476 transition count 5976
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 111 place count 2473 transition count 5973
Iterating global reduction 0 with 3 rules applied. Total rules applied 114 place count 2473 transition count 5973
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 115 place count 2472 transition count 5972
Iterating global reduction 0 with 1 rules applied. Total rules applied 116 place count 2472 transition count 5972
Applied a total of 116 rules in 1903 ms. Remains 2472 /2530 variables (removed 58) and now considering 5972/6030 (removed 58) transitions.
// Phase 1: matrix 5972 rows 2472 cols
[2021-06-08 18:37:44] [INFO ] Computed 50 place invariants in 25 ms
[2021-06-08 18:37:44] [INFO ] Implicit Places using invariants in 300 ms returned []
// Phase 1: matrix 5972 rows 2472 cols
[2021-06-08 18:37:44] [INFO ] Computed 50 place invariants in 22 ms
[2021-06-08 18:37:45] [INFO ] Implicit Places using invariants and state equation in 823 ms returned []
Implicit Place search using SMT with State Equation took 1133 ms to find 0 implicit places.
// Phase 1: matrix 5972 rows 2472 cols
[2021-06-08 18:37:45] [INFO ] Computed 50 place invariants in 19 ms
[2021-06-08 18:37:48] [INFO ] Dead Transitions using invariants and state equation in 2467 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2472/2530 places, 5972/6030 transitions.
Stuttering acceptance computed with spot in 520 ms :[(OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2) (NOT p4))), (OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p4))), true, (NOT p0), (NOT p4), (AND (NOT p4) (NOT p0)), (AND (NOT p4) (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p4)), (AND (NOT p4) (NOT p1) (NOT p2))]
Running random walk in product with property : BART-PT-050-04 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) p3 (NOT p4)), acceptance={} source=1 dest: 6}, { cond=(AND p0 (NOT p1) (NOT p2) p3 (NOT p4)), acceptance={} source=1 dest: 7}], [{ cond=(AND p0 (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p2) p3 (NOT p4)), acceptance={0} source=2 dest: 8}, { cond=(AND (NOT p2) p3 (NOT p4)), acceptance={0} source=2 dest: 9}, { cond=(AND (NOT p0) (NOT p2) p3 (NOT p4)), acceptance={0} source=2 dest: 10}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p3 (NOT p4)), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}], [{ cond=(NOT p4), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p4)), acceptance={} source=7 dest: 6}, { cond=(AND p0 (NOT p4)), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2) (NOT p4)), acceptance={} source=8 dest: 6}, { cond=(AND p0 (NOT p1) (NOT p2) (NOT p4)), acceptance={} source=8 dest: 7}], [{ cond=(AND p0 (NOT p2) (NOT p4)), acceptance={0} source=9 dest: 8}, { cond=(AND (NOT p2) (NOT p4)), acceptance={0} source=9 dest: 9}, { cond=(AND (NOT p0) (NOT p2) (NOT p4)), acceptance={0} source=9 dest: 10}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p4)), acceptance={} source=10 dest: 6}]], initial=0, aps=[p0:(OR (EQ s354 0) (EQ s804 1)), p1:(OR (EQ s602 0) (EQ s803 1)), p2:(OR (EQ s855 0) (EQ s241 1)), p3:(AND (EQ s803 0) (EQ s602 1)), p4:(NEQ s2169 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 4832 ms.
Product exploration explored 100000 steps with 50000 reset in 4668 ms.
Knowledge obtained : [p0, p1, p2, (NOT p3), p4]
Stuttering acceptance computed with spot in 447 ms :[(OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2) (NOT p4))), (OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p4))), true, (NOT p0), (NOT p4), (AND (NOT p4) (NOT p0)), (AND (NOT p4) (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p4)), (AND (NOT p4) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 50000 reset in 4812 ms.
Product exploration explored 100000 steps with 50000 reset in 4863 ms.
Applying partial POR strategy [false, true, true, true, true, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 567 ms :[(OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2) (NOT p4))), (OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p4))), true, (NOT p0), (NOT p4), (AND (NOT p4) (NOT p0)), (AND (NOT p4) (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p4)), (AND (NOT p4) (NOT p1) (NOT p2))]
Support contains 7 out of 2472 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 2472/2472 places, 5972/5972 transitions.
Graph (trivial) has 5956 edges and 2472 vertex of which 2449 / 2472 are part of one of the 50 SCC in 5 ms
Free SCC test removed 2399 places
Ensure Unique test removed 5882 transitions
Reduce isomorphic transitions removed 5882 transitions.
Reduce places removed 43 places and 0 transitions.
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 30 transition count 48
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 47 place count 30 transition count 46
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 47 place count 30 transition count 46
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 49 place count 30 transition count 46
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 2 with 8 rules applied. Total rules applied 57 place count 30 transition count 46
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 65 place count 30 transition count 38
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 73 place count 22 transition count 30
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 3 with 8 rules applied. Total rules applied 81 place count 22 transition count 30
Deduced a syphon composed of 4 places in 0 ms
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 88 place count 22 transition count 23
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 88 place count 22 transition count 23
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 92 place count 22 transition count 23
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 96 place count 18 transition count 19
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 100 place count 18 transition count 19
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 100 rules in 21 ms. Remains 18 /2472 variables (removed 2454) and now considering 19/5972 (removed 5953) transitions.
[2021-06-08 18:38:09] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 19 rows 18 cols
[2021-06-08 18:38:09] [INFO ] Computed 7 place invariants in 1 ms
[2021-06-08 18:38:09] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 18/2472 places, 19/5972 transitions.
Product exploration explored 100000 steps with 50000 reset in 2114 ms.
Product exploration explored 100000 steps with 50000 reset in 2017 ms.
[2021-06-08 18:38:14] [INFO ] Flatten gal took : 191 ms
[2021-06-08 18:38:14] [INFO ] Flatten gal took : 123 ms
[2021-06-08 18:38:14] [INFO ] Time to serialize gal into /tmp/LTL278975101914927253.gal : 111 ms
[2021-06-08 18:38:14] [INFO ] Time to serialize properties into /tmp/LTL4587749778415071021.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/LTL278975101914927253.gal, -t, CGAL, -LTL, /tmp/LTL4587749778415071021.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/LTL278975101914927253.gal -t CGAL -LTL /tmp/LTL4587749778415071021.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((((G("((TrainState_4_1_7==0)||(TrainState_35_4_13==1))"))||(X("((TrainState_21_2_10==0)||(TrainState_15_3_13==1))")))U(X(("((TrainState_28_4_14==0)||(TrainState_42_1_4==1))")||(("((TrainState_15_3_13==0)&&(TrainState_21_2_10==1))")&&(F("(TrainState_29_2_35!=1)")))))))
Formula 0 simplified : !((G"((TrainState_4_1_7==0)||(TrainState_35_4_13==1))" | X"((TrainState_21_2_10==0)||(TrainState_15_3_13==1))") U X("((TrainState_28_4_14==0)||(TrainState_42_1_4==1))" | ("((TrainState_15_3_13==0)&&(TrainState_21_2_10==1))" & F"(TrainState_29_2_35!=1)")))
Detected timeout of ITS tools.
[2021-06-08 18:38:29] [INFO ] Flatten gal took : 105 ms
[2021-06-08 18:38:29] [INFO ] Applying decomposition
[2021-06-08 18:38:29] [INFO ] Flatten gal took : 104 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/graph2141618270318715402.txt, -o, /tmp/graph2141618270318715402.bin, -w, /tmp/graph2141618270318715402.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/graph2141618270318715402.bin, -l, -1, -v, -w, /tmp/graph2141618270318715402.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-06-08 18:38:30] [INFO ] Decomposing Gal with order
[2021-06-08 18:38:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-06-08 18:38:30] [INFO ] Removed a total of 1938 redundant transitions.
[2021-06-08 18:38:30] [INFO ] Flatten gal took : 328 ms
[2021-06-08 18:38:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 1057 labels/synchronizations in 43 ms.
[2021-06-08 18:38:30] [INFO ] Time to serialize gal into /tmp/LTL15102629545594394499.gal : 31 ms
[2021-06-08 18:38:30] [INFO ] Time to serialize properties into /tmp/LTL6058665437679337593.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/LTL15102629545594394499.gal, -t, CGAL, -LTL, /tmp/LTL6058665437679337593.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/LTL15102629545594394499.gal -t CGAL -LTL /tmp/LTL6058665437679337593.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((((G("((i12.u101.TrainState_4_1_7==0)||(i15.i0.u171.TrainState_35_4_13==1))"))||(X("((i25.u107.TrainState_21_2_10==0)||(i27.u216.TrainState_15_3_13==1))")))U(X(("((i17.i0.u192.TrainState_28_4_14==0)||(i37.u52.TrainState_42_1_4==1))")||(("((i27.u216.TrainState_15_3_13==0)&&(i25.u107.TrainState_21_2_10==1))")&&(F("(i48.u378.TrainState_29_2_35!=1)")))))))
Formula 0 simplified : !((G"((i12.u101.TrainState_4_1_7==0)||(i15.i0.u171.TrainState_35_4_13==1))" | X"((i25.u107.TrainState_21_2_10==0)||(i27.u216.TrainState_15_3_13==1))") U X("((i17.i0.u192.TrainState_28_4_14==0)||(i37.u52.TrainState_42_1_4==1))" | ("((i27.u216.TrainState_15_3_13==0)&&(i25.u107.TrainState_21_2_10==1))" & F"(i48.u378.TrainState_29_2_35!=1)")))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
74 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.09637,45896,1,0,2911,866,3634,1672,590,1484,9284
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BART-PT-050-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property BART-PT-050-04 finished in 49333 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0 U p1)))], workingDir=/home/mcc/execution]
Support contains 4 out of 2530 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2530/2530 places, 6030/6030 transitions.
Graph (trivial) has 6021 edges and 2530 vertex of which 2513 / 2530 are part of one of the 50 SCC in 8 ms
Free SCC test removed 2463 places
Ensure Unique test removed 5951 transitions
Reduce isomorphic transitions removed 5951 transitions.
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 21 transition count 31
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 1 with 8 rules applied. Total rules applied 57 place count 18 transition count 26
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 2 with 6 rules applied. Total rules applied 63 place count 16 transition count 22
Reduce places removed 2 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 3 with 4 rules applied. Total rules applied 67 place count 14 transition count 20
Reduce places removed 1 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 4 with 3 rules applied. Total rules applied 70 place count 13 transition count 18
Reduce places removed 1 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 5 with 3 rules applied. Total rules applied 73 place count 12 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 74 place count 11 transition count 16
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 78 place count 11 transition count 12
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 3 Pre rules applied. Total rules applied 78 place count 11 transition count 9
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 84 place count 8 transition count 9
Applied a total of 84 rules in 22 ms. Remains 8 /2530 variables (removed 2522) and now considering 9/6030 (removed 6021) transitions.
// Phase 1: matrix 9 rows 8 cols
[2021-06-08 18:38:32] [INFO ] Computed 4 place invariants in 0 ms
[2021-06-08 18:38:32] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 9 rows 8 cols
[2021-06-08 18:38:32] [INFO ] Computed 4 place invariants in 0 ms
[2021-06-08 18:38:32] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2021-06-08 18:38:32] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 8 cols
[2021-06-08 18:38:32] [INFO ] Computed 4 place invariants in 0 ms
[2021-06-08 18:38:32] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/2530 places, 9/6030 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : BART-PT-050-05 automaton TGBA [mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s2 0) (EQ s1 1)), p0:(AND (EQ s3 0) (EQ s0 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BART-PT-050-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-050-05 finished in 175 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0 U X(p0))||G(p1)))], workingDir=/home/mcc/execution]
Support contains 4 out of 2530 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2530/2530 places, 6030/6030 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 2508 transition count 6008
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 2508 transition count 6008
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 59 place count 2493 transition count 5993
Iterating global reduction 0 with 15 rules applied. Total rules applied 74 place count 2493 transition count 5993
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 83 place count 2484 transition count 5984
Iterating global reduction 0 with 9 rules applied. Total rules applied 92 place count 2484 transition count 5984
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 100 place count 2476 transition count 5976
Iterating global reduction 0 with 8 rules applied. Total rules applied 108 place count 2476 transition count 5976
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 115 place count 2469 transition count 5969
Iterating global reduction 0 with 7 rules applied. Total rules applied 122 place count 2469 transition count 5969
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 127 place count 2464 transition count 5964
Iterating global reduction 0 with 5 rules applied. Total rules applied 132 place count 2464 transition count 5964
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 137 place count 2459 transition count 5959
Iterating global reduction 0 with 5 rules applied. Total rules applied 142 place count 2459 transition count 5959
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 147 place count 2454 transition count 5954
Iterating global reduction 0 with 5 rules applied. Total rules applied 152 place count 2454 transition count 5954
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 153 place count 2453 transition count 5953
Iterating global reduction 0 with 1 rules applied. Total rules applied 154 place count 2453 transition count 5953
Applied a total of 154 rules in 1308 ms. Remains 2453 /2530 variables (removed 77) and now considering 5953/6030 (removed 77) transitions.
// Phase 1: matrix 5953 rows 2453 cols
[2021-06-08 18:38:33] [INFO ] Computed 50 place invariants in 22 ms
[2021-06-08 18:38:33] [INFO ] Implicit Places using invariants in 318 ms returned []
// Phase 1: matrix 5953 rows 2453 cols
[2021-06-08 18:38:33] [INFO ] Computed 50 place invariants in 15 ms
[2021-06-08 18:38:34] [INFO ] Implicit Places using invariants and state equation in 910 ms returned []
Implicit Place search using SMT with State Equation took 1229 ms to find 0 implicit places.
// Phase 1: matrix 5953 rows 2453 cols
[2021-06-08 18:38:34] [INFO ] Computed 50 place invariants in 17 ms
[2021-06-08 18:38:37] [INFO ] Dead Transitions using invariants and state equation in 2523 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2453/2530 places, 5953/6030 transitions.
Stuttering acceptance computed with spot in 219 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-050-07 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}], [{ cond=(NOT p0), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 0}]], initial=1, aps=[p0:(OR (EQ s856 0) (EQ s508 1)), p1:(OR (EQ s136 0) (EQ s701 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, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 9285 steps with 4564 reset in 428 ms.
FORMULA BART-PT-050-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-050-07 finished in 5751 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(X(F((p0&&F(G(p1)))))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 2530 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2530/2530 places, 6030/6030 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 2508 transition count 6008
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 2508 transition count 6008
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 59 place count 2493 transition count 5993
Iterating global reduction 0 with 15 rules applied. Total rules applied 74 place count 2493 transition count 5993
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 82 place count 2485 transition count 5985
Iterating global reduction 0 with 8 rules applied. Total rules applied 90 place count 2485 transition count 5985
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 97 place count 2478 transition count 5978
Iterating global reduction 0 with 7 rules applied. Total rules applied 104 place count 2478 transition count 5978
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 110 place count 2472 transition count 5972
Iterating global reduction 0 with 6 rules applied. Total rules applied 116 place count 2472 transition count 5972
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 120 place count 2468 transition count 5968
Iterating global reduction 0 with 4 rules applied. Total rules applied 124 place count 2468 transition count 5968
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 128 place count 2464 transition count 5964
Iterating global reduction 0 with 4 rules applied. Total rules applied 132 place count 2464 transition count 5964
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 136 place count 2460 transition count 5960
Iterating global reduction 0 with 4 rules applied. Total rules applied 140 place count 2460 transition count 5960
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 141 place count 2459 transition count 5959
Iterating global reduction 0 with 1 rules applied. Total rules applied 142 place count 2459 transition count 5959
Applied a total of 142 rules in 1099 ms. Remains 2459 /2530 variables (removed 71) and now considering 5959/6030 (removed 71) transitions.
// Phase 1: matrix 5959 rows 2459 cols
[2021-06-08 18:38:39] [INFO ] Computed 50 place invariants in 18 ms
[2021-06-08 18:38:39] [INFO ] Implicit Places using invariants in 298 ms returned []
// Phase 1: matrix 5959 rows 2459 cols
[2021-06-08 18:38:39] [INFO ] Computed 50 place invariants in 18 ms
[2021-06-08 18:38:40] [INFO ] Implicit Places using invariants and state equation in 887 ms returned []
Implicit Place search using SMT with State Equation took 1187 ms to find 0 implicit places.
// Phase 1: matrix 5959 rows 2459 cols
[2021-06-08 18:38:40] [INFO ] Computed 50 place invariants in 12 ms
[2021-06-08 18:38:42] [INFO ] Dead Transitions using invariants and state equation in 2504 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2459/2530 places, 5959/6030 transitions.
Stuttering acceptance computed with spot in 258 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : BART-PT-050-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}, { cond=(NOT p0), acceptance={} source=4 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}, { cond=p1, acceptance={} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(OR (EQ s1993 0) (EQ s15 1)), p1:(OR (EQ s850 0) (EQ s2106 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 889 ms.
Product exploration explored 100000 steps with 0 reset in 1137 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 236 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 841 ms.
Product exploration explored 100000 steps with 0 reset in 918 ms.
Applying partial POR strategy [false, false, false, false, true, true, true]
Stuttering acceptance computed with spot in 245 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Support contains 4 out of 2459 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 2459/2459 places, 5959/5959 transitions.
Graph (trivial) has 5914 edges and 2459 vertex of which 2400 / 2459 are part of one of the 49 SCC in 4 ms
Free SCC test removed 2351 places
Ensure Unique test removed 5773 transitions
Reduce isomorphic transitions removed 5773 transitions.
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 62 transition count 141
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 50 place count 62 transition count 140
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 50 place count 62 transition count 140
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 62 transition count 140
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 54 place count 60 transition count 138
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 56 place count 60 transition count 138
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 2 with 14 rules applied. Total rules applied 70 place count 60 transition count 139
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 77 place count 60 transition count 132
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 89 place count 48 transition count 120
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 3 with 12 rules applied. Total rules applied 101 place count 48 transition count 120
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 102 place count 48 transition count 120
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 104 place count 48 transition count 118
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 105 place count 47 transition count 117
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 106 place count 47 transition count 117
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 107 place count 47 transition count 117
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 109 place count 47 transition count 115
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 110 place count 46 transition count 114
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 111 place count 46 transition count 114
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 112 place count 46 transition count 114
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 114 place count 46 transition count 112
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 115 place count 45 transition count 111
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 6 with 1 rules applied. Total rules applied 116 place count 45 transition count 111
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 6 with 1 rules applied. Total rules applied 117 place count 45 transition count 111
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 119 place count 45 transition count 109
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 120 place count 44 transition count 108
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 7 with 1 rules applied. Total rules applied 121 place count 44 transition count 108
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 7 with 1 rules applied. Total rules applied 122 place count 44 transition count 108
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 124 place count 44 transition count 106
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 125 place count 43 transition count 105
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 8 with 1 rules applied. Total rules applied 126 place count 43 transition count 105
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 1 ms
Iterating global reduction 8 with 1 rules applied. Total rules applied 127 place count 43 transition count 105
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 129 place count 43 transition count 103
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 130 place count 42 transition count 102
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 131 place count 42 transition count 102
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 132 place count 42 transition count 102
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 134 place count 42 transition count 100
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 135 place count 41 transition count 99
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 10 with 1 rules applied. Total rules applied 136 place count 41 transition count 99
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 10 with 1 rules applied. Total rules applied 137 place count 41 transition count 99
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 139 place count 41 transition count 97
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 140 place count 40 transition count 96
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 11 with 1 rules applied. Total rules applied 141 place count 40 transition count 96
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 11 with 1 rules applied. Total rules applied 142 place count 40 transition count 96
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 144 place count 40 transition count 94
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 145 place count 39 transition count 93
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 12 with 1 rules applied. Total rules applied 146 place count 39 transition count 93
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 12 with 1 rules applied. Total rules applied 147 place count 39 transition count 93
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 149 place count 39 transition count 91
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 150 place count 38 transition count 90
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 13 with 1 rules applied. Total rules applied 151 place count 38 transition count 90
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 13 with 1 rules applied. Total rules applied 152 place count 38 transition count 90
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 154 place count 38 transition count 88
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 155 place count 37 transition count 87
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 14 with 1 rules applied. Total rules applied 156 place count 37 transition count 87
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 14 with 1 rules applied. Total rules applied 157 place count 37 transition count 87
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 159 place count 37 transition count 85
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 160 place count 36 transition count 84
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 15 with 1 rules applied. Total rules applied 161 place count 36 transition count 84
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 15 with 1 rules applied. Total rules applied 162 place count 36 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 164 place count 36 transition count 82
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 165 place count 35 transition count 81
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 16 with 1 rules applied. Total rules applied 166 place count 35 transition count 81
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 16 with 1 rules applied. Total rules applied 167 place count 35 transition count 81
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 169 place count 35 transition count 79
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 170 place count 34 transition count 78
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 17 with 1 rules applied. Total rules applied 171 place count 34 transition count 78
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 17 with 1 rules applied. Total rules applied 172 place count 34 transition count 78
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 174 place count 34 transition count 76
Discarding 1 places :
Symmetric choice reduction at 18 with 1 rule applications. Total rules 175 place count 33 transition count 75
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 18 with 1 rules applied. Total rules applied 176 place count 33 transition count 75
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 18 with 1 rules applied. Total rules applied 177 place count 33 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 179 place count 33 transition count 73
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 180 place count 32 transition count 72
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 19 with 1 rules applied. Total rules applied 181 place count 32 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 19 with 1 rules applied. Total rules applied 182 place count 32 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 184 place count 32 transition count 70
Discarding 1 places :
Symmetric choice reduction at 20 with 1 rule applications. Total rules 185 place count 31 transition count 69
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 20 with 1 rules applied. Total rules applied 186 place count 31 transition count 69
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 20 with 1 rules applied. Total rules applied 187 place count 31 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 189 place count 31 transition count 67
Discarding 1 places :
Symmetric choice reduction at 21 with 1 rule applications. Total rules 190 place count 30 transition count 66
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 21 with 1 rules applied. Total rules applied 191 place count 30 transition count 66
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 21 with 1 rules applied. Total rules applied 192 place count 30 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 21 with 2 rules applied. Total rules applied 194 place count 30 transition count 64
Discarding 1 places :
Symmetric choice reduction at 22 with 1 rule applications. Total rules 195 place count 29 transition count 63
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 22 with 1 rules applied. Total rules applied 196 place count 29 transition count 63
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 22 with 1 rules applied. Total rules applied 197 place count 29 transition count 63
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 22 with 2 rules applied. Total rules applied 199 place count 29 transition count 61
Discarding 1 places :
Symmetric choice reduction at 23 with 1 rule applications. Total rules 200 place count 28 transition count 60
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 23 with 1 rules applied. Total rules applied 201 place count 28 transition count 60
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 23 with 1 rules applied. Total rules applied 202 place count 28 transition count 60
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 23 with 2 rules applied. Total rules applied 204 place count 28 transition count 58
Discarding 1 places :
Symmetric choice reduction at 24 with 1 rule applications. Total rules 205 place count 27 transition count 57
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 24 with 1 rules applied. Total rules applied 206 place count 27 transition count 57
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 24 with 1 rules applied. Total rules applied 207 place count 27 transition count 57
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 24 with 2 rules applied. Total rules applied 209 place count 27 transition count 55
Discarding 1 places :
Symmetric choice reduction at 25 with 1 rule applications. Total rules 210 place count 26 transition count 54
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 25 with 1 rules applied. Total rules applied 211 place count 26 transition count 54
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 25 with 1 rules applied. Total rules applied 212 place count 26 transition count 54
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 25 with 2 rules applied. Total rules applied 214 place count 26 transition count 52
Discarding 1 places :
Symmetric choice reduction at 26 with 1 rule applications. Total rules 215 place count 25 transition count 51
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 26 with 1 rules applied. Total rules applied 216 place count 25 transition count 51
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 26 with 1 rules applied. Total rules applied 217 place count 25 transition count 51
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 26 with 2 rules applied. Total rules applied 219 place count 25 transition count 49
Discarding 1 places :
Symmetric choice reduction at 27 with 1 rule applications. Total rules 220 place count 24 transition count 48
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 27 with 1 rules applied. Total rules applied 221 place count 24 transition count 48
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 27 with 1 rules applied. Total rules applied 222 place count 24 transition count 48
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 27 with 2 rules applied. Total rules applied 224 place count 24 transition count 46
Discarding 1 places :
Symmetric choice reduction at 28 with 1 rule applications. Total rules 225 place count 23 transition count 45
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 28 with 1 rules applied. Total rules applied 226 place count 23 transition count 45
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 28 with 1 rules applied. Total rules applied 227 place count 23 transition count 45
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 28 with 2 rules applied. Total rules applied 229 place count 23 transition count 43
Discarding 1 places :
Symmetric choice reduction at 29 with 1 rule applications. Total rules 230 place count 22 transition count 42
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 29 with 1 rules applied. Total rules applied 231 place count 22 transition count 42
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 29 with 1 rules applied. Total rules applied 232 place count 22 transition count 42
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 29 with 2 rules applied. Total rules applied 234 place count 22 transition count 40
Discarding 1 places :
Symmetric choice reduction at 30 with 1 rule applications. Total rules 235 place count 21 transition count 39
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 30 with 1 rules applied. Total rules applied 236 place count 21 transition count 39
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 30 with 1 rules applied. Total rules applied 237 place count 21 transition count 39
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 30 with 2 rules applied. Total rules applied 239 place count 21 transition count 37
Discarding 1 places :
Symmetric choice reduction at 31 with 1 rule applications. Total rules 240 place count 20 transition count 36
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 31 with 1 rules applied. Total rules applied 241 place count 20 transition count 36
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 31 with 1 rules applied. Total rules applied 242 place count 20 transition count 36
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 31 with 2 rules applied. Total rules applied 244 place count 20 transition count 34
Discarding 1 places :
Symmetric choice reduction at 32 with 1 rule applications. Total rules 245 place count 19 transition count 33
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 32 with 1 rules applied. Total rules applied 246 place count 19 transition count 33
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 32 with 1 rules applied. Total rules applied 247 place count 19 transition count 33
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 32 with 2 rules applied. Total rules applied 249 place count 19 transition count 31
Discarding 1 places :
Symmetric choice reduction at 33 with 1 rule applications. Total rules 250 place count 18 transition count 30
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 33 with 1 rules applied. Total rules applied 251 place count 18 transition count 30
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 33 with 1 rules applied. Total rules applied 252 place count 18 transition count 30
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 33 with 2 rules applied. Total rules applied 254 place count 18 transition count 28
Discarding 1 places :
Symmetric choice reduction at 34 with 1 rule applications. Total rules 255 place count 17 transition count 27
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 34 with 1 rules applied. Total rules applied 256 place count 17 transition count 27
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 34 with 1 rules applied. Total rules applied 257 place count 17 transition count 27
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 34 with 2 rules applied. Total rules applied 259 place count 17 transition count 25
Discarding 1 places :
Symmetric choice reduction at 35 with 1 rule applications. Total rules 260 place count 16 transition count 24
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 35 with 1 rules applied. Total rules applied 261 place count 16 transition count 24
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 35 with 1 rules applied. Total rules applied 262 place count 16 transition count 24
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 35 with 2 rules applied. Total rules applied 264 place count 16 transition count 22
Discarding 1 places :
Symmetric choice reduction at 36 with 1 rule applications. Total rules 265 place count 15 transition count 21
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 36 with 1 rules applied. Total rules applied 266 place count 15 transition count 21
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 36 with 1 rules applied. Total rules applied 267 place count 15 transition count 21
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 36 with 2 rules applied. Total rules applied 269 place count 15 transition count 19
Discarding 2 places :
Symmetric choice reduction at 37 with 2 rule applications. Total rules 271 place count 13 transition count 17
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 37 with 2 rules applied. Total rules applied 273 place count 13 transition count 17
Deduced a syphon composed of 4 places in 0 ms
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 37 with 3 rules applied. Total rules applied 276 place count 13 transition count 14
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 37 with 1 Pre rules applied. Total rules applied 276 place count 13 transition count 14
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 37 with 1 rules applied. Total rules applied 277 place count 13 transition count 14
Discarding 2 places :
Symmetric choice reduction at 37 with 2 rule applications. Total rules 279 place count 11 transition count 12
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 37 with 2 rules applied. Total rules applied 281 place count 11 transition count 12
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 281 rules in 46 ms. Remains 11 /2459 variables (removed 2448) and now considering 12/5959 (removed 5947) transitions.
[2021-06-08 18:38:47] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 12 rows 11 cols
[2021-06-08 18:38:47] [INFO ] Computed 4 place invariants in 0 ms
[2021-06-08 18:38:47] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 11/2459 places, 12/5959 transitions.
Product exploration explored 100000 steps with 0 reset in 129 ms.
Product exploration explored 100000 steps with 0 reset in 84 ms.
[2021-06-08 18:38:47] [INFO ] Flatten gal took : 108 ms
[2021-06-08 18:38:48] [INFO ] Flatten gal took : 110 ms
[2021-06-08 18:38:48] [INFO ] Time to serialize gal into /tmp/LTL8049487878562681142.gal : 15 ms
[2021-06-08 18:38:48] [INFO ] Time to serialize properties into /tmp/LTL2321701247972747875.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/LTL8049487878562681142.gal, -t, CGAL, -LTL, /tmp/LTL2321701247972747875.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/LTL8049487878562681142.gal -t CGAL -LTL /tmp/LTL2321701247972747875.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(F((F(G("((TrainState_24_4_14==0)||(TrainState_21_2_34==1))")))&&("((TrainState_38_1_33==0)||(TrainState_16_0_0==1))"))))))))
Formula 0 simplified : !XXXXF("((TrainState_38_1_33==0)||(TrainState_16_0_0==1))" & FG"((TrainState_24_4_14==0)||(TrainState_21_2_34==1))")
Detected timeout of ITS tools.
[2021-06-08 18:39:03] [INFO ] Flatten gal took : 100 ms
[2021-06-08 18:39:03] [INFO ] Applying decomposition
[2021-06-08 18:39:03] [INFO ] Flatten gal took : 110 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/graph9969529030541992295.txt, -o, /tmp/graph9969529030541992295.bin, -w, /tmp/graph9969529030541992295.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/graph9969529030541992295.bin, -l, -1, -v, -w, /tmp/graph9969529030541992295.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-06-08 18:39:03] [INFO ] Decomposing Gal with order
[2021-06-08 18:39:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-06-08 18:39:04] [INFO ] Removed a total of 1923 redundant transitions.
[2021-06-08 18:39:04] [INFO ] Flatten gal took : 297 ms
[2021-06-08 18:39:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 1079 labels/synchronizations in 52 ms.
[2021-06-08 18:39:04] [INFO ] Time to serialize gal into /tmp/LTL11756250209232510114.gal : 74 ms
[2021-06-08 18:39:04] [INFO ] Time to serialize properties into /tmp/LTL13674235284890978432.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/LTL11756250209232510114.gal, -t, CGAL, -LTL, /tmp/LTL13674235284890978432.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/LTL11756250209232510114.gal -t CGAL -LTL /tmp/LTL13674235284890978432.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(F((F(G("((i21.u242.TrainState_24_4_14==0)||(i6.u446.TrainState_21_2_34==1))")))&&("((i41.u393.TrainState_38_1_33==0)||(i14.u89.TrainState_16_0_0==1))"))))))))
Formula 0 simplified : !XXXXF("((i41.u393.TrainState_38_1_33==0)||(i14.u89.TrainState_16_0_0==1))" & FG"((i21.u242.TrainState_24_4_14==0)||(i6.u446.TrainState_21_2_34==1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
88 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.22437,44432,1,0,18724,1299,3984,31415,529,3021,34381
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BART-PT-050-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property BART-PT-050-10 finished in 27947 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 2530 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2530/2530 places, 6030/6030 transitions.
Graph (trivial) has 6026 edges and 2530 vertex of which 2529 / 2530 are part of one of the 50 SCC in 4 ms
Free SCC test removed 2479 places
Ensure Unique test removed 5978 transitions
Reduce isomorphic transitions removed 5978 transitions.
Reduce places removed 49 places and 0 transitions.
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 2 transition count 4
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 2 transition count 3
Applied a total of 50 rules in 11 ms. Remains 2 /2530 variables (removed 2528) and now considering 3/6030 (removed 6027) transitions.
// Phase 1: matrix 3 rows 2 cols
[2021-06-08 18:39:05] [INFO ] Computed 1 place invariants in 0 ms
[2021-06-08 18:39:05] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-06-08 18:39:06] [INFO ] Computed 1 place invariants in 0 ms
[2021-06-08 18:39:06] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2021-06-08 18:39:06] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-06-08 18:39:06] [INFO ] Computed 1 place invariants in 0 ms
[2021-06-08 18:39:06] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/2530 places, 3/6030 transitions.
Stuttering acceptance computed with spot in 43 ms :[true, (NOT p0)]
Running random walk in product with property : BART-PT-050-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:(NEQ 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 BART-PT-050-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-050-13 finished in 217 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0 U X(p1))&&(p2 U G(!p0))))], workingDir=/home/mcc/execution]
Support contains 3 out of 2530 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2530/2530 places, 6030/6030 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 2508 transition count 6008
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 2508 transition count 6008
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 59 place count 2493 transition count 5993
Iterating global reduction 0 with 15 rules applied. Total rules applied 74 place count 2493 transition count 5993
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 83 place count 2484 transition count 5984
Iterating global reduction 0 with 9 rules applied. Total rules applied 92 place count 2484 transition count 5984
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 100 place count 2476 transition count 5976
Iterating global reduction 0 with 8 rules applied. Total rules applied 108 place count 2476 transition count 5976
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 115 place count 2469 transition count 5969
Iterating global reduction 0 with 7 rules applied. Total rules applied 122 place count 2469 transition count 5969
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 127 place count 2464 transition count 5964
Iterating global reduction 0 with 5 rules applied. Total rules applied 132 place count 2464 transition count 5964
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 137 place count 2459 transition count 5959
Iterating global reduction 0 with 5 rules applied. Total rules applied 142 place count 2459 transition count 5959
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 147 place count 2454 transition count 5954
Iterating global reduction 0 with 5 rules applied. Total rules applied 152 place count 2454 transition count 5954
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 153 place count 2453 transition count 5953
Iterating global reduction 0 with 1 rules applied. Total rules applied 154 place count 2453 transition count 5953
Applied a total of 154 rules in 1016 ms. Remains 2453 /2530 variables (removed 77) and now considering 5953/6030 (removed 77) transitions.
// Phase 1: matrix 5953 rows 2453 cols
[2021-06-08 18:39:07] [INFO ] Computed 50 place invariants in 12 ms
[2021-06-08 18:39:07] [INFO ] Implicit Places using invariants in 294 ms returned []
// Phase 1: matrix 5953 rows 2453 cols
[2021-06-08 18:39:07] [INFO ] Computed 50 place invariants in 14 ms
[2021-06-08 18:39:08] [INFO ] Implicit Places using invariants and state equation in 784 ms returned []
Implicit Place search using SMT with State Equation took 1094 ms to find 0 implicit places.
// Phase 1: matrix 5953 rows 2453 cols
[2021-06-08 18:39:08] [INFO ] Computed 50 place invariants in 13 ms
[2021-06-08 18:39:10] [INFO ] Dead Transitions using invariants and state equation in 2580 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2453/2530 places, 5953/6030 transitions.
Stuttering acceptance computed with spot in 186 ms :[(OR (NOT p1) p0), true, (NOT p1), p0, p0, (NOT p1)]
Running random walk in product with property : BART-PT-050-14 automaton TGBA [mat=[[{ cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 3}, { cond=p2, acceptance={} source=0 dest: 4}, { cond=(AND p0 p2), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}], [{ cond=p0, acceptance={} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 4}, { cond=(AND p0 p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s1952 1), p2:(OR (EQ s400 0) (EQ s1847 1)), p1:(AND (EQ s1847 0) (EQ s400 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 23504 steps with 0 reset in 206 ms.
FORMULA BART-PT-050-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-050-14 finished in 5114 ms.
All properties solved without resorting to model-checking.

BK_STOP 1623177552433

--------------------
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="BART-PT-050"
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 BART-PT-050, 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 r007-tall-162037990300641"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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