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.r292-tall-162124156200252.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is GPUForwardProgress-PT-40b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r292-tall-162124156200252
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 16K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 152K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.8K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 79K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 12 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 12 07:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 12 07:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 12 07:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 3.2K May 11 18:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 11 18:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 11 15:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 11 15:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.3K May 12 04:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K May 12 04:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 4 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 136K May 12 08:13 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 GPUForwardProgress-PT-40b-00
FORMULA_NAME GPUForwardProgress-PT-40b-01
FORMULA_NAME GPUForwardProgress-PT-40b-02
FORMULA_NAME GPUForwardProgress-PT-40b-03
FORMULA_NAME GPUForwardProgress-PT-40b-04
FORMULA_NAME GPUForwardProgress-PT-40b-05
FORMULA_NAME GPUForwardProgress-PT-40b-06
FORMULA_NAME GPUForwardProgress-PT-40b-07
FORMULA_NAME GPUForwardProgress-PT-40b-08
FORMULA_NAME GPUForwardProgress-PT-40b-09
FORMULA_NAME GPUForwardProgress-PT-40b-10
FORMULA_NAME GPUForwardProgress-PT-40b-11
FORMULA_NAME GPUForwardProgress-PT-40b-12
FORMULA_NAME GPUForwardProgress-PT-40b-13
FORMULA_NAME GPUForwardProgress-PT-40b-14
FORMULA_NAME GPUForwardProgress-PT-40b-15

=== Now, execution of the tool begins

BK_START 1621280519657

Running Version 0
[2021-05-17 19:42:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-17 19:42:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 19:42:10] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2021-05-17 19:42:10] [INFO ] Transformed 796 places.
[2021-05-17 19:42:10] [INFO ] Transformed 837 transitions.
[2021-05-17 19:42:10] [INFO ] Found NUPN structural information;
[2021-05-17 19:42:10] [INFO ] Parsed PT model containing 796 places and 837 transitions in 121 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 19:42:10] [INFO ] Initial state test concluded for 2 properties.
FORMULA GPUForwardProgress-PT-40b-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-40b-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-40b-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-40b-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 796 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 796/796 places, 837/837 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 795 transition count 837
Discarding 77 places :
Symmetric choice reduction at 1 with 77 rule applications. Total rules 78 place count 718 transition count 760
Iterating global reduction 1 with 77 rules applied. Total rules applied 155 place count 718 transition count 760
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 191 place count 682 transition count 724
Iterating global reduction 1 with 36 rules applied. Total rules applied 227 place count 682 transition count 724
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 261 place count 682 transition count 690
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 262 place count 681 transition count 689
Iterating global reduction 2 with 1 rules applied. Total rules applied 263 place count 681 transition count 689
Applied a total of 263 rules in 206 ms. Remains 681 /796 variables (removed 115) and now considering 689/837 (removed 148) transitions.
// Phase 1: matrix 689 rows 681 cols
[2021-05-17 19:42:10] [INFO ] Computed 41 place invariants in 23 ms
[2021-05-17 19:42:10] [INFO ] Implicit Places using invariants in 292 ms returned []
// Phase 1: matrix 689 rows 681 cols
[2021-05-17 19:42:10] [INFO ] Computed 41 place invariants in 5 ms
[2021-05-17 19:42:11] [INFO ] Implicit Places using invariants and state equation in 418 ms returned []
Implicit Place search using SMT with State Equation took 735 ms to find 0 implicit places.
// Phase 1: matrix 689 rows 681 cols
[2021-05-17 19:42:11] [INFO ] Computed 41 place invariants in 4 ms
[2021-05-17 19:42:11] [INFO ] Dead Transitions using invariants and state equation in 320 ms returned []
Finished structural reductions, in 1 iterations. Remains : 681/796 places, 689/837 transitions.
[2021-05-17 19:42:11] [INFO ] Flatten gal took : 92 ms
[2021-05-17 19:42:11] [INFO ] Flatten gal took : 36 ms
[2021-05-17 19:42:12] [INFO ] Input system was already deterministic with 689 transitions.
Incomplete random walk after 100000 steps, including 294 resets, run finished after 448 ms. (steps per millisecond=223 ) properties (out of 23) seen :18
Running SMT prover for 5 properties.
// Phase 1: matrix 689 rows 681 cols
[2021-05-17 19:42:12] [INFO ] Computed 41 place invariants in 3 ms
[2021-05-17 19:42:12] [INFO ] [Real]Absence check using 0 positive and 41 generalized place invariants in 17 ms returned sat
[2021-05-17 19:42:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 19:42:12] [INFO ] [Real]Absence check using state equation in 181 ms returned sat
[2021-05-17 19:42:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 19:42:12] [INFO ] [Nat]Absence check using 0 positive and 41 generalized place invariants in 17 ms returned sat
[2021-05-17 19:42:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 19:42:13] [INFO ] [Nat]Absence check using state equation in 207 ms returned sat
[2021-05-17 19:42:13] [INFO ] Computed and/alt/rep : 683/978/683 causal constraints (skipped 5 transitions) in 42 ms.
[2021-05-17 19:42:14] [INFO ] Added : 194 causal constraints over 39 iterations in 1241 ms. Result :sat
[2021-05-17 19:42:14] [INFO ] [Real]Absence check using 0 positive and 41 generalized place invariants in 22 ms returned sat
[2021-05-17 19:42:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 19:42:14] [INFO ] [Real]Absence check using state equation in 183 ms returned sat
[2021-05-17 19:42:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 19:42:14] [INFO ] [Nat]Absence check using 0 positive and 41 generalized place invariants in 17 ms returned sat
[2021-05-17 19:42:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 19:42:15] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2021-05-17 19:42:15] [INFO ] Computed and/alt/rep : 683/978/683 causal constraints (skipped 5 transitions) in 36 ms.
[2021-05-17 19:42:16] [INFO ] Added : 204 causal constraints over 42 iterations in 1268 ms. Result :sat
[2021-05-17 19:42:16] [INFO ] [Real]Absence check using 0 positive and 41 generalized place invariants in 17 ms returned sat
[2021-05-17 19:42:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 19:42:16] [INFO ] [Real]Absence check using state equation in 170 ms returned sat
[2021-05-17 19:42:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 19:42:16] [INFO ] [Nat]Absence check using 0 positive and 41 generalized place invariants in 18 ms returned sat
[2021-05-17 19:42:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 19:42:16] [INFO ] [Nat]Absence check using state equation in 171 ms returned sat
[2021-05-17 19:42:16] [INFO ] Computed and/alt/rep : 683/978/683 causal constraints (skipped 5 transitions) in 29 ms.
[2021-05-17 19:42:18] [INFO ] Added : 251 causal constraints over 51 iterations in 1480 ms. Result :sat
[2021-05-17 19:42:18] [INFO ] [Real]Absence check using 0 positive and 41 generalized place invariants in 17 ms returned sat
[2021-05-17 19:42:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 19:42:18] [INFO ] [Real]Absence check using state equation in 171 ms returned sat
[2021-05-17 19:42:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 19:42:18] [INFO ] [Nat]Absence check using 0 positive and 41 generalized place invariants in 23 ms returned sat
[2021-05-17 19:42:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 19:42:18] [INFO ] [Nat]Absence check using state equation in 175 ms returned sat
[2021-05-17 19:42:18] [INFO ] Computed and/alt/rep : 683/978/683 causal constraints (skipped 5 transitions) in 32 ms.
[2021-05-17 19:42:20] [INFO ] Added : 224 causal constraints over 45 iterations in 1312 ms. Result :sat
[2021-05-17 19:42:20] [INFO ] [Real]Absence check using 0 positive and 41 generalized place invariants in 17 ms returned sat
[2021-05-17 19:42:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 19:42:20] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2021-05-17 19:42:20] [INFO ] Computed and/alt/rep : 683/978/683 causal constraints (skipped 5 transitions) in 42 ms.
[2021-05-17 19:42:20] [INFO ] Solution in real domain found non-integer solution.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 681 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 681/681 places, 689/689 transitions.
Graph (trivial) has 563 edges and 681 vertex of which 6 / 681 are part of one of the 1 SCC in 7 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 337 transitions
Trivial Post-agglo rules discarded 337 transitions
Performed 337 trivial Post agglomeration. Transition count delta: 337
Iterating post reduction 0 with 337 rules applied. Total rules applied 338 place count 675 transition count 345
Reduce places removed 337 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 347 rules applied. Total rules applied 685 place count 338 transition count 335
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 689 place count 335 transition count 334
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 690 place count 334 transition count 334
Performed 83 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 83 Pre rules applied. Total rules applied 690 place count 334 transition count 251
Deduced a syphon composed of 83 places in 1 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 4 with 166 rules applied. Total rules applied 856 place count 251 transition count 251
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 857 place count 250 transition count 250
Iterating global reduction 4 with 1 rules applied. Total rules applied 858 place count 250 transition count 250
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 858 place count 250 transition count 249
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 860 place count 249 transition count 249
Performed 118 Post agglomeration using F-continuation condition.Transition count delta: 118
Deduced a syphon composed of 118 places in 1 ms
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 4 with 236 rules applied. Total rules applied 1096 place count 131 transition count 131
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1097 place count 130 transition count 130
Applied a total of 1097 rules in 102 ms. Remains 130 /681 variables (removed 551) and now considering 130/689 (removed 559) transitions.
[2021-05-17 19:42:24] [INFO ] Flow matrix only has 91 transitions (discarded 39 similar events)
// Phase 1: matrix 91 rows 130 cols
[2021-05-17 19:42:24] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-17 19:42:24] [INFO ] Implicit Places using invariants in 160 ms returned []
[2021-05-17 19:42:24] [INFO ] Flow matrix only has 91 transitions (discarded 39 similar events)
// Phase 1: matrix 91 rows 130 cols
[2021-05-17 19:42:24] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-17 19:42:24] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-17 19:42:25] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
[2021-05-17 19:42:25] [INFO ] Redundant transitions in 3 ms returned []
[2021-05-17 19:42:25] [INFO ] Flow matrix only has 91 transitions (discarded 39 similar events)
// Phase 1: matrix 91 rows 130 cols
[2021-05-17 19:42:25] [INFO ] Computed 41 place invariants in 0 ms
[2021-05-17 19:42:25] [INFO ] Dead Transitions using invariants and state equation in 115 ms returned []
Finished structural reductions, in 1 iterations. Remains : 130/681 places, 130/689 transitions.
Stuttering acceptance computed with spot in 266 ms :[true, (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-40b-02 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (EQ s7 0) (EQ s63 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-40b-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40b-02 finished in 859 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(X((F(p0) U p1))) U ((X(X((F(p0) U p1)))&&p2)||X(X(G((F(p0) U p1)))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 681 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 681/681 places, 689/689 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 671 transition count 679
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 671 transition count 679
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 671 transition count 678
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 668 transition count 675
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 668 transition count 675
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 29 place count 668 transition count 673
Applied a total of 29 rules in 53 ms. Remains 668 /681 variables (removed 13) and now considering 673/689 (removed 16) transitions.
// Phase 1: matrix 673 rows 668 cols
[2021-05-17 19:42:25] [INFO ] Computed 41 place invariants in 3 ms
[2021-05-17 19:42:25] [INFO ] Implicit Places using invariants in 246 ms returned []
// Phase 1: matrix 673 rows 668 cols
[2021-05-17 19:42:25] [INFO ] Computed 41 place invariants in 3 ms
[2021-05-17 19:42:26] [INFO ] Implicit Places using invariants and state equation in 427 ms returned []
Implicit Place search using SMT with State Equation took 677 ms to find 0 implicit places.
// Phase 1: matrix 673 rows 668 cols
[2021-05-17 19:42:26] [INFO ] Computed 41 place invariants in 2 ms
[2021-05-17 19:42:26] [INFO ] Dead Transitions using invariants and state equation in 289 ms returned []
Finished structural reductions, in 1 iterations. Remains : 668/681 places, 673/689 transitions.
Stuttering acceptance computed with spot in 319 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-40b-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}, { cond=(NOT p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 7}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 9}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 2}], [{ cond=(NOT p1), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=7 dest: 7}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 8}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=7 dest: 9}], [{ cond=(NOT p0), acceptance={} source=8 dest: 10}], [{ cond=(NOT p0), acceptance={} source=9 dest: 8}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=9 dest: 9}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=9 dest: 9}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=10 dest: 5}]], initial=0, aps=[p2:(AND (NEQ s155 0) (NEQ s14 1)), p1:(EQ s139 1), p0:(AND (NEQ s211 0) (NEQ s186 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 329 steps with 0 reset in 4 ms.
FORMULA GPUForwardProgress-PT-40b-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40b-03 finished in 1385 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0 U (G(p1) U X((X(p3)||p2))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 681 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 681/681 places, 689/689 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 669 transition count 677
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 669 transition count 677
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 669 transition count 675
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 31 place count 664 transition count 670
Iterating global reduction 1 with 5 rules applied. Total rules applied 36 place count 664 transition count 670
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 40 place count 664 transition count 666
Applied a total of 40 rules in 42 ms. Remains 664 /681 variables (removed 17) and now considering 666/689 (removed 23) transitions.
// Phase 1: matrix 666 rows 664 cols
[2021-05-17 19:42:26] [INFO ] Computed 41 place invariants in 2 ms
[2021-05-17 19:42:27] [INFO ] Implicit Places using invariants in 145 ms returned []
// Phase 1: matrix 666 rows 664 cols
[2021-05-17 19:42:27] [INFO ] Computed 41 place invariants in 13 ms
[2021-05-17 19:42:27] [INFO ] Implicit Places using invariants and state equation in 422 ms returned []
Implicit Place search using SMT with State Equation took 569 ms to find 0 implicit places.
// Phase 1: matrix 666 rows 664 cols
[2021-05-17 19:42:27] [INFO ] Computed 41 place invariants in 4 ms
[2021-05-17 19:42:27] [INFO ] Dead Transitions using invariants and state equation in 272 ms returned []
Finished structural reductions, in 1 iterations. Remains : 664/681 places, 666/689 transitions.
Stuttering acceptance computed with spot in 323 ms :[(NOT p1), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), true, (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : GPUForwardProgress-PT-40b-04 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 9}], [{ cond=(AND p1 p2 (NOT p3)), acceptance={} source=1 dest: 0}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=1 dest: 9}], [{ cond=(OR (AND p1 p2) (AND p1 p3)), acceptance={0} source=2 dest: 0}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 9}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 6}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 7}, { cond=p0, acceptance={} source=3 dest: 12}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=4 dest: 10}], [{ cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=5 dest: 10}], [{ cond=(NOT p2), acceptance={} source=6 dest: 10}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=7 dest: 10}], [{ cond=true, acceptance={} source=8 dest: 3}], [{ cond=true, acceptance={0} source=9 dest: 9}], [{ cond=(NOT p3), acceptance={} source=10 dest: 9}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), acceptance={0} source=11 dest: 4}, { cond=(AND p1 (NOT p0) (NOT p2) (NOT p3)), acceptance={0} source=11 dest: 5}, { cond=(AND p0 (NOT p2) (NOT p3)), acceptance={0} source=11 dest: 11}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=12 dest: 4}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=12 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=12 dest: 11}]], initial=8, aps=[p1:(OR (EQ s67 0) (EQ s24 1)), p2:(OR (EQ s514 0) (EQ s126 1)), p3:(OR (EQ s514 0) (EQ s126 1)), p0:(OR (EQ s191 0) (EQ s160 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 538 ms.
Product exploration explored 100000 steps with 33333 reset in 422 ms.
Graph (complete) has 1035 edges and 664 vertex of which 620 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.2 ms
Knowledge obtained : [p1, p2, p3, p0]
Stuttering acceptance computed with spot in 332 ms :[(NOT p1), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), true, (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 33333 reset in 375 ms.
Product exploration explored 100000 steps with 33333 reset in 373 ms.
Applying partial POR strategy [true, true, true, false, false, false, false, false, false, true, true, false, false]
Stuttering acceptance computed with spot in 325 ms :[(NOT p1), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), true, (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Support contains 6 out of 664 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 664/664 places, 666/666 transitions.
Graph (trivial) has 535 edges and 664 vertex of which 6 / 664 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 318 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 318 rules applied. Total rules applied 319 place count 659 transition count 660
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 45 Pre rules applied. Total rules applied 319 place count 659 transition count 1471
Deduced a syphon composed of 363 places in 2 ms
Iterating global reduction 1 with 45 rules applied. Total rules applied 364 place count 659 transition count 1471
Discarding 195 places :
Symmetric choice reduction at 1 with 195 rule applications. Total rules 559 place count 464 transition count 820
Deduced a syphon composed of 168 places in 1 ms
Iterating global reduction 1 with 195 rules applied. Total rules applied 754 place count 464 transition count 820
Performed 117 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 285 places in 0 ms
Iterating global reduction 1 with 117 rules applied. Total rules applied 871 place count 464 transition count 820
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 873 place count 464 transition count 818
Discarding 81 places :
Symmetric choice reduction at 2 with 81 rule applications. Total rules 954 place count 383 transition count 737
Deduced a syphon composed of 204 places in 0 ms
Iterating global reduction 2 with 81 rules applied. Total rules applied 1035 place count 383 transition count 737
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 205 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1036 place count 383 transition count 737
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1037 place count 382 transition count 736
Deduced a syphon composed of 204 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1038 place count 382 transition count 736
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -345
Deduced a syphon composed of 244 places in 1 ms
Iterating global reduction 2 with 40 rules applied. Total rules applied 1078 place count 382 transition count 1081
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 1118 place count 342 transition count 1001
Deduced a syphon composed of 204 places in 1 ms
Iterating global reduction 2 with 40 rules applied. Total rules applied 1158 place count 342 transition count 1001
Deduced a syphon composed of 204 places in 1 ms
Applied a total of 1158 rules in 209 ms. Remains 342 /664 variables (removed 322) and now considering 1001/666 (removed -335) transitions.
[2021-05-17 19:42:40] [INFO ] Redundant transitions in 56 ms returned []
[2021-05-17 19:42:40] [INFO ] Flow matrix only has 857 transitions (discarded 144 similar events)
// Phase 1: matrix 857 rows 342 cols
[2021-05-17 19:42:40] [INFO ] Computed 41 place invariants in 4 ms
[2021-05-17 19:42:41] [INFO ] Dead Transitions using invariants and state equation in 531 ms returned []
Finished structural reductions, in 1 iterations. Remains : 342/664 places, 1001/666 transitions.
Product exploration explored 100000 steps with 33333 reset in 392 ms.
Product exploration explored 100000 steps with 33333 reset in 387 ms.
[2021-05-17 19:42:42] [INFO ] Flatten gal took : 32 ms
[2021-05-17 19:42:42] [INFO ] Flatten gal took : 29 ms
[2021-05-17 19:42:42] [INFO ] Time to serialize gal into /tmp/LTL10528875311912588497.gal : 15 ms
[2021-05-17 19:42:42] [INFO ] Time to serialize properties into /tmp/LTL3827689863674906969.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/LTL10528875311912588497.gal, -t, CGAL, -LTL, /tmp/LTL3827689863674906969.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/LTL10528875311912588497.gal -t CGAL -LTL /tmp/LTL3827689863674906969.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("((p221==0)||(p184==1))")U((G("((p72==0)||(p24==1))"))U(X(("((p609==0)||(p143==1))")||(X("((p609==0)||(p143==1))"))))))))
Formula 0 simplified : !X("((p221==0)||(p184==1))" U (G"((p72==0)||(p24==1))" U X("((p609==0)||(p143==1))" | X"((p609==0)||(p143==1))")))
Detected timeout of ITS tools.
[2021-05-17 19:42:57] [INFO ] Flatten gal took : 49 ms
[2021-05-17 19:42:57] [INFO ] Applying decomposition
[2021-05-17 19:42:57] [INFO ] Flatten gal took : 35 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph7030413635481284269.txt, -o, /tmp/graph7030413635481284269.bin, -w, /tmp/graph7030413635481284269.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph7030413635481284269.bin, -l, -1, -v, -w, /tmp/graph7030413635481284269.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 19:42:57] [INFO ] Decomposing Gal with order
[2021-05-17 19:42:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 19:42:57] [INFO ] Removed a total of 210 redundant transitions.
[2021-05-17 19:42:57] [INFO ] Flatten gal took : 85 ms
[2021-05-17 19:42:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2021-05-17 19:42:57] [INFO ] Time to serialize gal into /tmp/LTL3942384757031467322.gal : 12 ms
[2021-05-17 19:42:57] [INFO ] Time to serialize properties into /tmp/LTL15904578223661898023.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/LTL3942384757031467322.gal, -t, CGAL, -LTL, /tmp/LTL15904578223661898023.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3942384757031467322.gal -t CGAL -LTL /tmp/LTL15904578223661898023.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(("((i12.u88.p221==0)||(i9.u64.p184==1))")U((G("((i3.u28.p72==0)||(i1.i0.i2.u11.p24==1))"))U(X(("((i33.u216.p609==0)||(i7.u54.p143==1))")||(X("((i33.u216.p609==0)||(i7.u54.p143==1))"))))))))
Formula 0 simplified : !X("((i12.u88.p221==0)||(i9.u64.p184==1))" U (G"((i3.u28.p72==0)||(i1.i0.i2.u11.p24==1))" U X("((i33.u216.p609==0)||(i7.u54.p143==1))" | X"((i33.u216.p609==0)||(i7.u54.p143==1))")))
Reverse transition relation is NOT exact ! Due to transitions t607, i0.i1.t121, i0.i1.i1.u233.t114, i2.t602, i2.u18.t595, i3.t589, i3.t581, i4.t574, i4.t567, i5.t560, i5.u38.t553, i6.t546, i6.u49.t539, i7.t532, i7.t525, i8.t518, i8.t508, i9.t501, i9.u64.t491, i10.t484, i10.u75.t477, i11.t470, i11.u81.t463, i12.t456, i12.t449, i13.t442, i13.t433, i14.t426, i14.t416, i15.t409, i15.u101.t401, i16.t386, i16.u109.t394, i17.t379, i17.t372, i18.t365, i18.t358, i19.t351, i19.t344, i20.t337, i20.u134.t328, i21.t321, i21.u140.t314, i22.t307, i22.u151.t297, i23.t290, i23.u152.t283, i24.t276, i24.t269, i25.t262, i25.t255, i26.t248, i26.u177.t241, i27.t234, i27.t227, i28.t220, i28.t212, i29.t205, i29.u192.t198, i30.t191, i30.u203.t184, i31.t177, i31.u209.t170, i32.t163, i32.u210.t156, i33.t149, i33.u220.t142, i34.t135, i34.t128, i35.t107, i35.t100, i36.t93, i36.u246.t85, i37.t71, i37.u252.t78, i38.t64, i38.t57, i39.t50, i39.u265.t43, i40.t36, i40.t29, i41.t23, i41.t12, i41.t2, i41.u277.t6, i41.u277.t7, i41.u277.t8, i41.u273.t24, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/578/88/666
Computing Next relation with stutter on 2.43153e+19 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
206 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,2.12875,75304,1,0,87233,346,5259,136290,149,644,652630
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA GPUForwardProgress-PT-40b-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property GPUForwardProgress-PT-40b-04 finished in 33145 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 681 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 681/681 places, 689/689 transitions.
Graph (trivial) has 563 edges and 681 vertex of which 6 / 681 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 337 transitions
Trivial Post-agglo rules discarded 337 transitions
Performed 337 trivial Post agglomeration. Transition count delta: 337
Iterating post reduction 0 with 337 rules applied. Total rules applied 338 place count 675 transition count 345
Reduce places removed 337 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 345 rules applied. Total rules applied 683 place count 338 transition count 337
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 685 place count 336 transition count 337
Performed 83 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 83 Pre rules applied. Total rules applied 685 place count 336 transition count 254
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 3 with 166 rules applied. Total rules applied 851 place count 253 transition count 254
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 852 place count 252 transition count 253
Iterating global reduction 3 with 1 rules applied. Total rules applied 853 place count 252 transition count 253
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 853 place count 252 transition count 252
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 855 place count 251 transition count 252
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 3 with 240 rules applied. Total rules applied 1095 place count 131 transition count 132
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 1097 place count 130 transition count 132
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 1099 place count 130 transition count 132
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1100 place count 129 transition count 131
Applied a total of 1100 rules in 49 ms. Remains 129 /681 variables (removed 552) and now considering 131/689 (removed 558) transitions.
[2021-05-17 19:43:00] [INFO ] Flow matrix only has 93 transitions (discarded 38 similar events)
// Phase 1: matrix 93 rows 129 cols
[2021-05-17 19:43:00] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-17 19:43:00] [INFO ] Implicit Places using invariants in 143 ms returned []
[2021-05-17 19:43:00] [INFO ] Flow matrix only has 93 transitions (discarded 38 similar events)
// Phase 1: matrix 93 rows 129 cols
[2021-05-17 19:43:00] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-17 19:43:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 19:43:00] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
[2021-05-17 19:43:00] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-17 19:43:00] [INFO ] Flow matrix only has 93 transitions (discarded 38 similar events)
// Phase 1: matrix 93 rows 129 cols
[2021-05-17 19:43:00] [INFO ] Computed 41 place invariants in 0 ms
[2021-05-17 19:43:00] [INFO ] Dead Transitions using invariants and state equation in 99 ms returned []
Finished structural reductions, in 1 iterations. Remains : 129/681 places, 131/689 transitions.
Stuttering acceptance computed with spot in 10369 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-40b-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s36 0) (EQ s58 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 6 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-40b-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40b-07 finished in 10890 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||X(p1)))], workingDir=/home/mcc/execution]
Support contains 4 out of 681 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 681/681 places, 689/689 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 671 transition count 679
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 671 transition count 679
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 671 transition count 677
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 26 place count 667 transition count 673
Iterating global reduction 1 with 4 rules applied. Total rules applied 30 place count 667 transition count 673
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 34 place count 667 transition count 669
Applied a total of 34 rules in 42 ms. Remains 667 /681 variables (removed 14) and now considering 669/689 (removed 20) transitions.
// Phase 1: matrix 669 rows 667 cols
[2021-05-17 19:43:11] [INFO ] Computed 41 place invariants in 2 ms
[2021-05-17 19:43:11] [INFO ] Implicit Places using invariants in 143 ms returned []
// Phase 1: matrix 669 rows 667 cols
[2021-05-17 19:43:11] [INFO ] Computed 41 place invariants in 2 ms
[2021-05-17 19:43:11] [INFO ] Implicit Places using invariants and state equation in 404 ms returned []
Implicit Place search using SMT with State Equation took 549 ms to find 0 implicit places.
// Phase 1: matrix 669 rows 667 cols
[2021-05-17 19:43:11] [INFO ] Computed 41 place invariants in 9 ms
[2021-05-17 19:43:11] [INFO ] Dead Transitions using invariants and state equation in 315 ms returned []
Finished structural reductions, in 1 iterations. Remains : 667/681 places, 669/689 transitions.
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-40b-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(AND (NEQ s569 0) (NEQ s664 1)), p0:(AND (NEQ s20 0) (NEQ s233 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-40b-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40b-08 finished in 1234 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((X(X(X((p1||(p2 U (G(p2)||(F(!p2)&&p3)))))))&&p0))))], workingDir=/home/mcc/execution]
Support contains 6 out of 681 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 681/681 places, 689/689 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 672 transition count 680
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 672 transition count 680
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 672 transition count 678
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 25 place count 667 transition count 673
Iterating global reduction 1 with 5 rules applied. Total rules applied 30 place count 667 transition count 673
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 34 place count 667 transition count 669
Applied a total of 34 rules in 40 ms. Remains 667 /681 variables (removed 14) and now considering 669/689 (removed 20) transitions.
// Phase 1: matrix 669 rows 667 cols
[2021-05-17 19:43:12] [INFO ] Computed 41 place invariants in 2 ms
[2021-05-17 19:43:12] [INFO ] Implicit Places using invariants in 146 ms returned []
// Phase 1: matrix 669 rows 667 cols
[2021-05-17 19:43:12] [INFO ] Computed 41 place invariants in 2 ms
[2021-05-17 19:43:12] [INFO ] Implicit Places using invariants and state equation in 380 ms returned []
Implicit Place search using SMT with State Equation took 535 ms to find 0 implicit places.
// Phase 1: matrix 669 rows 667 cols
[2021-05-17 19:43:12] [INFO ] Computed 41 place invariants in 2 ms
[2021-05-17 19:43:12] [INFO ] Dead Transitions using invariants and state equation in 286 ms returned []
Finished structural reductions, in 1 iterations. Remains : 667/681 places, 669/689 transitions.
Stuttering acceptance computed with spot in 387 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))]
Running random walk in product with property : GPUForwardProgress-PT-40b-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 3}, { cond=(NOT p0), acceptance={0} source=2 dest: 4}], [{ cond=p0, acceptance={0} source=3 dest: 5}, { cond=(NOT p0), acceptance={0} source=3 dest: 6}], [{ cond=p0, acceptance={0} source=4 dest: 7}, { cond=(NOT p0), acceptance={0} source=4 dest: 8}], [{ cond=(AND p0 (NOT p1) (NOT p3) (NOT p2)), acceptance={0} source=5 dest: 5}, { cond=(AND p0 (NOT p1) (NOT p3) p2), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={0} source=5 dest: 6}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={} source=5 dest: 6}], [{ cond=(AND p0 (NOT p1) (NOT p3) (NOT p2)), acceptance={0} source=6 dest: 7}, { cond=(AND p0 (NOT p1) (NOT p3) p2), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={0} source=6 dest: 8}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={} source=6 dest: 8}], [{ cond=(AND p0 (NOT p1) (NOT p3) (NOT p2)), acceptance={0} source=7 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={0} source=7 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p3) p2), acceptance={} source=7 dest: 9}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={} source=7 dest: 10}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={0} source=8 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p3) (NOT p2)), acceptance={0} source=8 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p3) p2), acceptance={} source=8 dest: 11}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={} source=8 dest: 12}], [{ cond=(AND p0 (NOT p3) (NOT p2)), acceptance={0} source=9 dest: 5}, { cond=(AND p0 (NOT p3) p2), acceptance={} source=9 dest: 5}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={0} source=9 dest: 6}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=9 dest: 6}], [{ cond=(AND p0 (NOT p3) (NOT p2)), acceptance={0} source=10 dest: 7}, { cond=(AND p0 (NOT p3) p2), acceptance={} source=10 dest: 7}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={0} source=10 dest: 8}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=10 dest: 8}], [{ cond=(AND p0 (NOT p3) (NOT p2)), acceptance={0} source=11 dest: 3}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={0} source=11 dest: 4}, { cond=(AND p0 (NOT p3) p2), acceptance={} source=11 dest: 9}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=11 dest: 10}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={0} source=12 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={0} source=12 dest: 2}, { cond=(AND p0 (NOT p3) p2), acceptance={} source=12 dest: 11}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=12 dest: 12}]], initial=0, aps=[p0:(AND (EQ s70 0) (EQ s499 1)), p1:(AND (NEQ s267 0) (NEQ s415 1)), p3:(AND (NEQ s240 0) (NEQ s22 1)), p2:(AND (NEQ s240 0) (NEQ s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 821 steps with 0 reset in 5 ms.
FORMULA GPUForwardProgress-PT-40b-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40b-09 finished in 1276 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0&&G(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 681 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 681/681 places, 689/689 transitions.
Graph (trivial) has 560 edges and 681 vertex of which 6 / 681 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 333 transitions
Trivial Post-agglo rules discarded 333 transitions
Performed 333 trivial Post agglomeration. Transition count delta: 333
Iterating post reduction 0 with 333 rules applied. Total rules applied 334 place count 675 transition count 349
Reduce places removed 333 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 341 rules applied. Total rules applied 675 place count 342 transition count 341
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 680 place count 339 transition count 339
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 682 place count 337 transition count 339
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 80 Pre rules applied. Total rules applied 682 place count 337 transition count 259
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 4 with 160 rules applied. Total rules applied 842 place count 257 transition count 259
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 843 place count 256 transition count 258
Iterating global reduction 4 with 1 rules applied. Total rules applied 844 place count 256 transition count 258
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 844 place count 256 transition count 257
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 846 place count 255 transition count 257
Performed 119 Post agglomeration using F-continuation condition.Transition count delta: 119
Deduced a syphon composed of 119 places in 1 ms
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 4 with 238 rules applied. Total rules applied 1084 place count 136 transition count 138
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
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 1088 place count 134 transition count 138
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1089 place count 133 transition count 137
Applied a total of 1089 rules in 44 ms. Remains 133 /681 variables (removed 548) and now considering 137/689 (removed 552) transitions.
[2021-05-17 19:43:13] [INFO ] Flow matrix only has 99 transitions (discarded 38 similar events)
// Phase 1: matrix 99 rows 133 cols
[2021-05-17 19:43:13] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-17 19:43:13] [INFO ] Implicit Places using invariants in 160 ms returned []
[2021-05-17 19:43:13] [INFO ] Flow matrix only has 99 transitions (discarded 38 similar events)
// Phase 1: matrix 99 rows 133 cols
[2021-05-17 19:43:13] [INFO ] Computed 41 place invariants in 0 ms
[2021-05-17 19:43:13] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-17 19:43:13] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
[2021-05-17 19:43:13] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-17 19:43:13] [INFO ] Flow matrix only has 99 transitions (discarded 38 similar events)
// Phase 1: matrix 99 rows 133 cols
[2021-05-17 19:43:13] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-17 19:43:13] [INFO ] Dead Transitions using invariants and state equation in 72 ms returned []
Finished structural reductions, in 1 iterations. Remains : 133/681 places, 137/689 transitions.
Stuttering acceptance computed with spot in 59 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-40b-10 automaton TGBA [mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s30 0) (EQ s67 1)), p1:(OR (EQ s72 0) (EQ s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-40b-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40b-10 finished in 483 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 681 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 681/681 places, 689/689 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 670 transition count 678
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 670 transition count 678
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 670 transition count 676
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 29 place count 665 transition count 671
Iterating global reduction 1 with 5 rules applied. Total rules applied 34 place count 665 transition count 671
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 38 place count 665 transition count 667
Applied a total of 38 rules in 46 ms. Remains 665 /681 variables (removed 16) and now considering 667/689 (removed 22) transitions.
// Phase 1: matrix 667 rows 665 cols
[2021-05-17 19:43:13] [INFO ] Computed 41 place invariants in 2 ms
[2021-05-17 19:43:14] [INFO ] Implicit Places using invariants in 152 ms returned []
// Phase 1: matrix 667 rows 665 cols
[2021-05-17 19:43:14] [INFO ] Computed 41 place invariants in 2 ms
[2021-05-17 19:43:14] [INFO ] Implicit Places using invariants and state equation in 382 ms returned []
Implicit Place search using SMT with State Equation took 534 ms to find 0 implicit places.
// Phase 1: matrix 667 rows 665 cols
[2021-05-17 19:43:14] [INFO ] Computed 41 place invariants in 2 ms
[2021-05-17 19:43:14] [INFO ] Dead Transitions using invariants and state equation in 280 ms returned []
Finished structural reductions, in 1 iterations. Remains : 665/681 places, 667/689 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-40b-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(NEQ s434 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][false, false, false]]
Stuttering criterion allowed to conclude after 329 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-40b-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40b-11 finished in 936 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(X(X(F(p0))))&&F(p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 681 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 681/681 places, 689/689 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 669 transition count 677
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 669 transition count 677
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 669 transition count 675
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 31 place count 664 transition count 670
Iterating global reduction 1 with 5 rules applied. Total rules applied 36 place count 664 transition count 670
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 40 place count 664 transition count 666
Applied a total of 40 rules in 42 ms. Remains 664 /681 variables (removed 17) and now considering 666/689 (removed 23) transitions.
// Phase 1: matrix 666 rows 664 cols
[2021-05-17 19:43:14] [INFO ] Computed 41 place invariants in 2 ms
[2021-05-17 19:43:14] [INFO ] Implicit Places using invariants in 136 ms returned []
// Phase 1: matrix 666 rows 664 cols
[2021-05-17 19:43:14] [INFO ] Computed 41 place invariants in 2 ms
[2021-05-17 19:43:15] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 516 ms to find 0 implicit places.
// Phase 1: matrix 666 rows 664 cols
[2021-05-17 19:43:15] [INFO ] Computed 41 place invariants in 2 ms
[2021-05-17 19:43:15] [INFO ] Dead Transitions using invariants and state equation in 285 ms returned []
Finished structural reductions, in 1 iterations. Remains : 664/681 places, 666/689 transitions.
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-40b-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s195 0) (EQ s557 1)), p0:(EQ s421 1)], nbAcceptance=0, 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]]
Stuttering criterion allowed to conclude after 329 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-40b-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40b-12 finished in 964 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 681 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 681/681 places, 689/689 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 669 transition count 677
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 669 transition count 677
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 669 transition count 675
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 31 place count 664 transition count 670
Iterating global reduction 1 with 5 rules applied. Total rules applied 36 place count 664 transition count 670
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 40 place count 664 transition count 666
Applied a total of 40 rules in 40 ms. Remains 664 /681 variables (removed 17) and now considering 666/689 (removed 23) transitions.
// Phase 1: matrix 666 rows 664 cols
[2021-05-17 19:43:15] [INFO ] Computed 41 place invariants in 2 ms
[2021-05-17 19:43:15] [INFO ] Implicit Places using invariants in 139 ms returned []
// Phase 1: matrix 666 rows 664 cols
[2021-05-17 19:43:15] [INFO ] Computed 41 place invariants in 2 ms
[2021-05-17 19:43:16] [INFO ] Implicit Places using invariants and state equation in 381 ms returned []
Implicit Place search using SMT with State Equation took 521 ms to find 0 implicit places.
// Phase 1: matrix 666 rows 664 cols
[2021-05-17 19:43:16] [INFO ] Computed 41 place invariants in 2 ms
[2021-05-17 19:43:16] [INFO ] Dead Transitions using invariants and state equation in 284 ms returned []
Finished structural reductions, in 1 iterations. Remains : 664/681 places, 666/689 transitions.
Stuttering acceptance computed with spot in 139 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-40b-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(NEQ s257 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 73100 steps with 217 reset in 148 ms.
FORMULA GPUForwardProgress-PT-40b-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40b-13 finished in 1142 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)&&X(X(G(p1))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 681 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 681/681 places, 689/689 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 670 transition count 678
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 670 transition count 678
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 670 transition count 676
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 28 place count 666 transition count 672
Iterating global reduction 1 with 4 rules applied. Total rules applied 32 place count 666 transition count 672
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 35 place count 666 transition count 669
Applied a total of 35 rules in 37 ms. Remains 666 /681 variables (removed 15) and now considering 669/689 (removed 20) transitions.
// Phase 1: matrix 669 rows 666 cols
[2021-05-17 19:43:16] [INFO ] Computed 41 place invariants in 2 ms
[2021-05-17 19:43:17] [INFO ] Implicit Places using invariants in 147 ms returned []
// Phase 1: matrix 669 rows 666 cols
[2021-05-17 19:43:17] [INFO ] Computed 41 place invariants in 2 ms
[2021-05-17 19:43:17] [INFO ] Implicit Places using invariants and state equation in 380 ms returned []
Implicit Place search using SMT with State Equation took 536 ms to find 0 implicit places.
// Phase 1: matrix 669 rows 666 cols
[2021-05-17 19:43:17] [INFO ] Computed 41 place invariants in 3 ms
[2021-05-17 19:43:17] [INFO ] Dead Transitions using invariants and state equation in 297 ms returned []
Finished structural reductions, in 1 iterations. Remains : 666/681 places, 669/689 transitions.
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-40b-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=p0, acceptance={1} source=0 dest: 1}, { cond=p0, acceptance={0, 1} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 0}, { cond=p0, acceptance={1} source=1 dest: 1}], [{ cond=p0, acceptance={1} source=2 dest: 3}, { cond=p0, acceptance={0, 1} source=2 dest: 4}, { cond=(NOT p0), acceptance={0, 1} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=3 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={1} source=4 dest: 3}, { cond=(AND p0 p1), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=4 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=5 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=5 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=5 dest: 2}, { cond=(AND p0 p1), acceptance={} source=5 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s619 1), p1:(EQ s229 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 395 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-40b-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40b-14 finished in 1038 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 681 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 681/681 places, 689/689 transitions.
Graph (trivial) has 564 edges and 681 vertex of which 6 / 681 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 337 transitions
Trivial Post-agglo rules discarded 337 transitions
Performed 337 trivial Post agglomeration. Transition count delta: 337
Iterating post reduction 0 with 337 rules applied. Total rules applied 338 place count 675 transition count 345
Reduce places removed 337 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 347 rules applied. Total rules applied 685 place count 338 transition count 335
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 689 place count 335 transition count 334
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 690 place count 334 transition count 334
Performed 82 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 82 Pre rules applied. Total rules applied 690 place count 334 transition count 252
Deduced a syphon composed of 82 places in 0 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 4 with 164 rules applied. Total rules applied 854 place count 252 transition count 252
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 855 place count 251 transition count 251
Iterating global reduction 4 with 1 rules applied. Total rules applied 856 place count 251 transition count 251
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 856 place count 251 transition count 250
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 858 place count 250 transition count 250
Performed 121 Post agglomeration using F-continuation condition.Transition count delta: 121
Deduced a syphon composed of 121 places in 0 ms
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 4 with 242 rules applied. Total rules applied 1100 place count 129 transition count 129
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1101 place count 128 transition count 128
Applied a total of 1101 rules in 31 ms. Remains 128 /681 variables (removed 553) and now considering 128/689 (removed 561) transitions.
[2021-05-17 19:43:17] [INFO ] Flow matrix only has 90 transitions (discarded 38 similar events)
// Phase 1: matrix 90 rows 128 cols
[2021-05-17 19:43:17] [INFO ] Computed 41 place invariants in 0 ms
[2021-05-17 19:43:18] [INFO ] Implicit Places using invariants in 104 ms returned []
[2021-05-17 19:43:18] [INFO ] Flow matrix only has 90 transitions (discarded 38 similar events)
// Phase 1: matrix 90 rows 128 cols
[2021-05-17 19:43:18] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-17 19:43:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 19:43:18] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
[2021-05-17 19:43:18] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-17 19:43:18] [INFO ] Flow matrix only has 90 transitions (discarded 38 similar events)
// Phase 1: matrix 90 rows 128 cols
[2021-05-17 19:43:18] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-17 19:43:18] [INFO ] Dead Transitions using invariants and state equation in 66 ms returned []
Finished structural reductions, in 1 iterations. Remains : 128/681 places, 128/689 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-40b-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 s103 0) (EQ s39 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 10 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-40b-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40b-15 finished in 377 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621280618047

--------------------
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="GPUForwardProgress-PT-40b"
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 GPUForwardProgress-PT-40b, 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 r292-tall-162124156200252"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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