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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 15K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 147K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 98K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 12 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 12 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 12 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 12 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 3.3K May 11 18:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 11 18:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 11 15:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 11 15:42 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 96K 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-28b-00
FORMULA_NAME GPUForwardProgress-PT-28b-01
FORMULA_NAME GPUForwardProgress-PT-28b-02
FORMULA_NAME GPUForwardProgress-PT-28b-03
FORMULA_NAME GPUForwardProgress-PT-28b-04
FORMULA_NAME GPUForwardProgress-PT-28b-05
FORMULA_NAME GPUForwardProgress-PT-28b-06
FORMULA_NAME GPUForwardProgress-PT-28b-07
FORMULA_NAME GPUForwardProgress-PT-28b-08
FORMULA_NAME GPUForwardProgress-PT-28b-09
FORMULA_NAME GPUForwardProgress-PT-28b-10
FORMULA_NAME GPUForwardProgress-PT-28b-11
FORMULA_NAME GPUForwardProgress-PT-28b-12
FORMULA_NAME GPUForwardProgress-PT-28b-13
FORMULA_NAME GPUForwardProgress-PT-28b-14
FORMULA_NAME GPUForwardProgress-PT-28b-15

=== Now, execution of the tool begins

BK_START 1621276054119

Running Version 0
[2021-05-17 18:27:35] [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-05-17 18:27:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 18:27:35] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2021-05-17 18:27:35] [INFO ] Transformed 568 places.
[2021-05-17 18:27:35] [INFO ] Transformed 597 transitions.
[2021-05-17 18:27:35] [INFO ] Found NUPN structural information;
[2021-05-17 18:27:35] [INFO ] Parsed PT model containing 568 places and 597 transitions in 108 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 18:27:35] [INFO ] Initial state test concluded for 4 properties.
FORMULA GPUForwardProgress-PT-28b-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 568 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 568/568 places, 597/597 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 567 transition count 597
Discarding 55 places :
Symmetric choice reduction at 1 with 55 rule applications. Total rules 56 place count 512 transition count 542
Iterating global reduction 1 with 55 rules applied. Total rules applied 111 place count 512 transition count 542
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 137 place count 486 transition count 516
Iterating global reduction 1 with 26 rules applied. Total rules applied 163 place count 486 transition count 516
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 187 place count 486 transition count 492
Applied a total of 187 rules in 114 ms. Remains 486 /568 variables (removed 82) and now considering 492/597 (removed 105) transitions.
// Phase 1: matrix 492 rows 486 cols
[2021-05-17 18:27:36] [INFO ] Computed 29 place invariants in 22 ms
[2021-05-17 18:27:36] [INFO ] Implicit Places using invariants in 244 ms returned []
// Phase 1: matrix 492 rows 486 cols
[2021-05-17 18:27:36] [INFO ] Computed 29 place invariants in 4 ms
[2021-05-17 18:27:36] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 555 ms to find 0 implicit places.
// Phase 1: matrix 492 rows 486 cols
[2021-05-17 18:27:36] [INFO ] Computed 29 place invariants in 2 ms
[2021-05-17 18:27:36] [INFO ] Dead Transitions using invariants and state equation in 330 ms returned []
Finished structural reductions, in 1 iterations. Remains : 486/568 places, 492/597 transitions.
[2021-05-17 18:27:37] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-17 18:27:37] [INFO ] Flatten gal took : 89 ms
FORMULA GPUForwardProgress-PT-28b-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-28b-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 18:27:37] [INFO ] Flatten gal took : 31 ms
[2021-05-17 18:27:37] [INFO ] Input system was already deterministic with 492 transitions.
Incomplete random walk after 100000 steps, including 412 resets, run finished after 364 ms. (steps per millisecond=274 ) properties (out of 30) seen :29
Running SMT prover for 1 properties.
// Phase 1: matrix 492 rows 486 cols
[2021-05-17 18:27:37] [INFO ] Computed 29 place invariants in 2 ms
[2021-05-17 18:27:37] [INFO ] [Real]Absence check using 0 positive and 29 generalized place invariants in 11 ms returned sat
[2021-05-17 18:27:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 18:27:37] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2021-05-17 18:27:38] [INFO ] Computed and/alt/rep : 486/806/486 causal constraints (skipped 5 transitions) in 32 ms.
[2021-05-17 18:27:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 18:27:38] [INFO ] [Nat]Absence check using 0 positive and 29 generalized place invariants in 17 ms returned sat
[2021-05-17 18:27:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 18:27:38] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2021-05-17 18:27:38] [INFO ] Computed and/alt/rep : 486/806/486 causal constraints (skipped 5 transitions) in 31 ms.
[2021-05-17 18:27:39] [INFO ] Added : 285 causal constraints over 57 iterations in 1560 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)&&F(p1)))], workingDir=/home/mcc/execution]
Support contains 4 out of 486 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 486/486 places, 492/492 transitions.
Graph (trivial) has 396 edges and 486 vertex of which 6 / 486 are part of one of the 1 SCC in 4 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 231 transitions
Trivial Post-agglo rules discarded 231 transitions
Performed 231 trivial Post agglomeration. Transition count delta: 231
Iterating post reduction 0 with 231 rules applied. Total rules applied 232 place count 480 transition count 254
Reduce places removed 231 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 237 rules applied. Total rules applied 469 place count 249 transition count 248
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 472 place count 247 transition count 247
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 473 place count 246 transition count 247
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 61 Pre rules applied. Total rules applied 473 place count 246 transition count 186
Deduced a syphon composed of 61 places in 1 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 4 with 122 rules applied. Total rules applied 595 place count 185 transition count 186
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 598 place count 182 transition count 183
Iterating global reduction 4 with 3 rules applied. Total rules applied 601 place count 182 transition count 183
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 84
Deduced a syphon composed of 84 places in 0 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 4 with 168 rules applied. Total rules applied 769 place count 98 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 770 place count 98 transition count 98
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 771 place count 97 transition count 97
Iterating global reduction 5 with 1 rules applied. Total rules applied 772 place count 97 transition count 97
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 774 place count 96 transition count 96
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 775 place count 95 transition count 95
Applied a total of 775 rules in 61 ms. Remains 95 /486 variables (removed 391) and now considering 95/492 (removed 397) transitions.
[2021-05-17 18:27:40] [INFO ] Flow matrix only has 69 transitions (discarded 26 similar events)
// Phase 1: matrix 69 rows 95 cols
[2021-05-17 18:27:40] [INFO ] Computed 29 place invariants in 0 ms
[2021-05-17 18:27:40] [INFO ] Implicit Places using invariants in 86 ms returned []
[2021-05-17 18:27:40] [INFO ] Flow matrix only has 69 transitions (discarded 26 similar events)
// Phase 1: matrix 69 rows 95 cols
[2021-05-17 18:27:40] [INFO ] Computed 29 place invariants in 1 ms
[2021-05-17 18:27:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 18:27:40] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2021-05-17 18:27:40] [INFO ] Redundant transitions in 2 ms returned []
[2021-05-17 18:27:40] [INFO ] Flow matrix only has 69 transitions (discarded 26 similar events)
// Phase 1: matrix 69 rows 95 cols
[2021-05-17 18:27:40] [INFO ] Computed 29 place invariants in 8 ms
[2021-05-17 18:27:40] [INFO ] Dead Transitions using invariants and state equation in 50 ms returned []
Finished structural reductions, in 1 iterations. Remains : 95/486 places, 95/492 transitions.
Stuttering acceptance computed with spot in 271 ms :[(NOT p0), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : GPUForwardProgress-PT-28b-00 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p0:(OR (EQ s34 0) (EQ s90 0) (EQ s94 0)), p1:(EQ s28 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 190 steps with 8 reset in 5 ms.
FORMULA GPUForwardProgress-PT-28b-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-28b-00 finished in 606 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G((p0 U p1))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 486 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 486/486 places, 492/492 transitions.
Graph (trivial) has 401 edges and 486 vertex of which 6 / 486 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 236 transitions
Trivial Post-agglo rules discarded 236 transitions
Performed 236 trivial Post agglomeration. Transition count delta: 236
Iterating post reduction 0 with 236 rules applied. Total rules applied 237 place count 480 transition count 249
Reduce places removed 236 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 242 rules applied. Total rules applied 479 place count 244 transition count 243
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 481 place count 242 transition count 243
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 481 place count 242 transition count 183
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 601 place count 182 transition count 183
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 3 with 170 rules applied. Total rules applied 771 place count 97 transition count 98
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 772 place count 97 transition count 97
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 773 place count 96 transition count 96
Iterating global reduction 4 with 1 rules applied. Total rules applied 774 place count 96 transition count 96
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 776 place count 95 transition count 95
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 777 place count 95 transition count 95
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 778 place count 94 transition count 94
Applied a total of 778 rules in 85 ms. Remains 94 /486 variables (removed 392) and now considering 94/492 (removed 398) transitions.
[2021-05-17 18:27:40] [INFO ] Flow matrix only has 68 transitions (discarded 26 similar events)
// Phase 1: matrix 68 rows 94 cols
[2021-05-17 18:27:40] [INFO ] Computed 29 place invariants in 2 ms
[2021-05-17 18:27:40] [INFO ] Implicit Places using invariants in 141 ms returned []
[2021-05-17 18:27:40] [INFO ] Flow matrix only has 68 transitions (discarded 26 similar events)
// Phase 1: matrix 68 rows 94 cols
[2021-05-17 18:27:40] [INFO ] Computed 29 place invariants in 2 ms
[2021-05-17 18:27:40] [INFO ] State equation strengthened by 29 read => feed constraints.
[2021-05-17 18:27:40] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
[2021-05-17 18:27:40] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-17 18:27:40] [INFO ] Flow matrix only has 68 transitions (discarded 26 similar events)
// Phase 1: matrix 68 rows 94 cols
[2021-05-17 18:27:40] [INFO ] Computed 29 place invariants in 1 ms
[2021-05-17 18:27:40] [INFO ] Dead Transitions using invariants and state equation in 62 ms returned []
Finished structural reductions, in 1 iterations. Remains : 94/486 places, 94/492 transitions.
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-28b-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(OR p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s90 1), p1:(EQ s66 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-28b-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-28b-01 finished in 577 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G((G(p0)||(p0&&F(p1))))||((G(p0)||(p0&&F(p1)))&&F(p2)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 486 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 486/486 places, 492/492 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 479 transition count 485
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 479 transition count 485
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 479 transition count 483
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 477 transition count 481
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 477 transition count 481
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 21 place count 477 transition count 480
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 476 transition count 479
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 476 transition count 479
Applied a total of 23 rules in 42 ms. Remains 476 /486 variables (removed 10) and now considering 479/492 (removed 13) transitions.
// Phase 1: matrix 479 rows 476 cols
[2021-05-17 18:27:41] [INFO ] Computed 29 place invariants in 2 ms
[2021-05-17 18:27:41] [INFO ] Implicit Places using invariants in 173 ms returned []
// Phase 1: matrix 479 rows 476 cols
[2021-05-17 18:27:41] [INFO ] Computed 29 place invariants in 2 ms
[2021-05-17 18:27:41] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 447 ms to find 0 implicit places.
// Phase 1: matrix 479 rows 476 cols
[2021-05-17 18:27:41] [INFO ] Computed 29 place invariants in 3 ms
[2021-05-17 18:27:41] [INFO ] Dead Transitions using invariants and state equation in 220 ms returned []
Finished structural reductions, in 1 iterations. Remains : 476/486 places, 479/492 transitions.
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (NOT p0), true, (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p1), (NOT p2)]
Running random walk in product with property : GPUForwardProgress-PT-28b-02 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(NEQ s255 1), p1:(NEQ s30 0), p2:(EQ s470 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 233 steps with 0 reset in 2 ms.
FORMULA GPUForwardProgress-PT-28b-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-28b-02 finished in 902 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((X((p0 U p1)) U (G(p2) U p3))))], workingDir=/home/mcc/execution]
Support contains 3 out of 486 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 486/486 places, 492/492 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 477 transition count 483
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 477 transition count 483
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 477 transition count 481
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 475 transition count 479
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 475 transition count 479
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 26 place count 475 transition count 477
Applied a total of 26 rules in 67 ms. Remains 475 /486 variables (removed 11) and now considering 477/492 (removed 15) transitions.
// Phase 1: matrix 477 rows 475 cols
[2021-05-17 18:27:42] [INFO ] Computed 29 place invariants in 2 ms
[2021-05-17 18:27:42] [INFO ] Implicit Places using invariants in 143 ms returned []
// Phase 1: matrix 477 rows 475 cols
[2021-05-17 18:27:42] [INFO ] Computed 29 place invariants in 2 ms
[2021-05-17 18:27:42] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
// Phase 1: matrix 477 rows 475 cols
[2021-05-17 18:27:42] [INFO ] Computed 29 place invariants in 2 ms
[2021-05-17 18:27:42] [INFO ] Dead Transitions using invariants and state equation in 200 ms returned []
Finished structural reductions, in 1 iterations. Remains : 475/486 places, 477/492 transitions.
Stuttering acceptance computed with spot in 238 ms :[(NOT p3), (NOT p1), (AND (NOT p1) (NOT p2)), false, (NOT p3), true, (NOT p2), (OR (AND p0 (NOT p3)) (AND p1 (NOT p3)))]
Running random walk in product with property : GPUForwardProgress-PT-28b-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={} source=0 dest: 3}, { cond=(NOT p3), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p3) p2 (NOT p1) (NOT p0)), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={} source=4 dest: 3}, { cond=(NOT p3), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 5}, { cond=p2, acceptance={} source=6 dest: 6}], [{ cond=(OR (AND (NOT p3) (NOT p2) p1) (AND (NOT p3) (NOT p2) p0)), acceptance={} source=7 dest: 5}, { cond=(OR (AND (NOT p3) p2 p1) (AND (NOT p3) p2 p0)), acceptance={} source=7 dest: 6}, { cond=(OR (AND (NOT p3) p2 p1) (AND (NOT p3) p2 p0)), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p3:(EQ s112 1), p2:(EQ s232 1), p1:(AND (NEQ s451 1) (EQ s112 1)), p0:(NEQ s451 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 233 steps with 0 reset in 2 ms.
FORMULA GPUForwardProgress-PT-28b-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-28b-03 finished in 940 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X((G(p1) U (p2&&G(p1))))||p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 486 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 486/486 places, 492/492 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 477 transition count 483
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 477 transition count 483
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 477 transition count 481
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 475 transition count 479
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 475 transition count 479
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 25 place count 475 transition count 478
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 474 transition count 477
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 474 transition count 477
Applied a total of 27 rules in 35 ms. Remains 474 /486 variables (removed 12) and now considering 477/492 (removed 15) transitions.
// Phase 1: matrix 477 rows 474 cols
[2021-05-17 18:27:43] [INFO ] Computed 29 place invariants in 5 ms
[2021-05-17 18:27:43] [INFO ] Implicit Places using invariants in 124 ms returned []
// Phase 1: matrix 477 rows 474 cols
[2021-05-17 18:27:43] [INFO ] Computed 29 place invariants in 2 ms
[2021-05-17 18:27:43] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
// Phase 1: matrix 477 rows 474 cols
[2021-05-17 18:27:43] [INFO ] Computed 29 place invariants in 1 ms
[2021-05-17 18:27:43] [INFO ] Dead Transitions using invariants and state equation in 198 ms returned []
Finished structural reductions, in 1 iterations. Remains : 474/486 places, 477/492 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p1), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-28b-04 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(AND p2 p1), acceptance={0} source=4 dest: 0}, { cond=(NOT p1), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(EQ s298 1), p0:(OR (EQ s298 1) (EQ s255 1)), p2:(EQ s255 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-28b-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-28b-04 finished in 737 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0&&X((X(p1) U ((p2&&X(p1))||X(G(p1)))))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 486 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 486/486 places, 492/492 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 476 transition count 482
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 476 transition count 482
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 476 transition count 480
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 25 place count 473 transition count 477
Iterating global reduction 1 with 3 rules applied. Total rules applied 28 place count 473 transition count 477
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 30 place count 473 transition count 475
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 472 transition count 474
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 472 transition count 474
Applied a total of 32 rules in 27 ms. Remains 472 /486 variables (removed 14) and now considering 474/492 (removed 18) transitions.
// Phase 1: matrix 474 rows 472 cols
[2021-05-17 18:27:43] [INFO ] Computed 29 place invariants in 1 ms
[2021-05-17 18:27:43] [INFO ] Implicit Places using invariants in 98 ms returned []
// Phase 1: matrix 474 rows 472 cols
[2021-05-17 18:27:43] [INFO ] Computed 29 place invariants in 1 ms
[2021-05-17 18:27:44] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
// Phase 1: matrix 474 rows 472 cols
[2021-05-17 18:27:44] [INFO ] Computed 29 place invariants in 2 ms
[2021-05-17 18:27:44] [INFO ] Dead Transitions using invariants and state equation in 201 ms returned []
Finished structural reductions, in 1 iterations. Remains : 472/486 places, 474/492 transitions.
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-28b-05 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 p0 p2), acceptance={0} source=2 dest: 3}, { cond=(NOT p0), acceptance={0} source=2 dest: 4}, { cond=(NOT p2), acceptance={0} source=2 dest: 5}], [{ cond=(AND p0 p2 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 2}], [{ cond=(AND p0 p2 (NOT p1)), acceptance={0} source=5 dest: 3}, { cond=(AND p0 p2 p1), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s355 1) (EQ s297 1)), p2:(NEQ s354 1), p1:(NEQ s297 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1298 reset in 332 ms.
Product exploration explored 100000 steps with 1284 reset in 245 ms.
Graph (complete) has 735 edges and 472 vertex of which 440 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.2 ms
Knowledge obtained : [(NOT p0), p2, p1]
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 1289 reset in 182 ms.
Product exploration explored 100000 steps with 1288 reset in 220 ms.
[2021-05-17 18:27:45] [INFO ] Flatten gal took : 27 ms
[2021-05-17 18:27:45] [INFO ] Flatten gal took : 22 ms
[2021-05-17 18:27:46] [INFO ] Time to serialize gal into /tmp/LTL4224606926017926588.gal : 28 ms
[2021-05-17 18:27:46] [INFO ] Time to serialize properties into /tmp/LTL15272419947246056101.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL4224606926017926588.gal, -t, CGAL, -LTL, /tmp/LTL15272419947246056101.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/LTL4224606926017926588.gal -t CGAL -LTL /tmp/LTL15272419947246056101.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F((X((X("(p350!=1)"))U((("(p419!=1)")&&(X("(p350!=1)")))||(X(G("(p350!=1)"))))))&&("((p420==1)||(p350==1))")))))
Formula 0 simplified : !GF("((p420==1)||(p350==1))" & X(X"(p350!=1)" U (("(p419!=1)" & X"(p350!=1)") | XG"(p350!=1)")))
Detected timeout of ITS tools.
[2021-05-17 18:28:01] [INFO ] Flatten gal took : 21 ms
[2021-05-17 18:28:01] [INFO ] Applying decomposition
[2021-05-17 18:28:01] [INFO ] Flatten gal took : 20 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/graph335212216128653390.txt, -o, /tmp/graph335212216128653390.bin, -w, /tmp/graph335212216128653390.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/graph335212216128653390.bin, -l, -1, -v, -w, /tmp/graph335212216128653390.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 18:28:01] [INFO ] Decomposing Gal with order
[2021-05-17 18:28:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 18:28:01] [INFO ] Removed a total of 66 redundant transitions.
[2021-05-17 18:28:01] [INFO ] Flatten gal took : 103 ms
[2021-05-17 18:28:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2021-05-17 18:28:01] [INFO ] Time to serialize gal into /tmp/LTL6867343283599483480.gal : 20 ms
[2021-05-17 18:28:01] [INFO ] Time to serialize properties into /tmp/LTL11564516651167671509.ltl : 15 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/LTL6867343283599483480.gal, -t, CGAL, -LTL, /tmp/LTL11564516651167671509.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/LTL6867343283599483480.gal -t CGAL -LTL /tmp/LTL11564516651167671509.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G(F((X((X("(i18.u129.p350!=1)"))U((("(i22.u153.p419!=1)")&&(X("(i18.u129.p350!=1)")))||(X(G("(i18.u129.p350!=1)"))))))&&("((i22.u153.p420==1)||(i18.u129.p350==1))")))))
Formula 0 simplified : !GF("((i22.u153.p420==1)||(i18.u129.p350==1))" & X(X"(i18.u129.p350!=1)" U (("(i22.u153.p419!=1)" & X"(i18.u129.p350!=1)") | XG"(i18.u129.p350!=1)")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin518526015283807519
[2021-05-17 18:28:16] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin518526015283807519
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin518526015283807519]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin518526015283807519] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin518526015283807519] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property GPUForwardProgress-PT-28b-05 finished in 33953 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||X((p1&&G(p2)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 486 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 486/486 places, 492/492 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 476 transition count 482
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 476 transition count 482
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 476 transition count 480
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 24 place count 474 transition count 478
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 474 transition count 478
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 27 place count 474 transition count 477
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 473 transition count 476
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 473 transition count 476
Applied a total of 29 rules in 58 ms. Remains 473 /486 variables (removed 13) and now considering 476/492 (removed 16) transitions.
// Phase 1: matrix 476 rows 473 cols
[2021-05-17 18:28:17] [INFO ] Computed 29 place invariants in 2 ms
[2021-05-17 18:28:17] [INFO ] Implicit Places using invariants in 193 ms returned []
// Phase 1: matrix 476 rows 473 cols
[2021-05-17 18:28:17] [INFO ] Computed 29 place invariants in 2 ms
[2021-05-17 18:28:18] [INFO ] Implicit Places using invariants and state equation in 443 ms returned []
Implicit Place search using SMT with State Equation took 639 ms to find 0 implicit places.
// Phase 1: matrix 476 rows 473 cols
[2021-05-17 18:28:18] [INFO ] Computed 29 place invariants in 1 ms
[2021-05-17 18:28:18] [INFO ] Dead Transitions using invariants and state equation in 224 ms returned []
Finished structural reductions, in 1 iterations. Remains : 473/486 places, 476/492 transitions.
Stuttering acceptance computed with spot in 160 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p2), (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : GPUForwardProgress-PT-28b-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p2), acceptance={} source=3 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=4 dest: 2}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={} source=4 dest: 5}, { cond=(AND p0 p1 p2), acceptance={} source=4 dest: 6}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=6 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND p0 p2), acceptance={} source=6 dest: 6}]], initial=1, aps=[p0:(EQ s256 1), p2:(AND (EQ s277 1) (NEQ s353 1)), p1:(EQ s246 0)], 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, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-28b-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-28b-06 finished in 1095 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||G(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 486 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 486/486 places, 492/492 transitions.
Graph (trivial) has 401 edges and 486 vertex of which 6 / 486 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 234 transitions
Trivial Post-agglo rules discarded 234 transitions
Performed 234 trivial Post agglomeration. Transition count delta: 234
Iterating post reduction 0 with 234 rules applied. Total rules applied 235 place count 480 transition count 251
Reduce places removed 234 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 240 rules applied. Total rules applied 475 place count 246 transition count 245
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 478 place count 244 transition count 244
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 479 place count 243 transition count 244
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 59 Pre rules applied. Total rules applied 479 place count 243 transition count 185
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 4 with 118 rules applied. Total rules applied 597 place count 184 transition count 185
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 598 place count 183 transition count 184
Iterating global reduction 4 with 1 rules applied. Total rules applied 599 place count 183 transition count 184
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 4 with 172 rules applied. Total rules applied 771 place count 97 transition count 98
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 772 place count 97 transition count 97
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 773 place count 96 transition count 96
Iterating global reduction 5 with 1 rules applied. Total rules applied 774 place count 96 transition count 96
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 776 place count 95 transition count 95
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 777 place count 94 transition count 94
Applied a total of 777 rules in 48 ms. Remains 94 /486 variables (removed 392) and now considering 94/492 (removed 398) transitions.
[2021-05-17 18:28:18] [INFO ] Flow matrix only has 69 transitions (discarded 25 similar events)
// Phase 1: matrix 69 rows 94 cols
[2021-05-17 18:28:18] [INFO ] Computed 29 place invariants in 0 ms
[2021-05-17 18:28:18] [INFO ] Implicit Places using invariants in 86 ms returned []
[2021-05-17 18:28:18] [INFO ] Flow matrix only has 69 transitions (discarded 25 similar events)
// Phase 1: matrix 69 rows 94 cols
[2021-05-17 18:28:18] [INFO ] Computed 29 place invariants in 0 ms
[2021-05-17 18:28:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 18:28:18] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2021-05-17 18:28:18] [INFO ] Redundant transitions in 2 ms returned []
[2021-05-17 18:28:18] [INFO ] Flow matrix only has 69 transitions (discarded 25 similar events)
// Phase 1: matrix 69 rows 94 cols
[2021-05-17 18:28:18] [INFO ] Computed 29 place invariants in 6 ms
[2021-05-17 18:28:19] [INFO ] Dead Transitions using invariants and state equation in 67 ms returned []
Finished structural reductions, in 1 iterations. Remains : 94/486 places, 94/492 transitions.
Stuttering acceptance computed with spot in 26 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-28b-07 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s13 0), p1:(NEQ s87 1)], nbAcceptance=2, 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 7 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-28b-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-28b-07 finished in 341 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 486 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 486/486 places, 492/492 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 476 transition count 482
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 476 transition count 482
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 476 transition count 480
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 25 place count 473 transition count 477
Iterating global reduction 1 with 3 rules applied. Total rules applied 28 place count 473 transition count 477
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 30 place count 473 transition count 475
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 472 transition count 474
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 472 transition count 474
Applied a total of 32 rules in 28 ms. Remains 472 /486 variables (removed 14) and now considering 474/492 (removed 18) transitions.
// Phase 1: matrix 474 rows 472 cols
[2021-05-17 18:28:19] [INFO ] Computed 29 place invariants in 2 ms
[2021-05-17 18:28:19] [INFO ] Implicit Places using invariants in 108 ms returned []
// Phase 1: matrix 474 rows 472 cols
[2021-05-17 18:28:19] [INFO ] Computed 29 place invariants in 2 ms
[2021-05-17 18:28:19] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
// Phase 1: matrix 474 rows 472 cols
[2021-05-17 18:28:19] [INFO ] Computed 29 place invariants in 1 ms
[2021-05-17 18:28:19] [INFO ] Dead Transitions using invariants and state equation in 237 ms returned []
Finished structural reductions, in 1 iterations. Remains : 472/486 places, 474/492 transitions.
Stuttering acceptance computed with spot in 49 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-28b-08 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=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s37 1) (EQ s468 0))], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-28b-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-28b-08 finished in 711 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)||(p1 U p2)))], workingDir=/home/mcc/execution]
Support contains 3 out of 486 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 486/486 places, 492/492 transitions.
Graph (trivial) has 399 edges and 486 vertex of which 6 / 486 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 233 transitions
Trivial Post-agglo rules discarded 233 transitions
Performed 233 trivial Post agglomeration. Transition count delta: 233
Iterating post reduction 0 with 233 rules applied. Total rules applied 234 place count 480 transition count 252
Reduce places removed 233 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 1 with 237 rules applied. Total rules applied 471 place count 247 transition count 248
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 473 place count 246 transition count 247
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 474 place count 245 transition count 247
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 60 Pre rules applied. Total rules applied 474 place count 245 transition count 187
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 4 with 120 rules applied. Total rules applied 594 place count 185 transition count 187
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 595 place count 184 transition count 186
Iterating global reduction 4 with 1 rules applied. Total rules applied 596 place count 184 transition count 186
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 84
Deduced a syphon composed of 84 places in 0 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 4 with 168 rules applied. Total rules applied 764 place count 100 transition count 102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 765 place count 100 transition count 101
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 766 place count 99 transition count 100
Iterating global reduction 5 with 1 rules applied. Total rules applied 767 place count 99 transition count 100
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 1
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 771 place count 97 transition count 99
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 773 place count 97 transition count 99
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 774 place count 96 transition count 98
Applied a total of 774 rules in 29 ms. Remains 96 /486 variables (removed 390) and now considering 98/492 (removed 394) transitions.
[2021-05-17 18:28:19] [INFO ] Flow matrix only has 72 transitions (discarded 26 similar events)
// Phase 1: matrix 72 rows 96 cols
[2021-05-17 18:28:19] [INFO ] Computed 29 place invariants in 1 ms
[2021-05-17 18:28:19] [INFO ] Implicit Places using invariants in 48 ms returned []
[2021-05-17 18:28:19] [INFO ] Flow matrix only has 72 transitions (discarded 26 similar events)
// Phase 1: matrix 72 rows 96 cols
[2021-05-17 18:28:19] [INFO ] Computed 29 place invariants in 0 ms
[2021-05-17 18:28:19] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-17 18:28:19] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
[2021-05-17 18:28:19] [INFO ] Redundant transitions in 2 ms returned []
[2021-05-17 18:28:19] [INFO ] Flow matrix only has 72 transitions (discarded 26 similar events)
// Phase 1: matrix 72 rows 96 cols
[2021-05-17 18:28:19] [INFO ] Computed 29 place invariants in 1 ms
[2021-05-17 18:28:20] [INFO ] Dead Transitions using invariants and state equation in 46 ms returned []
Finished structural reductions, in 1 iterations. Remains : 96/486 places, 98/492 transitions.
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-28b-09 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s22 1), p2:(EQ s53 1), p1:(EQ s29 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, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-28b-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-28b-09 finished in 291 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 486/486 places, 492/492 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 239 rules applied. Total rules applied 239 place count 485 transition count 252
Reduce places removed 239 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 247 rules applied. Total rules applied 486 place count 246 transition count 244
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 491 place count 243 transition count 242
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 493 place count 241 transition count 242
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 60 Pre rules applied. Total rules applied 493 place count 241 transition count 182
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 4 with 120 rules applied. Total rules applied 613 place count 181 transition count 182
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 614 place count 180 transition count 181
Iterating global reduction 4 with 1 rules applied. Total rules applied 615 place count 180 transition count 181
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 4 with 172 rules applied. Total rules applied 787 place count 94 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 788 place count 94 transition count 94
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 789 place count 93 transition count 93
Iterating global reduction 5 with 1 rules applied. Total rules applied 790 place count 93 transition count 93
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 792 place count 92 transition count 92
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 793 place count 91 transition count 91
Applied a total of 793 rules in 24 ms. Remains 91 /486 variables (removed 395) and now considering 91/492 (removed 401) transitions.
[2021-05-17 18:28:20] [INFO ] Flow matrix only has 64 transitions (discarded 27 similar events)
// Phase 1: matrix 64 rows 91 cols
[2021-05-17 18:28:20] [INFO ] Computed 29 place invariants in 0 ms
[2021-05-17 18:28:20] [INFO ] Implicit Places using invariants in 50 ms returned []
[2021-05-17 18:28:20] [INFO ] Flow matrix only has 64 transitions (discarded 27 similar events)
// Phase 1: matrix 64 rows 91 cols
[2021-05-17 18:28:20] [INFO ] Computed 29 place invariants in 0 ms
[2021-05-17 18:28:20] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
[2021-05-17 18:28:20] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-17 18:28:20] [INFO ] Flow matrix only has 64 transitions (discarded 27 similar events)
// Phase 1: matrix 64 rows 91 cols
[2021-05-17 18:28:20] [INFO ] Computed 29 place invariants in 1 ms
[2021-05-17 18:28:20] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Finished structural reductions, in 1 iterations. Remains : 91/486 places, 91/492 transitions.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-28b-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s86 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 76 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-28b-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-28b-10 finished in 250 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 486/486 places, 492/492 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 477 transition count 483
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 477 transition count 483
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 477 transition count 482
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 22 place count 474 transition count 479
Iterating global reduction 1 with 3 rules applied. Total rules applied 25 place count 474 transition count 479
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 27 place count 474 transition count 477
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 473 transition count 476
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 473 transition count 476
Applied a total of 29 rules in 25 ms. Remains 473 /486 variables (removed 13) and now considering 476/492 (removed 16) transitions.
// Phase 1: matrix 476 rows 473 cols
[2021-05-17 18:28:20] [INFO ] Computed 29 place invariants in 2 ms
[2021-05-17 18:28:20] [INFO ] Implicit Places using invariants in 110 ms returned []
// Phase 1: matrix 476 rows 473 cols
[2021-05-17 18:28:20] [INFO ] Computed 29 place invariants in 1 ms
[2021-05-17 18:28:20] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 425 ms to find 0 implicit places.
// Phase 1: matrix 476 rows 473 cols
[2021-05-17 18:28:20] [INFO ] Computed 29 place invariants in 5 ms
[2021-05-17 18:28:20] [INFO ] Dead Transitions using invariants and state equation in 198 ms returned []
Finished structural reductions, in 1 iterations. Remains : 473/486 places, 476/492 transitions.
Stuttering acceptance computed with spot in 60 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-28b-13 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=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s52 0)], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 8295 steps with 31 reset in 18 ms.
FORMULA GPUForwardProgress-PT-28b-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-28b-13 finished in 738 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(F(p0))&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 486 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 486/486 places, 492/492 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 476 transition count 482
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 476 transition count 482
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 476 transition count 480
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 25 place count 473 transition count 477
Iterating global reduction 1 with 3 rules applied. Total rules applied 28 place count 473 transition count 477
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 30 place count 473 transition count 475
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 472 transition count 474
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 472 transition count 474
Applied a total of 32 rules in 24 ms. Remains 472 /486 variables (removed 14) and now considering 474/492 (removed 18) transitions.
// Phase 1: matrix 474 rows 472 cols
[2021-05-17 18:28:21] [INFO ] Computed 29 place invariants in 2 ms
[2021-05-17 18:28:21] [INFO ] Implicit Places using invariants in 98 ms returned []
// Phase 1: matrix 474 rows 472 cols
[2021-05-17 18:28:21] [INFO ] Computed 29 place invariants in 1 ms
[2021-05-17 18:28:21] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
// Phase 1: matrix 474 rows 472 cols
[2021-05-17 18:28:21] [INFO ] Computed 29 place invariants in 2 ms
[2021-05-17 18:28:21] [INFO ] Dead Transitions using invariants and state equation in 199 ms returned []
Finished structural reductions, in 1 iterations. Remains : 472/486 places, 474/492 transitions.
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-28b-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(NEQ s190 1), p1:(OR (NEQ s83 1) (NEQ s459 1) (NEQ s470 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]]
Product exploration explored 100000 steps with 546 reset in 161 ms.
Product exploration explored 100000 steps with 545 reset in 184 ms.
Graph (complete) has 735 edges and 472 vertex of which 440 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.1 ms
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 541 reset in 188 ms.
Product exploration explored 100000 steps with 537 reset in 229 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Support contains 4 out of 472 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 472/472 places, 474/474 transitions.
Graph (trivial) has 381 edges and 472 vertex of which 6 / 472 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 224 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 224 rules applied. Total rules applied 225 place count 467 transition count 468
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 31 Pre rules applied. Total rules applied 225 place count 467 transition count 470
Deduced a syphon composed of 255 places in 1 ms
Iterating global reduction 1 with 31 rules applied. Total rules applied 256 place count 467 transition count 470
Discarding 136 places :
Symmetric choice reduction at 1 with 136 rule applications. Total rules 392 place count 331 transition count 334
Deduced a syphon composed of 119 places in 0 ms
Iterating global reduction 1 with 136 rules applied. Total rules applied 528 place count 331 transition count 334
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 206 places in 0 ms
Iterating global reduction 1 with 87 rules applied. Total rules applied 615 place count 331 transition count 334
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 617 place count 331 transition count 332
Discarding 60 places :
Symmetric choice reduction at 2 with 60 rule applications. Total rules 677 place count 271 transition count 272
Deduced a syphon composed of 146 places in 0 ms
Iterating global reduction 2 with 60 rules applied. Total rules applied 737 place count 271 transition count 272
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 147 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 738 place count 271 transition count 272
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 739 place count 270 transition count 271
Deduced a syphon composed of 146 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 740 place count 270 transition count 271
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -82
Deduced a syphon composed of 174 places in 0 ms
Iterating global reduction 2 with 28 rules applied. Total rules applied 768 place count 270 transition count 353
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 796 place count 242 transition count 297
Deduced a syphon composed of 146 places in 0 ms
Iterating global reduction 2 with 28 rules applied. Total rules applied 824 place count 242 transition count 297
Deduced a syphon composed of 146 places in 0 ms
Applied a total of 824 rules in 80 ms. Remains 242 /472 variables (removed 230) and now considering 297/474 (removed 177) transitions.
[2021-05-17 18:28:23] [INFO ] Redundant transitions in 14 ms returned []
[2021-05-17 18:28:23] [INFO ] Flow matrix only has 272 transitions (discarded 25 similar events)
// Phase 1: matrix 272 rows 242 cols
[2021-05-17 18:28:23] [INFO ] Computed 29 place invariants in 1 ms
[2021-05-17 18:28:23] [INFO ] Dead Transitions using invariants and state equation in 122 ms returned []
Finished structural reductions, in 1 iterations. Remains : 242/472 places, 297/474 transitions.
Stuttering criterion allowed to conclude after 104 steps with 6 reset in 3 ms.
FORMULA GPUForwardProgress-PT-28b-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-28b-15 finished in 2131 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14320187731486914065
[2021-05-17 18:28:23] [INFO ] Computing symmetric may disable matrix : 492 transitions.
[2021-05-17 18:28:23] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 18:28:23] [INFO ] Computing symmetric may enable matrix : 492 transitions.
[2021-05-17 18:28:23] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 18:28:23] [INFO ] Applying decomposition
[2021-05-17 18:28:23] [INFO ] Flatten gal took : 34 ms
[2021-05-17 18:28:23] [INFO ] Computing Do-Not-Accords matrix : 492 transitions.
[2021-05-17 18:28:23] [INFO ] Computation of Completed DNA matrix. took 40 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 18:28:23] [INFO ] Built C files in 132ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14320187731486914065
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin14320187731486914065]
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/graph14639220522815847765.txt, -o, /tmp/graph14639220522815847765.bin, -w, /tmp/graph14639220522815847765.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/graph14639220522815847765.bin, -l, -1, -v, -w, /tmp/graph14639220522815847765.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 18:28:23] [INFO ] Decomposing Gal with order
[2021-05-17 18:28:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 18:28:23] [INFO ] Removed a total of 142 redundant transitions.
[2021-05-17 18:28:23] [INFO ] Flatten gal took : 65 ms
[2021-05-17 18:28:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2021-05-17 18:28:23] [INFO ] Time to serialize gal into /tmp/LTLFireability8127818877687258897.gal : 26 ms
[2021-05-17 18:28:23] [INFO ] Time to serialize properties into /tmp/LTLFireability12279298183927090039.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability8127818877687258897.gal, -t, CGAL, -LTL, /tmp/LTLFireability12279298183927090039.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/LTLFireability8127818877687258897.gal -t CGAL -LTL /tmp/LTLFireability12279298183927090039.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G(F(("((i23.i1.u152.p420==1)||(i19.i0.u125.p350==1))")&&(X((X("(i19.i0.u125.p350!=1)"))U((("(i23.i1.u152.p419!=1)")&&(X("(i19.i0.u125.p350!=1)")))||(G(X("(i19.i0.u125.p350!=1)"))))))))))
Formula 0 simplified : !GF("((i23.i1.u152.p420==1)||(i19.i0.u125.p350==1))" & X(X"(i19.i0.u125.p350!=1)" U (("(i23.i1.u152.p419!=1)" & X"(i19.i0.u125.p350!=1)") | GX"(i19.i0.u125.p350!=1)")))
Reverse transition relation is NOT exact ! Due to transitions t19, t539, i2.t534, i2.i1.u13.t523, i3.i1.t506, i3.i1.u24.t517, i4.t499, i4.i1.u26.t488, i5.t481, i5.i2.t470, i6.t463, i6.i2.t452, i7.i1.t434, i7.i1.t445, i8.i0.t417, i8.i0.u53.t428, i9.t409, i9.i2.t398, i10.i2.t380, i10.i2.t391, i11.t373, i11.i1.u72.t362, i12.i1.t344, i12.i1.u82.t355, i13.t337, i13.i0.t326, i14.t319, i14.i1.u96.t308, i15.t301, i15.i1.u97.t290, i16.t284, i16.i2.u108.t273, i17.t265, i17.i1.u110.t254, i18.t247, i18.i0.t236, i19.i1.t218, i19.i1.u126.t229, i20.t211, i20.i0.t200, i21.t193, i21.i1.u140.t182, i22.t175, i22.i0.t164, i23.t157, i23.i1.u148.t146, i24.i0.t129, i24.i0.u156.t140, i25.t121, i25.i0.t110, i26.i0.t92, i26.i0.u169.t103, i27.t85, i27.i1.u179.t74, i28.t34, i28.t31, i28.t10, i28.t7, i28.t6, i28.u199.t2, i28.u201.t14, i29.t67, i29.i2.t56, i30.t49, i30.i1.t38, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/427/65/492
Computing Next relation with stutter on 4.57533e+13 deadlock states
Compilation finished in 3092 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin14320187731486914065]
Link finished in 45 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, [](<>(((LTLAPp0==true)&&X((X((LTLAPp1==true)) U (((LTLAPp2==true)&&X((LTLAPp1==true)))||X([]((LTLAPp1==true))))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin14320187731486914065]
LTSmin run took 943 ms.
FORMULA GPUForwardProgress-PT-28b-05 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1621276108485

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

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