fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r007-tall-162037990200602
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for BART-PT-005

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
506.415 20829.00 33011.00 237.30 FFFFFFTFFFFFFFFF normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-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.7K Jun 8 09:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Jun 8 09:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K 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 4.8K Jun 8 09:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Jun 8 09:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Jun 8 09:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K 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 1.3M 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-005-00
FORMULA_NAME BART-PT-005-01
FORMULA_NAME BART-PT-005-02
FORMULA_NAME BART-PT-005-03
FORMULA_NAME BART-PT-005-04
FORMULA_NAME BART-PT-005-05
FORMULA_NAME BART-PT-005-06
FORMULA_NAME BART-PT-005-07
FORMULA_NAME BART-PT-005-08
FORMULA_NAME BART-PT-005-09
FORMULA_NAME BART-PT-005-10
FORMULA_NAME BART-PT-005-11
FORMULA_NAME BART-PT-005-12
FORMULA_NAME BART-PT-005-13
FORMULA_NAME BART-PT-005-14
FORMULA_NAME BART-PT-005-15

=== Now, execution of the tool begins

BK_START 1623177301163

Running Version 0
[2021-06-08 18:35:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-06-08 18:35:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-06-08 18:35:03] [INFO ] Load time of PNML (sax parser for PT used): 133 ms
[2021-06-08 18:35:03] [INFO ] Transformed 870 places.
[2021-06-08 18:35:03] [INFO ] Transformed 1010 transitions.
[2021-06-08 18:35:03] [INFO ] Found NUPN structural information;
[2021-06-08 18:35:03] [INFO ] Parsed PT model containing 870 places and 1010 transitions in 184 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-06-08 18:35:03] [INFO ] Initial state test concluded for 1 properties.
Reduce places removed 210 places and 0 transitions.
FORMULA BART-PT-005-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 660 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 660/660 places, 1010/1010 transitions.
Discarding 146 places :
Symmetric choice reduction at 0 with 146 rule applications. Total rules 146 place count 514 transition count 864
Iterating global reduction 0 with 146 rules applied. Total rules applied 292 place count 514 transition count 864
Discarding 118 places :
Symmetric choice reduction at 0 with 118 rule applications. Total rules 410 place count 396 transition count 746
Iterating global reduction 0 with 118 rules applied. Total rules applied 528 place count 396 transition count 746
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 543 place count 381 transition count 731
Iterating global reduction 0 with 15 rules applied. Total rules applied 558 place count 381 transition count 731
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 568 place count 371 transition count 721
Iterating global reduction 0 with 10 rules applied. Total rules applied 578 place count 371 transition count 721
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 588 place count 361 transition count 711
Iterating global reduction 0 with 10 rules applied. Total rules applied 598 place count 361 transition count 711
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 608 place count 351 transition count 701
Iterating global reduction 0 with 10 rules applied. Total rules applied 618 place count 351 transition count 701
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 628 place count 341 transition count 691
Iterating global reduction 0 with 10 rules applied. Total rules applied 638 place count 341 transition count 691
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 648 place count 331 transition count 681
Iterating global reduction 0 with 10 rules applied. Total rules applied 658 place count 331 transition count 681
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 663 place count 326 transition count 676
Iterating global reduction 0 with 5 rules applied. Total rules applied 668 place count 326 transition count 676
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 673 place count 321 transition count 671
Iterating global reduction 0 with 5 rules applied. Total rules applied 678 place count 321 transition count 671
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 679 place count 320 transition count 670
Iterating global reduction 0 with 1 rules applied. Total rules applied 680 place count 320 transition count 670
Applied a total of 680 rules in 179 ms. Remains 320 /660 variables (removed 340) and now considering 670/1010 (removed 340) transitions.
// Phase 1: matrix 670 rows 320 cols
[2021-06-08 18:35:03] [INFO ] Computed 5 place invariants in 27 ms
[2021-06-08 18:35:03] [INFO ] Implicit Places using invariants in 192 ms returned []
// Phase 1: matrix 670 rows 320 cols
[2021-06-08 18:35:03] [INFO ] Computed 5 place invariants in 8 ms
[2021-06-08 18:35:03] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
// Phase 1: matrix 670 rows 320 cols
[2021-06-08 18:35:03] [INFO ] Computed 5 place invariants in 4 ms
[2021-06-08 18:35:04] [INFO ] Dead Transitions using invariants and state equation in 400 ms returned []
Finished structural reductions, in 1 iterations. Remains : 320/660 places, 670/1010 transitions.
[2021-06-08 18:35:04] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-06-08 18:35:04] [INFO ] Flatten gal took : 67 ms
FORMULA BART-PT-005-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-06-08 18:35:04] [INFO ] Flatten gal took : 26 ms
[2021-06-08 18:35:04] [INFO ] Input system was already deterministic with 670 transitions.
Finished random walk after 6806 steps, including 0 resets, run visited all 29 properties in 29 ms. (steps per millisecond=234 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&(F(p1)||(p2&&X(G((p2||G(p3)))))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 320 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 320/320 places, 670/670 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 301 transition count 651
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 301 transition count 651
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 51 place count 288 transition count 638
Iterating global reduction 0 with 13 rules applied. Total rules applied 64 place count 288 transition count 638
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 71 place count 281 transition count 631
Iterating global reduction 0 with 7 rules applied. Total rules applied 78 place count 281 transition count 631
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 83 place count 276 transition count 626
Iterating global reduction 0 with 5 rules applied. Total rules applied 88 place count 276 transition count 626
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 93 place count 271 transition count 621
Iterating global reduction 0 with 5 rules applied. Total rules applied 98 place count 271 transition count 621
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 103 place count 266 transition count 616
Iterating global reduction 0 with 5 rules applied. Total rules applied 108 place count 266 transition count 616
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 113 place count 261 transition count 611
Iterating global reduction 0 with 5 rules applied. Total rules applied 118 place count 261 transition count 611
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 123 place count 256 transition count 606
Iterating global reduction 0 with 5 rules applied. Total rules applied 128 place count 256 transition count 606
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 132 place count 252 transition count 602
Iterating global reduction 0 with 4 rules applied. Total rules applied 136 place count 252 transition count 602
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 139 place count 249 transition count 599
Iterating global reduction 0 with 3 rules applied. Total rules applied 142 place count 249 transition count 599
Applied a total of 142 rules in 49 ms. Remains 249 /320 variables (removed 71) and now considering 599/670 (removed 71) transitions.
// Phase 1: matrix 599 rows 249 cols
[2021-06-08 18:35:04] [INFO ] Computed 5 place invariants in 2 ms
[2021-06-08 18:35:04] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 599 rows 249 cols
[2021-06-08 18:35:04] [INFO ] Computed 5 place invariants in 4 ms
[2021-06-08 18:35:04] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
// Phase 1: matrix 599 rows 249 cols
[2021-06-08 18:35:04] [INFO ] Computed 5 place invariants in 3 ms
[2021-06-08 18:35:05] [INFO ] Dead Transitions using invariants and state equation in 198 ms returned []
Finished structural reductions, in 1 iterations. Remains : 249/320 places, 599/670 transitions.
Stuttering acceptance computed with spot in 364 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p1)]
Running random walk in product with property : BART-PT-005-00 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p3), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) p3), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=1, aps=[p0:(EQ s210 1), p1:(EQ s232 1), p2:(NEQ s170 1), p3:(NEQ s172 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA BART-PT-005-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-005-00 finished in 867 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F((p0&&X(G(p1)))) U p2)))], workingDir=/home/mcc/execution]
Support contains 3 out of 320 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 320/320 places, 670/670 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 300 transition count 650
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 300 transition count 650
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 53 place count 287 transition count 637
Iterating global reduction 0 with 13 rules applied. Total rules applied 66 place count 287 transition count 637
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 72 place count 281 transition count 631
Iterating global reduction 0 with 6 rules applied. Total rules applied 78 place count 281 transition count 631
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 82 place count 277 transition count 627
Iterating global reduction 0 with 4 rules applied. Total rules applied 86 place count 277 transition count 627
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 90 place count 273 transition count 623
Iterating global reduction 0 with 4 rules applied. Total rules applied 94 place count 273 transition count 623
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 98 place count 269 transition count 619
Iterating global reduction 0 with 4 rules applied. Total rules applied 102 place count 269 transition count 619
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 106 place count 265 transition count 615
Iterating global reduction 0 with 4 rules applied. Total rules applied 110 place count 265 transition count 615
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 114 place count 261 transition count 611
Iterating global reduction 0 with 4 rules applied. Total rules applied 118 place count 261 transition count 611
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 122 place count 257 transition count 607
Iterating global reduction 0 with 4 rules applied. Total rules applied 126 place count 257 transition count 607
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 128 place count 255 transition count 605
Iterating global reduction 0 with 2 rules applied. Total rules applied 130 place count 255 transition count 605
Applied a total of 130 rules in 41 ms. Remains 255 /320 variables (removed 65) and now considering 605/670 (removed 65) transitions.
// Phase 1: matrix 605 rows 255 cols
[2021-06-08 18:35:05] [INFO ] Computed 5 place invariants in 2 ms
[2021-06-08 18:35:05] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 605 rows 255 cols
[2021-06-08 18:35:05] [INFO ] Computed 5 place invariants in 7 ms
[2021-06-08 18:35:05] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
// Phase 1: matrix 605 rows 255 cols
[2021-06-08 18:35:05] [INFO ] Computed 5 place invariants in 4 ms
[2021-06-08 18:35:05] [INFO ] Dead Transitions using invariants and state equation in 222 ms returned []
Finished structural reductions, in 1 iterations. Remains : 255/320 places, 605/670 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p2), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p1)]
Running random walk in product with property : BART-PT-005-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(EQ s0 1), p0:(EQ s116 1), p1:(EQ s30 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 351 ms.
Stack based approach found an accepted trace after 1892 steps with 0 reset with depth 1893 and stack size 1893 in 5 ms.
FORMULA BART-PT-005-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-005-01 finished in 964 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((G(p0) U p1)&&F(p2)))], workingDir=/home/mcc/execution]
Support contains 5 out of 320 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 320/320 places, 670/670 transitions.
Graph (trivial) has 657 edges and 320 vertex of which 312 / 320 are part of one of the 5 SCC in 6 ms
Free SCC test removed 307 places
Ensure Unique test removed 651 transitions
Reduce isomorphic transitions removed 651 transitions.
Reduce places removed 1 places and 0 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 1 rules applied. Total rules applied 2 place count 12 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 11 transition count 18
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 7 place count 11 transition count 14
Applied a total of 7 rules in 16 ms. Remains 11 /320 variables (removed 309) and now considering 14/670 (removed 656) transitions.
// Phase 1: matrix 14 rows 11 cols
[2021-06-08 18:35:06] [INFO ] Computed 4 place invariants in 1 ms
[2021-06-08 18:35:06] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 14 rows 11 cols
[2021-06-08 18:35:06] [INFO ] Computed 4 place invariants in 0 ms
[2021-06-08 18:35:06] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
[2021-06-08 18:35:06] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 14 rows 11 cols
[2021-06-08 18:35:06] [INFO ] Computed 4 place invariants in 0 ms
[2021-06-08 18:35:06] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 11/320 places, 14/670 transitions.
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : BART-PT-005-02 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 3}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s4 1) (EQ s3 1)), p0:(EQ s5 0), p2:(AND (NEQ s0 1) (NEQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BART-PT-005-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-005-02 finished in 236 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||G(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 320 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 320/320 places, 670/670 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 300 transition count 650
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 300 transition count 650
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 53 place count 287 transition count 637
Iterating global reduction 0 with 13 rules applied. Total rules applied 66 place count 287 transition count 637
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 73 place count 280 transition count 630
Iterating global reduction 0 with 7 rules applied. Total rules applied 80 place count 280 transition count 630
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 85 place count 275 transition count 625
Iterating global reduction 0 with 5 rules applied. Total rules applied 90 place count 275 transition count 625
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 95 place count 270 transition count 620
Iterating global reduction 0 with 5 rules applied. Total rules applied 100 place count 270 transition count 620
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 105 place count 265 transition count 615
Iterating global reduction 0 with 5 rules applied. Total rules applied 110 place count 265 transition count 615
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 115 place count 260 transition count 610
Iterating global reduction 0 with 5 rules applied. Total rules applied 120 place count 260 transition count 610
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 125 place count 255 transition count 605
Iterating global reduction 0 with 5 rules applied. Total rules applied 130 place count 255 transition count 605
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 135 place count 250 transition count 600
Iterating global reduction 0 with 5 rules applied. Total rules applied 140 place count 250 transition count 600
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 143 place count 247 transition count 597
Iterating global reduction 0 with 3 rules applied. Total rules applied 146 place count 247 transition count 597
Applied a total of 146 rules in 32 ms. Remains 247 /320 variables (removed 73) and now considering 597/670 (removed 73) transitions.
// Phase 1: matrix 597 rows 247 cols
[2021-06-08 18:35:06] [INFO ] Computed 5 place invariants in 2 ms
[2021-06-08 18:35:06] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 597 rows 247 cols
[2021-06-08 18:35:06] [INFO ] Computed 5 place invariants in 7 ms
[2021-06-08 18:35:06] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
// Phase 1: matrix 597 rows 247 cols
[2021-06-08 18:35:06] [INFO ] Computed 5 place invariants in 10 ms
[2021-06-08 18:35:07] [INFO ] Dead Transitions using invariants and state equation in 207 ms returned []
Finished structural reductions, in 1 iterations. Remains : 247/320 places, 597/670 transitions.
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : BART-PT-005-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s133 1), p1:(NEQ s70 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 44 reset in 172 ms.
Stack based approach found an accepted trace after 1288 steps with 1 reset with depth 1023 and stack size 1023 in 2 ms.
FORMULA BART-PT-005-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-005-03 finished in 745 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0) U X(p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 320 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 320/320 places, 670/670 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 302 transition count 652
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 302 transition count 652
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 48 place count 290 transition count 640
Iterating global reduction 0 with 12 rules applied. Total rules applied 60 place count 290 transition count 640
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 66 place count 284 transition count 634
Iterating global reduction 0 with 6 rules applied. Total rules applied 72 place count 284 transition count 634
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 77 place count 279 transition count 629
Iterating global reduction 0 with 5 rules applied. Total rules applied 82 place count 279 transition count 629
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 87 place count 274 transition count 624
Iterating global reduction 0 with 5 rules applied. Total rules applied 92 place count 274 transition count 624
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 97 place count 269 transition count 619
Iterating global reduction 0 with 5 rules applied. Total rules applied 102 place count 269 transition count 619
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 107 place count 264 transition count 614
Iterating global reduction 0 with 5 rules applied. Total rules applied 112 place count 264 transition count 614
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 117 place count 259 transition count 609
Iterating global reduction 0 with 5 rules applied. Total rules applied 122 place count 259 transition count 609
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 127 place count 254 transition count 604
Iterating global reduction 0 with 5 rules applied. Total rules applied 132 place count 254 transition count 604
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 135 place count 251 transition count 601
Iterating global reduction 0 with 3 rules applied. Total rules applied 138 place count 251 transition count 601
Applied a total of 138 rules in 28 ms. Remains 251 /320 variables (removed 69) and now considering 601/670 (removed 69) transitions.
// Phase 1: matrix 601 rows 251 cols
[2021-06-08 18:35:07] [INFO ] Computed 5 place invariants in 5 ms
[2021-06-08 18:35:07] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 601 rows 251 cols
[2021-06-08 18:35:07] [INFO ] Computed 5 place invariants in 2 ms
[2021-06-08 18:35:07] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
// Phase 1: matrix 601 rows 251 cols
[2021-06-08 18:35:07] [INFO ] Computed 5 place invariants in 4 ms
[2021-06-08 18:35:07] [INFO ] Dead Transitions using invariants and state equation in 205 ms returned []
Finished structural reductions, in 1 iterations. Remains : 251/320 places, 601/670 transitions.
Stuttering acceptance computed with spot in 189 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : BART-PT-005-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (NEQ s85 1) (NEQ s198 1)), p1:(EQ s99 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 422 steps with 0 reset in 2 ms.
FORMULA BART-PT-005-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-005-04 finished in 632 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||(p1&&G(F(p1))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 320 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 320/320 places, 670/670 transitions.
Graph (trivial) has 664 edges and 320 vertex of which 317 / 320 are part of one of the 5 SCC in 2 ms
Free SCC test removed 312 places
Ensure Unique test removed 660 transitions
Reduce isomorphic transitions removed 660 transitions.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 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 5 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 5 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 7 place count 4 transition count 5
Applied a total of 7 rules in 10 ms. Remains 4 /320 variables (removed 316) and now considering 5/670 (removed 665) transitions.
// Phase 1: matrix 5 rows 4 cols
[2021-06-08 18:35:08] [INFO ] Computed 2 place invariants in 0 ms
[2021-06-08 18:35:08] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2021-06-08 18:35:08] [INFO ] Computed 2 place invariants in 0 ms
[2021-06-08 18:35:08] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 20 ms to find 0 implicit places.
[2021-06-08 18:35:08] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2021-06-08 18:35:08] [INFO ] Computed 2 place invariants in 0 ms
[2021-06-08 18:35:08] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/320 places, 5/670 transitions.
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BART-PT-005-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s1 1), p1:(NEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA BART-PT-005-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-005-05 finished in 129 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 320 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 320/320 places, 670/670 transitions.
Graph (trivial) has 666 edges and 320 vertex of which 315 / 320 are part of one of the 5 SCC in 1 ms
Free SCC test removed 310 places
Ensure Unique test removed 658 transitions
Reduce isomorphic transitions removed 658 transitions.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 3 rules applied. Total rules applied 4 place count 7 transition count 9
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 6 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 5 transition count 8
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 9 place count 5 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 9 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 3 with 2 rules applied. Total rules applied 11 place count 4 transition count 5
Applied a total of 11 rules in 4 ms. Remains 4 /320 variables (removed 316) and now considering 5/670 (removed 665) transitions.
// Phase 1: matrix 5 rows 4 cols
[2021-06-08 18:35:08] [INFO ] Computed 2 place invariants in 1 ms
[2021-06-08 18:35:08] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2021-06-08 18:35:08] [INFO ] Computed 2 place invariants in 1 ms
[2021-06-08 18:35:08] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 15 ms to find 0 implicit places.
[2021-06-08 18:35:08] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2021-06-08 18:35:08] [INFO ] Computed 2 place invariants in 1 ms
[2021-06-08 18:35:08] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/320 places, 5/670 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : BART-PT-005-07 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 s1 1) (NEQ s0 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BART-PT-005-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-005-07 finished in 79 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(X(p0))||F(p1)||G(p2)))], workingDir=/home/mcc/execution]
Support contains 2 out of 320 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 320/320 places, 670/670 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 301 transition count 651
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 301 transition count 651
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 50 place count 289 transition count 639
Iterating global reduction 0 with 12 rules applied. Total rules applied 62 place count 289 transition count 639
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 67 place count 284 transition count 634
Iterating global reduction 0 with 5 rules applied. Total rules applied 72 place count 284 transition count 634
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 75 place count 281 transition count 631
Iterating global reduction 0 with 3 rules applied. Total rules applied 78 place count 281 transition count 631
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 81 place count 278 transition count 628
Iterating global reduction 0 with 3 rules applied. Total rules applied 84 place count 278 transition count 628
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 87 place count 275 transition count 625
Iterating global reduction 0 with 3 rules applied. Total rules applied 90 place count 275 transition count 625
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 93 place count 272 transition count 622
Iterating global reduction 0 with 3 rules applied. Total rules applied 96 place count 272 transition count 622
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 99 place count 269 transition count 619
Iterating global reduction 0 with 3 rules applied. Total rules applied 102 place count 269 transition count 619
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 105 place count 266 transition count 616
Iterating global reduction 0 with 3 rules applied. Total rules applied 108 place count 266 transition count 616
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 110 place count 264 transition count 614
Iterating global reduction 0 with 2 rules applied. Total rules applied 112 place count 264 transition count 614
Applied a total of 112 rules in 30 ms. Remains 264 /320 variables (removed 56) and now considering 614/670 (removed 56) transitions.
// Phase 1: matrix 614 rows 264 cols
[2021-06-08 18:35:08] [INFO ] Computed 5 place invariants in 6 ms
[2021-06-08 18:35:08] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 614 rows 264 cols
[2021-06-08 18:35:08] [INFO ] Computed 5 place invariants in 8 ms
[2021-06-08 18:35:08] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
// Phase 1: matrix 614 rows 264 cols
[2021-06-08 18:35:08] [INFO ] Computed 5 place invariants in 5 ms
[2021-06-08 18:35:08] [INFO ] Dead Transitions using invariants and state equation in 195 ms returned []
Finished structural reductions, in 1 iterations. Remains : 264/320 places, 614/670 transitions.
Stuttering acceptance computed with spot in 247 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : BART-PT-005-09 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=2 dest: 6}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=6 dest: 6}]], initial=5, aps=[p1:(EQ s57 1), p0:(EQ s30 1), p2:(NEQ s30 0)], 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]]
Product exploration explored 100000 steps with 391 reset in 206 ms.
Stack based approach found an accepted trace after 1434 steps with 4 reset with depth 387 and stack size 387 in 4 ms.
FORMULA BART-PT-005-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-005-09 finished in 883 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0) U G(p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 320 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 320/320 places, 670/670 transitions.
Graph (trivial) has 628 edges and 320 vertex of which 244 / 320 are part of one of the 4 SCC in 1 ms
Free SCC test removed 240 places
Ensure Unique test removed 517 transitions
Reduce isomorphic transitions removed 517 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 78 transition count 140
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 26 place count 66 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 26 place count 66 transition count 138
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 30 place count 64 transition count 138
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 32 place count 62 transition count 136
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 62 transition count 136
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 36 place count 60 transition count 134
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 60 transition count 134
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 40 place count 58 transition count 132
Iterating global reduction 2 with 2 rules applied. Total rules applied 42 place count 58 transition count 132
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 44 place count 56 transition count 130
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 56 transition count 130
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 48 place count 54 transition count 128
Iterating global reduction 2 with 2 rules applied. Total rules applied 50 place count 54 transition count 128
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 52 place count 52 transition count 126
Iterating global reduction 2 with 2 rules applied. Total rules applied 54 place count 52 transition count 126
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 56 place count 50 transition count 124
Iterating global reduction 2 with 2 rules applied. Total rules applied 58 place count 50 transition count 124
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 76 place count 41 transition count 115
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 79 place count 41 transition count 112
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 83 place count 39 transition count 110
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 87 place count 39 transition count 106
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 91 place count 37 transition count 104
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 95 place count 37 transition count 100
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 99 place count 35 transition count 98
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 103 place count 35 transition count 94
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 107 place count 33 transition count 92
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 111 place count 33 transition count 88
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 115 place count 31 transition count 86
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 119 place count 31 transition count 82
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 123 place count 29 transition count 80
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 127 place count 29 transition count 76
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 131 place count 27 transition count 74
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 135 place count 27 transition count 70
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 139 place count 25 transition count 68
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 143 place count 25 transition count 64
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 147 place count 23 transition count 62
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 151 place count 23 transition count 58
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 4 rules applied. Total rules applied 155 place count 21 transition count 56
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 159 place count 21 transition count 52
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 13 with 4 rules applied. Total rules applied 163 place count 19 transition count 50
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 167 place count 19 transition count 46
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 14 with 4 rules applied. Total rules applied 171 place count 17 transition count 44
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 175 place count 17 transition count 40
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 15 with 4 rules applied. Total rules applied 179 place count 15 transition count 38
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 183 place count 15 transition count 34
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 16 with 4 rules applied. Total rules applied 187 place count 13 transition count 32
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 191 place count 13 transition count 28
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 17 with 4 rules applied. Total rules applied 195 place count 11 transition count 26
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 199 place count 11 transition count 22
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 18 with 4 rules applied. Total rules applied 203 place count 9 transition count 20
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 18 with 4 rules applied. Total rules applied 207 place count 9 transition count 16
Performed 2 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 19 with 4 rules applied. Total rules applied 211 place count 7 transition count 13
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 213 place count 7 transition count 11
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 20 with 2 rules applied. Total rules applied 215 place count 7 transition count 9
Applied a total of 215 rules in 38 ms. Remains 7 /320 variables (removed 313) and now considering 9/670 (removed 661) transitions.
// Phase 1: matrix 9 rows 7 cols
[2021-06-08 18:35:09] [INFO ] Computed 3 place invariants in 0 ms
[2021-06-08 18:35:09] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 9 rows 7 cols
[2021-06-08 18:35:09] [INFO ] Computed 3 place invariants in 0 ms
[2021-06-08 18:35:09] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 23 ms to find 0 implicit places.
[2021-06-08 18:35:09] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 7 cols
[2021-06-08 18:35:09] [INFO ] Computed 3 place invariants in 1 ms
[2021-06-08 18:35:09] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 7/320 places, 9/670 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : BART-PT-005-10 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(NEQ s4 1), p0:(AND (EQ s2 1) (EQ s0 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA BART-PT-005-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-005-10 finished in 179 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 320 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 320/320 places, 670/670 transitions.
Graph (trivial) has 668 edges and 320 vertex of which 311 / 320 are part of one of the 5 SCC in 1 ms
Free SCC test removed 306 places
Ensure Unique test removed 648 transitions
Reduce isomorphic transitions removed 648 transitions.
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 4 rules applied. Total rules applied 5 place count 10 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 1 with 3 rules applied. Total rules applied 8 place count 9 transition count 16
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 11 place count 8 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 3 with 3 rules applied. Total rules applied 14 place count 7 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 4 with 3 rules applied. Total rules applied 17 place count 6 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 5 with 3 rules applied. Total rules applied 20 place count 5 transition count 8
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 6 with 3 rules applied. Total rules applied 23 place count 4 transition count 6
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 25 place count 3 transition count 5
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 26 place count 3 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 26 place count 3 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 28 place count 2 transition count 3
Applied a total of 28 rules in 4 ms. Remains 2 /320 variables (removed 318) and now considering 3/670 (removed 667) transitions.
// Phase 1: matrix 3 rows 2 cols
[2021-06-08 18:35:09] [INFO ] Computed 1 place invariants in 0 ms
[2021-06-08 18:35:09] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-06-08 18:35:09] [INFO ] Computed 1 place invariants in 1 ms
[2021-06-08 18:35:09] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 21 ms to find 0 implicit places.
[2021-06-08 18:35:09] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-06-08 18:35:09] [INFO ] Computed 1 place invariants in 0 ms
[2021-06-08 18:35:09] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/320 places, 3/670 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : BART-PT-005-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s0 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-005-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-005-11 finished in 76 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 320 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 320/320 places, 670/670 transitions.
Graph (trivial) has 668 edges and 320 vertex of which 319 / 320 are part of one of the 5 SCC in 2 ms
Free SCC test removed 314 places
Ensure Unique test removed 663 transitions
Reduce isomorphic transitions removed 663 transitions.
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 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 5 place count 2 transition count 3
Applied a total of 5 rules in 6 ms. Remains 2 /320 variables (removed 318) and now considering 3/670 (removed 667) transitions.
// Phase 1: matrix 3 rows 2 cols
[2021-06-08 18:35:09] [INFO ] Computed 1 place invariants in 0 ms
[2021-06-08 18:35:09] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-06-08 18:35:09] [INFO ] Computed 1 place invariants in 0 ms
[2021-06-08 18:35:09] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 20 ms to find 0 implicit places.
[2021-06-08 18:35:09] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-06-08 18:35:09] [INFO ] Computed 1 place invariants in 0 ms
[2021-06-08 18:35:09] [INFO ] Dead Transitions using invariants and state equation in 6 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/320 places, 3/670 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : BART-PT-005-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s0 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-005-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-005-12 finished in 92 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((!p0&&X((G(p1)&&X(G(!p0))))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 320 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 320/320 places, 670/670 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 299 transition count 649
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 299 transition count 649
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 56 place count 285 transition count 635
Iterating global reduction 0 with 14 rules applied. Total rules applied 70 place count 285 transition count 635
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 77 place count 278 transition count 628
Iterating global reduction 0 with 7 rules applied. Total rules applied 84 place count 278 transition count 628
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 89 place count 273 transition count 623
Iterating global reduction 0 with 5 rules applied. Total rules applied 94 place count 273 transition count 623
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 99 place count 268 transition count 618
Iterating global reduction 0 with 5 rules applied. Total rules applied 104 place count 268 transition count 618
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 109 place count 263 transition count 613
Iterating global reduction 0 with 5 rules applied. Total rules applied 114 place count 263 transition count 613
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 119 place count 258 transition count 608
Iterating global reduction 0 with 5 rules applied. Total rules applied 124 place count 258 transition count 608
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 129 place count 253 transition count 603
Iterating global reduction 0 with 5 rules applied. Total rules applied 134 place count 253 transition count 603
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 139 place count 248 transition count 598
Iterating global reduction 0 with 5 rules applied. Total rules applied 144 place count 248 transition count 598
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 147 place count 245 transition count 595
Iterating global reduction 0 with 3 rules applied. Total rules applied 150 place count 245 transition count 595
Applied a total of 150 rules in 44 ms. Remains 245 /320 variables (removed 75) and now considering 595/670 (removed 75) transitions.
// Phase 1: matrix 595 rows 245 cols
[2021-06-08 18:35:09] [INFO ] Computed 5 place invariants in 3 ms
[2021-06-08 18:35:09] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 595 rows 245 cols
[2021-06-08 18:35:09] [INFO ] Computed 5 place invariants in 2 ms
[2021-06-08 18:35:09] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
// Phase 1: matrix 595 rows 245 cols
[2021-06-08 18:35:09] [INFO ] Computed 5 place invariants in 2 ms
[2021-06-08 18:35:09] [INFO ] Dead Transitions using invariants and state equation in 204 ms returned []
Finished structural reductions, in 1 iterations. Remains : 245/320 places, 595/670 transitions.
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), true, (OR (NOT p1) p0)]
Running random walk in product with property : BART-PT-005-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(OR p0 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s0 1), p1:(EQ s199 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 0 ms.
FORMULA BART-PT-005-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-005-13 finished in 552 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 320 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 320/320 places, 670/670 transitions.
Graph (trivial) has 666 edges and 320 vertex of which 309 / 320 are part of one of the 5 SCC in 1 ms
Free SCC test removed 304 places
Ensure Unique test removed 645 transitions
Reduce isomorphic transitions removed 645 transitions.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 3 rules applied. Total rules applied 4 place count 13 transition count 22
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 7 place count 12 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 2 with 3 rules applied. Total rules applied 10 place count 11 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 3 with 3 rules applied. Total rules applied 13 place count 10 transition count 16
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 16 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 5 with 3 rules applied. Total rules applied 19 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 6 with 3 rules applied. Total rules applied 22 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 7 with 3 rules applied. Total rules applied 25 place count 6 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 26 place count 5 transition count 8
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 28 place count 5 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 28 place count 5 transition count 5
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 30 place count 4 transition count 5
Applied a total of 30 rules in 11 ms. Remains 4 /320 variables (removed 316) and now considering 5/670 (removed 665) transitions.
// Phase 1: matrix 5 rows 4 cols
[2021-06-08 18:35:10] [INFO ] Computed 2 place invariants in 0 ms
[2021-06-08 18:35:10] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2021-06-08 18:35:10] [INFO ] Computed 2 place invariants in 0 ms
[2021-06-08 18:35:10] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 20 ms to find 0 implicit places.
[2021-06-08 18:35:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2021-06-08 18:35:10] [INFO ] Computed 2 place invariants in 0 ms
[2021-06-08 18:35:10] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/320 places, 5/670 transitions.
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : BART-PT-005-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s0 1), p1:(EQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BART-PT-005-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-005-14 finished in 161 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((X((p1 U (p2||G(p1))))&&p0))))], workingDir=/home/mcc/execution]
Support contains 3 out of 320 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 320/320 places, 670/670 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 299 transition count 649
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 299 transition count 649
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 56 place count 285 transition count 635
Iterating global reduction 0 with 14 rules applied. Total rules applied 70 place count 285 transition count 635
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 77 place count 278 transition count 628
Iterating global reduction 0 with 7 rules applied. Total rules applied 84 place count 278 transition count 628
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 89 place count 273 transition count 623
Iterating global reduction 0 with 5 rules applied. Total rules applied 94 place count 273 transition count 623
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 99 place count 268 transition count 618
Iterating global reduction 0 with 5 rules applied. Total rules applied 104 place count 268 transition count 618
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 109 place count 263 transition count 613
Iterating global reduction 0 with 5 rules applied. Total rules applied 114 place count 263 transition count 613
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 119 place count 258 transition count 608
Iterating global reduction 0 with 5 rules applied. Total rules applied 124 place count 258 transition count 608
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 129 place count 253 transition count 603
Iterating global reduction 0 with 5 rules applied. Total rules applied 134 place count 253 transition count 603
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 139 place count 248 transition count 598
Iterating global reduction 0 with 5 rules applied. Total rules applied 144 place count 248 transition count 598
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 147 place count 245 transition count 595
Iterating global reduction 0 with 3 rules applied. Total rules applied 150 place count 245 transition count 595
Applied a total of 150 rules in 25 ms. Remains 245 /320 variables (removed 75) and now considering 595/670 (removed 75) transitions.
// Phase 1: matrix 595 rows 245 cols
[2021-06-08 18:35:10] [INFO ] Computed 5 place invariants in 4 ms
[2021-06-08 18:35:10] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 595 rows 245 cols
[2021-06-08 18:35:10] [INFO ] Computed 5 place invariants in 2 ms
[2021-06-08 18:35:10] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
// Phase 1: matrix 595 rows 245 cols
[2021-06-08 18:35:10] [INFO ] Computed 5 place invariants in 3 ms
[2021-06-08 18:35:10] [INFO ] Dead Transitions using invariants and state equation in 204 ms returned []
Finished structural reductions, in 1 iterations. Remains : 245/320 places, 595/670 transitions.
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : BART-PT-005-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (NEQ s0 1) (NEQ s59 1) (NEQ s86 1)), p2:(NEQ s86 1), p1:(AND (NEQ s0 1) (NEQ s59 1) (NEQ s86 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 18152 reset in 647 ms.
Product exploration explored 100000 steps with 18153 reset in 711 ms.
Knowledge obtained : [(NOT p0), p2, (NOT p1)]
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 18233 reset in 621 ms.
Product exploration explored 100000 steps with 18129 reset in 626 ms.
[2021-06-08 18:35:13] [INFO ] Flatten gal took : 20 ms
[2021-06-08 18:35:13] [INFO ] Flatten gal took : 20 ms
[2021-06-08 18:35:13] [INFO ] Time to serialize gal into /tmp/LTL14957359410804266545.gal : 11 ms
[2021-06-08 18:35:13] [INFO ] Time to serialize properties into /tmp/LTL878049377125919346.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/LTL14957359410804266545.gal, -t, CGAL, -LTL, /tmp/LTL878049377125919346.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/LTL14957359410804266545.gal -t CGAL -LTL /tmp/LTL878049377125919346.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F(("(((TrainState_1_0_0!=1)&&(TrainState_5_1_10!=1))&&(TrainState_2_1_15!=1))")&&(X(("(((TrainState_1_0_0!=1)&&(TrainState_5_1_10!=1))&&(TrainState_2_1_15!=1))")U(("(TrainState_2_1_15!=1)")||(G("(((TrainState_1_0_0!=1)&&(TrainState_5_1_10!=1))&&(TrainState_2_1_15!=1))")))))))))
Formula 0 simplified : !GF("(((TrainState_1_0_0!=1)&&(TrainState_5_1_10!=1))&&(TrainState_2_1_15!=1))" & X("(((TrainState_1_0_0!=1)&&(TrainState_5_1_10!=1))&&(TrainState_2_1_15!=1))" U ("(TrainState_2_1_15!=1)" | G"(((TrainState_1_0_0!=1)&&(TrainState_5_1_10!=1))&&(TrainState_2_1_15!=1))")))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
2 strongly connected components in search stack
3 transitions explored
2 items max in DFS search stack
617 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.21951,187764,1,0,11,1.09842e+06,28,0,6552,282541,34
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BART-PT-005-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property BART-PT-005-15 finished in 10563 ms.
All properties solved without resorting to model-checking.

BK_STOP 1623177321992

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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