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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.9M
-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 4.4K Jun 8 09:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 19K Jun 8 09:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Jun 8 09:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K 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 4.8M 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-020-00
FORMULA_NAME BART-PT-020-01
FORMULA_NAME BART-PT-020-02
FORMULA_NAME BART-PT-020-03
FORMULA_NAME BART-PT-020-04
FORMULA_NAME BART-PT-020-05
FORMULA_NAME BART-PT-020-06
FORMULA_NAME BART-PT-020-07
FORMULA_NAME BART-PT-020-08
FORMULA_NAME BART-PT-020-09
FORMULA_NAME BART-PT-020-10
FORMULA_NAME BART-PT-020-11
FORMULA_NAME BART-PT-020-12
FORMULA_NAME BART-PT-020-13
FORMULA_NAME BART-PT-020-14
FORMULA_NAME BART-PT-020-15

=== Now, execution of the tool begins

BK_START 1623177335030

Running Version 0
[2021-06-08 18:35:36] [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:35:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-06-08 18:35:37] [INFO ] Load time of PNML (sax parser for PT used): 451 ms
[2021-06-08 18:35:37] [INFO ] Transformed 2850 places.
[2021-06-08 18:35:37] [INFO ] Transformed 4040 transitions.
[2021-06-08 18:35:37] [INFO ] Found NUPN structural information;
[2021-06-08 18:35:37] [INFO ] Parsed PT model containing 2850 places and 4040 transitions in 537 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2021-06-08 18:35:37] [INFO ] Initial state test concluded for 3 properties.
Reduce places removed 210 places and 0 transitions.
FORMULA BART-PT-020-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-020-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-020-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 2640 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Discarding 626 places :
Symmetric choice reduction at 0 with 626 rule applications. Total rules 626 place count 2014 transition count 3414
Iterating global reduction 0 with 626 rules applied. Total rules applied 1252 place count 2014 transition count 3414
Discarding 520 places :
Symmetric choice reduction at 0 with 520 rule applications. Total rules 1772 place count 1494 transition count 2894
Iterating global reduction 0 with 520 rules applied. Total rules applied 2292 place count 1494 transition count 2894
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 2372 place count 1414 transition count 2814
Iterating global reduction 0 with 80 rules applied. Total rules applied 2452 place count 1414 transition count 2814
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 2511 place count 1355 transition count 2755
Iterating global reduction 0 with 59 rules applied. Total rules applied 2570 place count 1355 transition count 2755
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 2629 place count 1296 transition count 2696
Iterating global reduction 0 with 59 rules applied. Total rules applied 2688 place count 1296 transition count 2696
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 2747 place count 1237 transition count 2637
Iterating global reduction 0 with 59 rules applied. Total rules applied 2806 place count 1237 transition count 2637
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 2865 place count 1178 transition count 2578
Iterating global reduction 0 with 59 rules applied. Total rules applied 2924 place count 1178 transition count 2578
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 2978 place count 1124 transition count 2524
Iterating global reduction 0 with 54 rules applied. Total rules applied 3032 place count 1124 transition count 2524
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 3068 place count 1088 transition count 2488
Iterating global reduction 0 with 36 rules applied. Total rules applied 3104 place count 1088 transition count 2488
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 3138 place count 1054 transition count 2454
Iterating global reduction 0 with 34 rules applied. Total rules applied 3172 place count 1054 transition count 2454
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 3187 place count 1039 transition count 2439
Iterating global reduction 0 with 15 rules applied. Total rules applied 3202 place count 1039 transition count 2439
Applied a total of 3202 rules in 1181 ms. Remains 1039 /2640 variables (removed 1601) and now considering 2439/4040 (removed 1601) transitions.
// Phase 1: matrix 2439 rows 1039 cols
[2021-06-08 18:35:38] [INFO ] Computed 20 place invariants in 32 ms
[2021-06-08 18:35:38] [INFO ] Implicit Places using invariants in 338 ms returned []
// Phase 1: matrix 2439 rows 1039 cols
[2021-06-08 18:35:38] [INFO ] Computed 20 place invariants in 13 ms
[2021-06-08 18:35:39] [INFO ] Implicit Places using invariants and state equation in 886 ms returned []
Implicit Place search using SMT with State Equation took 1260 ms to find 0 implicit places.
// Phase 1: matrix 2439 rows 1039 cols
[2021-06-08 18:35:39] [INFO ] Computed 20 place invariants in 7 ms
[2021-06-08 18:35:40] [INFO ] Dead Transitions using invariants and state equation in 933 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1039/2640 places, 2439/4040 transitions.
[2021-06-08 18:35:40] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-06-08 18:35:40] [INFO ] Flatten gal took : 173 ms
FORMULA BART-PT-020-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-020-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-020-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-06-08 18:35:41] [INFO ] Flatten gal took : 77 ms
[2021-06-08 18:35:41] [INFO ] Input system was already deterministic with 2439 transitions.
Finished random walk after 43107 steps, including 1 resets, run visited all 14 properties in 365 ms. (steps per millisecond=118 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&X(G(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 1039 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1039/1039 places, 2439/2439 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 1016 transition count 2416
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 1016 transition count 2416
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 60 place count 1002 transition count 2402
Iterating global reduction 0 with 14 rules applied. Total rules applied 74 place count 1002 transition count 2402
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 78 place count 998 transition count 2398
Iterating global reduction 0 with 4 rules applied. Total rules applied 82 place count 998 transition count 2398
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 86 place count 994 transition count 2394
Iterating global reduction 0 with 4 rules applied. Total rules applied 90 place count 994 transition count 2394
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 94 place count 990 transition count 2390
Iterating global reduction 0 with 4 rules applied. Total rules applied 98 place count 990 transition count 2390
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 101 place count 987 transition count 2387
Iterating global reduction 0 with 3 rules applied. Total rules applied 104 place count 987 transition count 2387
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 105 place count 986 transition count 2386
Iterating global reduction 0 with 1 rules applied. Total rules applied 106 place count 986 transition count 2386
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 107 place count 985 transition count 2385
Iterating global reduction 0 with 1 rules applied. Total rules applied 108 place count 985 transition count 2385
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 109 place count 984 transition count 2384
Iterating global reduction 0 with 1 rules applied. Total rules applied 110 place count 984 transition count 2384
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 111 place count 983 transition count 2383
Iterating global reduction 0 with 1 rules applied. Total rules applied 112 place count 983 transition count 2383
Applied a total of 112 rules in 282 ms. Remains 983 /1039 variables (removed 56) and now considering 2383/2439 (removed 56) transitions.
// Phase 1: matrix 2383 rows 983 cols
[2021-06-08 18:35:41] [INFO ] Computed 20 place invariants in 22 ms
[2021-06-08 18:35:42] [INFO ] Implicit Places using invariants in 172 ms returned []
// Phase 1: matrix 2383 rows 983 cols
[2021-06-08 18:35:42] [INFO ] Computed 20 place invariants in 10 ms
[2021-06-08 18:35:42] [INFO ] Implicit Places using invariants and state equation in 557 ms returned []
Implicit Place search using SMT with State Equation took 731 ms to find 0 implicit places.
// Phase 1: matrix 2383 rows 983 cols
[2021-06-08 18:35:42] [INFO ] Computed 20 place invariants in 19 ms
[2021-06-08 18:35:43] [INFO ] Dead Transitions using invariants and state equation in 806 ms returned []
Finished structural reductions, in 1 iterations. Remains : 983/1039 places, 2383/2439 transitions.
Stuttering acceptance computed with spot in 213 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : BART-PT-020-00 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(OR (EQ s160 0) (EQ s842 1)), p0:(EQ s932 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 14569 steps with 0 reset in 135 ms.
FORMULA BART-PT-020-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-020-00 finished in 2227 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&X(X(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 1039 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1039/1039 places, 2439/2439 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1015 transition count 2415
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1015 transition count 2415
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 63 place count 1000 transition count 2400
Iterating global reduction 0 with 15 rules applied. Total rules applied 78 place count 1000 transition count 2400
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 82 place count 996 transition count 2396
Iterating global reduction 0 with 4 rules applied. Total rules applied 86 place count 996 transition count 2396
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 90 place count 992 transition count 2392
Iterating global reduction 0 with 4 rules applied. Total rules applied 94 place count 992 transition count 2392
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 98 place count 988 transition count 2388
Iterating global reduction 0 with 4 rules applied. Total rules applied 102 place count 988 transition count 2388
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 105 place count 985 transition count 2385
Iterating global reduction 0 with 3 rules applied. Total rules applied 108 place count 985 transition count 2385
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 109 place count 984 transition count 2384
Iterating global reduction 0 with 1 rules applied. Total rules applied 110 place count 984 transition count 2384
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 111 place count 983 transition count 2383
Iterating global reduction 0 with 1 rules applied. Total rules applied 112 place count 983 transition count 2383
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 113 place count 982 transition count 2382
Iterating global reduction 0 with 1 rules applied. Total rules applied 114 place count 982 transition count 2382
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 115 place count 981 transition count 2381
Iterating global reduction 0 with 1 rules applied. Total rules applied 116 place count 981 transition count 2381
Applied a total of 116 rules in 319 ms. Remains 981 /1039 variables (removed 58) and now considering 2381/2439 (removed 58) transitions.
// Phase 1: matrix 2381 rows 981 cols
[2021-06-08 18:35:44] [INFO ] Computed 20 place invariants in 8 ms
[2021-06-08 18:35:44] [INFO ] Implicit Places using invariants in 102 ms returned []
// Phase 1: matrix 2381 rows 981 cols
[2021-06-08 18:35:44] [INFO ] Computed 20 place invariants in 8 ms
[2021-06-08 18:35:44] [INFO ] Implicit Places using invariants and state equation in 598 ms returned []
Implicit Place search using SMT with State Equation took 708 ms to find 0 implicit places.
// Phase 1: matrix 2381 rows 981 cols
[2021-06-08 18:35:44] [INFO ] Computed 20 place invariants in 10 ms
[2021-06-08 18:35:45] [INFO ] Dead Transitions using invariants and state equation in 771 ms returned []
Finished structural reductions, in 1 iterations. Remains : 981/1039 places, 2381/2439 transitions.
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : BART-PT-020-02 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s198 1), p1:(EQ s760 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2969 steps with 2 reset in 12 ms.
FORMULA BART-PT-020-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-020-02 finished in 1985 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0&&(!p0||F(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 1039 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1039/1039 places, 2439/2439 transitions.
Graph (trivial) has 2433 edges and 1039 vertex of which 1032 / 1039 are part of one of the 20 SCC in 9 ms
Free SCC test removed 1012 places
Ensure Unique test removed 2407 transitions
Reduce isomorphic transitions removed 2407 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 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 0 with 17 rules applied. Total rules applied 18 place count 10 transition count 15
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 1 with 3 rules applied. Total rules applied 21 place count 9 transition count 13
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 2 with 3 rules applied. Total rules applied 24 place count 8 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 25 place count 7 transition count 11
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 28 place count 7 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 28 place count 7 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 30 place count 6 transition count 7
Applied a total of 30 rules in 28 ms. Remains 6 /1039 variables (removed 1033) and now considering 7/2439 (removed 2432) transitions.
// Phase 1: matrix 7 rows 6 cols
[2021-06-08 18:35:45] [INFO ] Computed 3 place invariants in 0 ms
[2021-06-08 18:35:45] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 7 rows 6 cols
[2021-06-08 18:35:45] [INFO ] Computed 3 place invariants in 0 ms
[2021-06-08 18:35:45] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
[2021-06-08 18:35:45] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 6 cols
[2021-06-08 18:35:45] [INFO ] Computed 3 place invariants in 8 ms
[2021-06-08 18:35:45] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 6/1039 places, 7/2439 transitions.
Stuttering acceptance computed with spot in 65 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : BART-PT-020-03 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s1 0) (EQ s2 1)), p1:(NEQ 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]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA BART-PT-020-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-020-03 finished in 171 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 1039 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1039/1039 places, 2439/2439 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1015 transition count 2415
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1015 transition count 2415
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 62 place count 1001 transition count 2401
Iterating global reduction 0 with 14 rules applied. Total rules applied 76 place count 1001 transition count 2401
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 80 place count 997 transition count 2397
Iterating global reduction 0 with 4 rules applied. Total rules applied 84 place count 997 transition count 2397
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 88 place count 993 transition count 2393
Iterating global reduction 0 with 4 rules applied. Total rules applied 92 place count 993 transition count 2393
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 96 place count 989 transition count 2389
Iterating global reduction 0 with 4 rules applied. Total rules applied 100 place count 989 transition count 2389
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 103 place count 986 transition count 2386
Iterating global reduction 0 with 3 rules applied. Total rules applied 106 place count 986 transition count 2386
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 107 place count 985 transition count 2385
Iterating global reduction 0 with 1 rules applied. Total rules applied 108 place count 985 transition count 2385
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 109 place count 984 transition count 2384
Iterating global reduction 0 with 1 rules applied. Total rules applied 110 place count 984 transition count 2384
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 111 place count 983 transition count 2383
Iterating global reduction 0 with 1 rules applied. Total rules applied 112 place count 983 transition count 2383
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 113 place count 982 transition count 2382
Iterating global reduction 0 with 1 rules applied. Total rules applied 114 place count 982 transition count 2382
Applied a total of 114 rules in 293 ms. Remains 982 /1039 variables (removed 57) and now considering 2382/2439 (removed 57) transitions.
// Phase 1: matrix 2382 rows 982 cols
[2021-06-08 18:35:46] [INFO ] Computed 20 place invariants in 5 ms
[2021-06-08 18:35:46] [INFO ] Implicit Places using invariants in 116 ms returned []
// Phase 1: matrix 2382 rows 982 cols
[2021-06-08 18:35:46] [INFO ] Computed 20 place invariants in 9 ms
[2021-06-08 18:35:46] [INFO ] Implicit Places using invariants and state equation in 542 ms returned []
Implicit Place search using SMT with State Equation took 661 ms to find 0 implicit places.
// Phase 1: matrix 2382 rows 982 cols
[2021-06-08 18:35:46] [INFO ] Computed 20 place invariants in 9 ms
[2021-06-08 18:35:47] [INFO ] Dead Transitions using invariants and state equation in 768 ms returned []
Finished structural reductions, in 1 iterations. Remains : 982/1039 places, 2382/2439 transitions.
Stuttering acceptance computed with spot in 130 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-020-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s440 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA BART-PT-020-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-020-06 finished in 1875 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 1039 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1039/1039 places, 2439/2439 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1015 transition count 2415
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1015 transition count 2415
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 63 place count 1000 transition count 2400
Iterating global reduction 0 with 15 rules applied. Total rules applied 78 place count 1000 transition count 2400
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 82 place count 996 transition count 2396
Iterating global reduction 0 with 4 rules applied. Total rules applied 86 place count 996 transition count 2396
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 90 place count 992 transition count 2392
Iterating global reduction 0 with 4 rules applied. Total rules applied 94 place count 992 transition count 2392
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 98 place count 988 transition count 2388
Iterating global reduction 0 with 4 rules applied. Total rules applied 102 place count 988 transition count 2388
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 105 place count 985 transition count 2385
Iterating global reduction 0 with 3 rules applied. Total rules applied 108 place count 985 transition count 2385
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 109 place count 984 transition count 2384
Iterating global reduction 0 with 1 rules applied. Total rules applied 110 place count 984 transition count 2384
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 111 place count 983 transition count 2383
Iterating global reduction 0 with 1 rules applied. Total rules applied 112 place count 983 transition count 2383
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 113 place count 982 transition count 2382
Iterating global reduction 0 with 1 rules applied. Total rules applied 114 place count 982 transition count 2382
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 115 place count 981 transition count 2381
Iterating global reduction 0 with 1 rules applied. Total rules applied 116 place count 981 transition count 2381
Applied a total of 116 rules in 347 ms. Remains 981 /1039 variables (removed 58) and now considering 2381/2439 (removed 58) transitions.
// Phase 1: matrix 2381 rows 981 cols
[2021-06-08 18:35:48] [INFO ] Computed 20 place invariants in 9 ms
[2021-06-08 18:35:48] [INFO ] Implicit Places using invariants in 107 ms returned []
// Phase 1: matrix 2381 rows 981 cols
[2021-06-08 18:35:48] [INFO ] Computed 20 place invariants in 12 ms
[2021-06-08 18:35:48] [INFO ] Implicit Places using invariants and state equation in 566 ms returned []
Implicit Place search using SMT with State Equation took 675 ms to find 0 implicit places.
// Phase 1: matrix 2381 rows 981 cols
[2021-06-08 18:35:48] [INFO ] Computed 20 place invariants in 6 ms
[2021-06-08 18:35:49] [INFO ] Dead Transitions using invariants and state equation in 776 ms returned []
Finished structural reductions, in 1 iterations. Remains : 981/1039 places, 2381/2439 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-020-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s818 0) (EQ s744 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1922 ms.
Product exploration explored 100000 steps with 50000 reset in 1827 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 1875 ms.
Product exploration explored 100000 steps with 50000 reset in 1907 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 981 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 981/981 places, 2381/2381 transitions.
Graph (trivial) has 2375 edges and 981 vertex of which 979 / 981 are part of one of the 20 SCC in 4 ms
Free SCC test removed 959 places
Ensure Unique test removed 2357 transitions
Reduce isomorphic transitions removed 2357 transitions.
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 4 transition count 7
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 4 transition count 5
Applied a total of 20 rules in 10 ms. Remains 4 /981 variables (removed 977) and now considering 5/2381 (removed 2376) transitions.
[2021-06-08 18:35:57] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2021-06-08 18:35:57] [INFO ] Computed 2 place invariants in 0 ms
[2021-06-08 18:35:57] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/981 places, 5/2381 transitions.
Product exploration explored 100000 steps with 50000 reset in 841 ms.
Product exploration explored 100000 steps with 50000 reset in 812 ms.
[2021-06-08 18:35:59] [INFO ] Flatten gal took : 61 ms
[2021-06-08 18:35:59] [INFO ] Flatten gal took : 116 ms
[2021-06-08 18:35:59] [INFO ] Time to serialize gal into /tmp/LTL17441238345750601123.gal : 73 ms
[2021-06-08 18:35:59] [INFO ] Time to serialize properties into /tmp/LTL14839868237214522107.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/LTL17441238345750601123.gal, -t, CGAL, -LTL, /tmp/LTL14839868237214522107.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/LTL17441238345750601123.gal -t CGAL -LTL /tmp/LTL14839868237214522107.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("((TrainState_19_2_33==0)||(TrainState_5_1_31==1))"))))
Formula 0 simplified : !XF"((TrainState_19_2_33==0)||(TrainState_5_1_31==1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
677 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,6.9269,167964,1,0,6,964660,20,0,24266,15338,9
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BART-PT-020-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property BART-PT-020-07 finished in 19168 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U X(G(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 1039 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1039/1039 places, 2439/2439 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 1016 transition count 2416
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 1016 transition count 2416
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 59 place count 1003 transition count 2403
Iterating global reduction 0 with 13 rules applied. Total rules applied 72 place count 1003 transition count 2403
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 76 place count 999 transition count 2399
Iterating global reduction 0 with 4 rules applied. Total rules applied 80 place count 999 transition count 2399
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 84 place count 995 transition count 2395
Iterating global reduction 0 with 4 rules applied. Total rules applied 88 place count 995 transition count 2395
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 92 place count 991 transition count 2391
Iterating global reduction 0 with 4 rules applied. Total rules applied 96 place count 991 transition count 2391
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 99 place count 988 transition count 2388
Iterating global reduction 0 with 3 rules applied. Total rules applied 102 place count 988 transition count 2388
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 103 place count 987 transition count 2387
Iterating global reduction 0 with 1 rules applied. Total rules applied 104 place count 987 transition count 2387
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 105 place count 986 transition count 2386
Iterating global reduction 0 with 1 rules applied. Total rules applied 106 place count 986 transition count 2386
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 107 place count 985 transition count 2385
Iterating global reduction 0 with 1 rules applied. Total rules applied 108 place count 985 transition count 2385
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 109 place count 984 transition count 2384
Iterating global reduction 0 with 1 rules applied. Total rules applied 110 place count 984 transition count 2384
Applied a total of 110 rules in 246 ms. Remains 984 /1039 variables (removed 55) and now considering 2384/2439 (removed 55) transitions.
// Phase 1: matrix 2384 rows 984 cols
[2021-06-08 18:36:07] [INFO ] Computed 20 place invariants in 13 ms
[2021-06-08 18:36:07] [INFO ] Implicit Places using invariants in 146 ms returned []
// Phase 1: matrix 2384 rows 984 cols
[2021-06-08 18:36:07] [INFO ] Computed 20 place invariants in 11 ms
[2021-06-08 18:36:08] [INFO ] Implicit Places using invariants and state equation in 569 ms returned []
Implicit Place search using SMT with State Equation took 731 ms to find 0 implicit places.
// Phase 1: matrix 2384 rows 984 cols
[2021-06-08 18:36:08] [INFO ] Computed 20 place invariants in 7 ms
[2021-06-08 18:36:08] [INFO ] Dead Transitions using invariants and state equation in 785 ms returned []
Finished structural reductions, in 1 iterations. Remains : 984/1039 places, 2384/2439 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : BART-PT-020-08 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(OR (NEQ s922 0) (NEQ s640 1)), p0:(OR (EQ s640 0) (EQ s922 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 2039 steps with 0 reset in 13 ms.
FORMULA BART-PT-020-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-020-08 finished in 1866 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 1039 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1039/1039 places, 2439/2439 transitions.
Graph (trivial) has 2429 edges and 1039 vertex of which 1034 / 1039 are part of one of the 20 SCC in 4 ms
Free SCC test removed 1014 places
Ensure Unique test removed 2410 transitions
Reduce isomorphic transitions removed 2410 transitions.
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 9 transition count 14
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 20 place count 9 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 20 place count 9 transition count 9
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 22 place count 8 transition count 9
Applied a total of 22 rules in 9 ms. Remains 8 /1039 variables (removed 1031) and now considering 9/2439 (removed 2430) transitions.
// Phase 1: matrix 9 rows 8 cols
[2021-06-08 18:36:08] [INFO ] Computed 4 place invariants in 0 ms
[2021-06-08 18:36:08] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 9 rows 8 cols
[2021-06-08 18:36:08] [INFO ] Computed 4 place invariants in 1 ms
[2021-06-08 18:36:08] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 18 ms to find 0 implicit places.
[2021-06-08 18:36:08] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 8 cols
[2021-06-08 18:36:08] [INFO ] Computed 4 place invariants in 0 ms
[2021-06-08 18:36:08] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/1039 places, 9/2439 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : BART-PT-020-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s2 0) (NEQ s3 1) (OR (NEQ s1 0) (NEQ s0 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BART-PT-020-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-020-10 finished in 92 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 1039 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1039/1039 places, 2439/2439 transitions.
Graph (trivial) has 2433 edges and 1039 vertex of which 1032 / 1039 are part of one of the 20 SCC in 3 ms
Free SCC test removed 1012 places
Ensure Unique test removed 2407 transitions
Reduce isomorphic transitions removed 2407 transitions.
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 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 0 with 18 rules applied. Total rules applied 19 place count 9 transition count 14
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 1 with 3 rules applied. Total rules applied 22 place count 8 transition count 12
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 2 with 3 rules applied. Total rules applied 25 place count 7 transition count 10
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 3 with 3 rules applied. Total rules applied 28 place count 6 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 29 place count 5 transition count 8
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 31 place count 5 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 31 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 5 with 2 rules applied. Total rules applied 33 place count 4 transition count 5
Applied a total of 33 rules in 8 ms. Remains 4 /1039 variables (removed 1035) and now considering 5/2439 (removed 2434) transitions.
// Phase 1: matrix 5 rows 4 cols
[2021-06-08 18:36:09] [INFO ] Computed 2 place invariants in 0 ms
[2021-06-08 18:36:09] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2021-06-08 18:36:09] [INFO ] Computed 2 place invariants in 0 ms
[2021-06-08 18:36:09] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 20 ms to find 0 implicit places.
[2021-06-08 18:36:09] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2021-06-08 18:36:09] [INFO ] Computed 2 place invariants in 0 ms
[2021-06-08 18:36:09] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/1039 places, 5/2439 transitions.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Running random walk in product with property : BART-PT-020-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s0 0) (NEQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BART-PT-020-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-020-12 finished in 81 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 1039 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1039/1039 places, 2439/2439 transitions.
Graph (trivial) has 2431 edges and 1039 vertex of which 1037 / 1039 are part of one of the 20 SCC in 4 ms
Free SCC test removed 1017 places
Ensure Unique test removed 2415 transitions
Reduce isomorphic transitions removed 2415 transitions.
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 4 transition count 7
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 4 transition count 5
Applied a total of 20 rules in 9 ms. Remains 4 /1039 variables (removed 1035) and now considering 5/2439 (removed 2434) transitions.
// Phase 1: matrix 5 rows 4 cols
[2021-06-08 18:36:09] [INFO ] Computed 2 place invariants in 0 ms
[2021-06-08 18:36:09] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2021-06-08 18:36:09] [INFO ] Computed 2 place invariants in 0 ms
[2021-06-08 18:36:09] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 16 ms to find 0 implicit places.
[2021-06-08 18:36:09] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2021-06-08 18:36:09] [INFO ] Computed 2 place invariants in 0 ms
[2021-06-08 18:36:09] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/1039 places, 5/2439 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : BART-PT-020-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (NEQ s0 0) (NEQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA BART-PT-020-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-020-14 finished in 91 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 1039 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1039/1039 places, 2439/2439 transitions.
Graph (trivial) has 2433 edges and 1039 vertex of which 1036 / 1039 are part of one of the 20 SCC in 3 ms
Free SCC test removed 1016 places
Ensure Unique test removed 2414 transitions
Reduce isomorphic transitions removed 2414 transitions.
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 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 20 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 20 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 22 place count 4 transition count 5
Applied a total of 22 rules in 8 ms. Remains 4 /1039 variables (removed 1035) and now considering 5/2439 (removed 2434) transitions.
// Phase 1: matrix 5 rows 4 cols
[2021-06-08 18:36:09] [INFO ] Computed 2 place invariants in 0 ms
[2021-06-08 18:36:09] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2021-06-08 18:36:09] [INFO ] Computed 2 place invariants in 0 ms
[2021-06-08 18:36:09] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 21 ms to find 0 implicit places.
[2021-06-08 18:36:09] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2021-06-08 18:36:09] [INFO ] Computed 2 place invariants in 0 ms
[2021-06-08 18:36:09] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/1039 places, 5/2439 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-020-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s0 0) (EQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA BART-PT-020-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-020-15 finished in 122 ms.
All properties solved without resorting to model-checking.

BK_STOP 1623177370525

--------------------
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-020"
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-020, 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-162037990300617"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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