fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r096-smll-165260576200436
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for GPUForwardProgress-PT-36b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
314.552 36844.00 65553.00 241.70 FFFFFFFFFFFFFTFF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r096-smll-165260576200436.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is GPUForwardProgress-PT-36b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r096-smll-165260576200436
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 384K
-rw-r--r-- 1 mcc users 6.3K Apr 29 12:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Apr 29 12:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 29 12:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 29 12:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 9 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 07:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 07:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 07:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:57 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 179K May 10 09:34 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-36b-LTLFireability-00
FORMULA_NAME GPUForwardProgress-PT-36b-LTLFireability-01
FORMULA_NAME GPUForwardProgress-PT-36b-LTLFireability-02
FORMULA_NAME GPUForwardProgress-PT-36b-LTLFireability-03
FORMULA_NAME GPUForwardProgress-PT-36b-LTLFireability-04
FORMULA_NAME GPUForwardProgress-PT-36b-LTLFireability-05
FORMULA_NAME GPUForwardProgress-PT-36b-LTLFireability-06
FORMULA_NAME GPUForwardProgress-PT-36b-LTLFireability-07
FORMULA_NAME GPUForwardProgress-PT-36b-LTLFireability-08
FORMULA_NAME GPUForwardProgress-PT-36b-LTLFireability-09
FORMULA_NAME GPUForwardProgress-PT-36b-LTLFireability-10
FORMULA_NAME GPUForwardProgress-PT-36b-LTLFireability-11
FORMULA_NAME GPUForwardProgress-PT-36b-LTLFireability-12
FORMULA_NAME GPUForwardProgress-PT-36b-LTLFireability-13
FORMULA_NAME GPUForwardProgress-PT-36b-LTLFireability-14
FORMULA_NAME GPUForwardProgress-PT-36b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652740402547

Running Version 202205111006
[2022-05-16 22:33:24] [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]
[2022-05-16 22:33:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 22:33:25] [INFO ] Load time of PNML (sax parser for PT used): 251 ms
[2022-05-16 22:33:25] [INFO ] Transformed 720 places.
[2022-05-16 22:33:25] [INFO ] Transformed 757 transitions.
[2022-05-16 22:33:25] [INFO ] Found NUPN structural information;
[2022-05-16 22:33:25] [INFO ] Parsed PT model containing 720 places and 757 transitions in 476 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-36b-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 720 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 720/720 places, 757/757 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 719 transition count 757
Discarding 72 places :
Symmetric choice reduction at 1 with 72 rule applications. Total rules 73 place count 647 transition count 685
Iterating global reduction 1 with 72 rules applied. Total rules applied 145 place count 647 transition count 685
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 179 place count 613 transition count 651
Iterating global reduction 1 with 34 rules applied. Total rules applied 213 place count 613 transition count 651
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 246 place count 613 transition count 618
Applied a total of 246 rules in 300 ms. Remains 613 /720 variables (removed 107) and now considering 618/757 (removed 139) transitions.
// Phase 1: matrix 618 rows 613 cols
[2022-05-16 22:33:26] [INFO ] Computed 37 place invariants in 34 ms
[2022-05-16 22:33:26] [INFO ] Implicit Places using invariants in 915 ms returned []
// Phase 1: matrix 618 rows 613 cols
[2022-05-16 22:33:27] [INFO ] Computed 37 place invariants in 12 ms
[2022-05-16 22:33:27] [INFO ] Implicit Places using invariants and state equation in 912 ms returned []
Implicit Place search using SMT with State Equation took 1901 ms to find 0 implicit places.
// Phase 1: matrix 618 rows 613 cols
[2022-05-16 22:33:27] [INFO ] Computed 37 place invariants in 5 ms
[2022-05-16 22:33:28] [INFO ] Dead Transitions using invariants and state equation in 740 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 613/720 places, 618/757 transitions.
Finished structural reductions, in 1 iterations. Remains : 613/720 places, 618/757 transitions.
Support contains 36 out of 613 places after structural reductions.
[2022-05-16 22:33:29] [INFO ] Flatten gal took : 151 ms
[2022-05-16 22:33:29] [INFO ] Flatten gal took : 81 ms
[2022-05-16 22:33:29] [INFO ] Input system was already deterministic with 618 transitions.
Incomplete random walk after 10000 steps, including 33 resets, run finished after 893 ms. (steps per millisecond=11 ) properties (out of 37) seen :24
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 618 rows 613 cols
[2022-05-16 22:33:31] [INFO ] Computed 37 place invariants in 4 ms
[2022-05-16 22:33:31] [INFO ] [Real]Absence check using 0 positive and 37 generalized place invariants in 41 ms returned sat
[2022-05-16 22:33:33] [INFO ] After 1086ms SMT Verify possible using state equation in real domain returned unsat :0 sat :9 real:3
[2022-05-16 22:33:33] [INFO ] After 1884ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:12
[2022-05-16 22:33:33] [INFO ] After 2656ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2022-05-16 22:33:34] [INFO ] [Nat]Absence check using 0 positive and 37 generalized place invariants in 41 ms returned sat
[2022-05-16 22:33:35] [INFO ] After 971ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2022-05-16 22:33:36] [INFO ] After 1872ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 583 ms.
[2022-05-16 22:33:37] [INFO ] After 3198ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Fused 12 Parikh solutions to 8 different solutions.
Finished Parikh walk after 169 steps, including 0 resets, run visited all 2 properties in 6 ms. (steps per millisecond=28 )
Parikh walk visited 12 properties in 156 ms.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 117 stabilizing places and 117 stable transitions
Graph (complete) has 951 edges and 613 vertex of which 573 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.48 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((G((G(p0) U p1))&&G(p2)))))'
Support contains 5 out of 613 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 613/613 places, 618/618 transitions.
Graph (trivial) has 498 edges and 613 vertex of which 6 / 613 are part of one of the 1 SCC in 7 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 945 edges and 608 vertex of which 568 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.7 ms
Discarding 40 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 295 transitions
Trivial Post-agglo rules discarded 295 transitions
Performed 295 trivial Post agglomeration. Transition count delta: 295
Iterating post reduction 0 with 295 rules applied. Total rules applied 297 place count 567 transition count 313
Reduce places removed 295 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 298 rules applied. Total rules applied 595 place count 272 transition count 310
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 597 place count 271 transition count 309
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 598 place count 270 transition count 309
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 73 Pre rules applied. Total rules applied 598 place count 270 transition count 236
Deduced a syphon composed of 73 places in 1 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 4 with 146 rules applied. Total rules applied 744 place count 197 transition count 236
Discarding 36 places :
Symmetric choice reduction at 4 with 36 rule applications. Total rules 780 place count 161 transition count 200
Iterating global reduction 4 with 36 rules applied. Total rules applied 816 place count 161 transition count 200
Performed 110 Post agglomeration using F-continuation condition.Transition count delta: 110
Deduced a syphon composed of 110 places in 0 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 4 with 220 rules applied. Total rules applied 1036 place count 51 transition count 90
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1037 place count 51 transition count 89
Discarding 33 places :
Symmetric choice reduction at 5 with 33 rule applications. Total rules 1070 place count 18 transition count 24
Iterating global reduction 5 with 33 rules applied. Total rules applied 1103 place count 18 transition count 24
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 1107 place count 16 transition count 23
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1108 place count 15 transition count 22
Applied a total of 1108 rules in 136 ms. Remains 15 /613 variables (removed 598) and now considering 22/618 (removed 596) transitions.
[2022-05-16 22:33:38] [INFO ] Flow matrix only has 21 transitions (discarded 1 similar events)
// Phase 1: matrix 21 rows 15 cols
[2022-05-16 22:33:38] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 22:33:38] [INFO ] Implicit Places using invariants in 37 ms returned []
[2022-05-16 22:33:38] [INFO ] Flow matrix only has 21 transitions (discarded 1 similar events)
// Phase 1: matrix 21 rows 15 cols
[2022-05-16 22:33:38] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 22:33:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 22:33:38] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2022-05-16 22:33:38] [INFO ] Redundant transitions in 15 ms returned []
[2022-05-16 22:33:38] [INFO ] Flow matrix only has 21 transitions (discarded 1 similar events)
// Phase 1: matrix 21 rows 15 cols
[2022-05-16 22:33:38] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 22:33:38] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/613 places, 22/618 transitions.
Finished structural reductions, in 1 iterations. Remains : 15/613 places, 22/618 transitions.
Stuttering acceptance computed with spot in 491 ms :[(OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(OR (AND p1 p2) (AND p2 p0)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (NOT p2)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) p2 p0), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p1) p2 p0), acceptance={0, 1} source=0 dest: 2}], [{ cond=(AND p1 p2 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p1 p2 p0), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p1) p0) (AND (NOT p2) p0)), acceptance={1} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s5 1), p2:(AND (EQ s3 1) (EQ s12 1) (EQ s14 1)), p0:(EQ s8 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 2 ms.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-LTLFireability-01 finished in 888 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U X(p1))))'
Support contains 2 out of 613 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 613/613 places, 618/618 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 604 transition count 609
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 604 transition count 609
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 604 transition count 608
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 23 place count 600 transition count 604
Iterating global reduction 1 with 4 rules applied. Total rules applied 27 place count 600 transition count 604
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 29 place count 600 transition count 602
Applied a total of 29 rules in 219 ms. Remains 600 /613 variables (removed 13) and now considering 602/618 (removed 16) transitions.
// Phase 1: matrix 602 rows 600 cols
[2022-05-16 22:33:38] [INFO ] Computed 37 place invariants in 8 ms
[2022-05-16 22:33:39] [INFO ] Implicit Places using invariants in 383 ms returned []
// Phase 1: matrix 602 rows 600 cols
[2022-05-16 22:33:39] [INFO ] Computed 37 place invariants in 8 ms
[2022-05-16 22:33:40] [INFO ] Implicit Places using invariants and state equation in 908 ms returned []
Implicit Place search using SMT with State Equation took 1297 ms to find 0 implicit places.
// Phase 1: matrix 602 rows 600 cols
[2022-05-16 22:33:40] [INFO ] Computed 37 place invariants in 6 ms
[2022-05-16 22:33:40] [INFO ] Dead Transitions using invariants and state equation in 578 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 600/613 places, 602/618 transitions.
Finished structural reductions, in 1 iterations. Remains : 600/613 places, 602/618 transitions.
Stuttering acceptance computed with spot in 200 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(NEQ s3 1), p1:(EQ s63 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-LTLFireability-02 finished in 2334 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(G(!(G(p0) U p0)))||p1)))'
Support contains 3 out of 613 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 613/613 places, 618/618 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 605 transition count 610
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 605 transition count 610
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 605 transition count 609
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 21 place count 601 transition count 605
Iterating global reduction 1 with 4 rules applied. Total rules applied 25 place count 601 transition count 605
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 601 transition count 603
Applied a total of 27 rules in 74 ms. Remains 601 /613 variables (removed 12) and now considering 603/618 (removed 15) transitions.
// Phase 1: matrix 603 rows 601 cols
[2022-05-16 22:33:41] [INFO ] Computed 37 place invariants in 2 ms
[2022-05-16 22:33:41] [INFO ] Implicit Places using invariants in 214 ms returned []
// Phase 1: matrix 603 rows 601 cols
[2022-05-16 22:33:41] [INFO ] Computed 37 place invariants in 2 ms
[2022-05-16 22:33:41] [INFO ] Implicit Places using invariants and state equation in 575 ms returned []
Implicit Place search using SMT with State Equation took 792 ms to find 0 implicit places.
// Phase 1: matrix 603 rows 601 cols
[2022-05-16 22:33:41] [INFO ] Computed 37 place invariants in 4 ms
[2022-05-16 22:33:42] [INFO ] Dead Transitions using invariants and state equation in 521 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 601/613 places, 603/618 transitions.
Finished structural reductions, in 1 iterations. Remains : 601/613 places, 603/618 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, (AND (NOT p1) p0), p0]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (EQ s185 1) (OR (EQ s302 0) (EQ s520 1))), p0:(EQ s185 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 197 steps with 0 reset in 7 ms.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-LTLFireability-03 finished in 1497 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(((F(p1)&&p0)||p2) U G(!X(X(p3)))))'
Support contains 4 out of 613 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 613/613 places, 618/618 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 604 transition count 609
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 604 transition count 609
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 604 transition count 608
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 23 place count 600 transition count 604
Iterating global reduction 1 with 4 rules applied. Total rules applied 27 place count 600 transition count 604
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 29 place count 600 transition count 602
Applied a total of 29 rules in 69 ms. Remains 600 /613 variables (removed 13) and now considering 602/618 (removed 16) transitions.
// Phase 1: matrix 602 rows 600 cols
[2022-05-16 22:33:42] [INFO ] Computed 37 place invariants in 2 ms
[2022-05-16 22:33:42] [INFO ] Implicit Places using invariants in 202 ms returned []
// Phase 1: matrix 602 rows 600 cols
[2022-05-16 22:33:42] [INFO ] Computed 37 place invariants in 2 ms
[2022-05-16 22:33:43] [INFO ] Implicit Places using invariants and state equation in 808 ms returned []
Implicit Place search using SMT with State Equation took 1013 ms to find 0 implicit places.
// Phase 1: matrix 602 rows 600 cols
[2022-05-16 22:33:43] [INFO ] Computed 37 place invariants in 9 ms
[2022-05-16 22:33:44] [INFO ] Dead Transitions using invariants and state equation in 814 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 600/613 places, 602/618 transitions.
Finished structural reductions, in 1 iterations. Remains : 600/613 places, 602/618 transitions.
Stuttering acceptance computed with spot in 237 ms :[(NOT p3), (NOT p3), (AND p1 (NOT p3)), (NOT p3), (AND (NOT p3) p1), (AND (NOT p3) p1)]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(OR p2 (AND p0 p1)), acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(OR (AND p2 p1) (AND p0 p1)), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 1}, { cond=(OR (AND p2 (NOT p1)) (AND p0 (NOT p1))), acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=(AND p1 (NOT p3)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(EQ s587 1), p0:(AND (EQ s282 1) (EQ s587 1) (EQ s598 1)), p1:(EQ s574 1), p3:(AND (EQ s282 1) (EQ s587 1) (EQ s598 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 297 steps with 0 reset in 2 ms.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-LTLFireability-04 finished in 2169 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U ((p1 U X(p2)) U (F(p3)&&G(p4)))))'
Support contains 4 out of 613 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 613/613 places, 618/618 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 605 transition count 610
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 605 transition count 610
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 605 transition count 609
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 602 transition count 606
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 602 transition count 606
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 25 place count 602 transition count 604
Applied a total of 25 rules in 58 ms. Remains 602 /613 variables (removed 11) and now considering 604/618 (removed 14) transitions.
// Phase 1: matrix 604 rows 602 cols
[2022-05-16 22:33:44] [INFO ] Computed 37 place invariants in 2 ms
[2022-05-16 22:33:45] [INFO ] Implicit Places using invariants in 340 ms returned []
// Phase 1: matrix 604 rows 602 cols
[2022-05-16 22:33:45] [INFO ] Computed 37 place invariants in 5 ms
[2022-05-16 22:33:45] [INFO ] Implicit Places using invariants and state equation in 775 ms returned []
Implicit Place search using SMT with State Equation took 1117 ms to find 0 implicit places.
// Phase 1: matrix 604 rows 602 cols
[2022-05-16 22:33:45] [INFO ] Computed 37 place invariants in 6 ms
[2022-05-16 22:33:46] [INFO ] Dead Transitions using invariants and state equation in 770 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 602/613 places, 604/618 transitions.
Finished structural reductions, in 1 iterations. Remains : 602/613 places, 604/618 transitions.
Stuttering acceptance computed with spot in 797 ms :[(OR (NOT p4) (NOT p3)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p4)), (AND (NOT p0) (NOT p2) p4), (NOT p3), (AND (NOT p4) (NOT p0) (NOT p2)), (NOT p4), true, (NOT p2), (NOT p4), (NOT p2), (AND (NOT p4) p0 (NOT p2)), (AND p0 (NOT p4)), (NOT p4)]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p4), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p4) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p4), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p4) p1), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p3) p4), acceptance={} source=0 dest: 4}, { cond=(AND p4 (NOT p1)), acceptance={} source=0 dest: 5}, { cond=p4, acceptance={} source=0 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 7}], [{ cond=(AND (NOT p4) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 8}, { cond=(AND (NOT p4) (NOT p0)), acceptance={} source=2 dest: 9}, { cond=(AND (NOT p4) p1 (NOT p0)), acceptance={} source=2 dest: 10}, { cond=(AND p4 (NOT p1) (NOT p0)), acceptance={} source=2 dest: 11}, { cond=(AND p4 (NOT p0)), acceptance={} source=2 dest: 12}], [{ cond=(AND p4 (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 8}, { cond=(AND p4 p1 (NOT p0) (NOT p2)), acceptance={} source=3 dest: 10}], [{ cond=(NOT p3), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p4) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 7}, { cond=(AND p4 (NOT p0) (NOT p2)), acceptance={} source=5 dest: 13}], [{ cond=(NOT p4), acceptance={0} source=6 dest: 0}, { cond=(AND (NOT p4) (NOT p1) p0), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p4) p0), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p4) p1 p0), acceptance={} source=6 dest: 3}, { cond=(AND p4 (NOT p1)), acceptance={} source=6 dest: 5}, { cond=p4, acceptance={} source=6 dest: 6}, { cond=(AND (NOT p4) (NOT p1) (NOT p0)), acceptance={} source=6 dest: 8}, { cond=(AND (NOT p4) (NOT p0)), acceptance={} source=6 dest: 9}, { cond=(AND (NOT p4) p1 (NOT p0)), acceptance={} source=6 dest: 10}, { cond=(AND p4 (NOT p1) (NOT p0)), acceptance={} source=6 dest: 11}, { cond=(AND p4 (NOT p0)), acceptance={} source=6 dest: 12}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=(NOT p2), acceptance={} source=8 dest: 7}], [{ cond=(AND (NOT p4) (NOT p1)), acceptance={} source=9 dest: 8}, { cond=(NOT p4), acceptance={0} source=9 dest: 9}, { cond=(AND (NOT p4) p1), acceptance={} source=9 dest: 10}, { cond=(AND p4 (NOT p1)), acceptance={} source=9 dest: 11}, { cond=p4, acceptance={} source=9 dest: 12}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=10 dest: 8}, { cond=(AND p1 (NOT p2)), acceptance={0} source=10 dest: 10}], [{ cond=(AND (NOT p4) p0 (NOT p2)), acceptance={} source=11 dest: 7}, { cond=(AND p4 p0 (NOT p2)), acceptance={} source=11 dest: 13}], [{ cond=(AND (NOT p4) (NOT p1) p0), acceptance={} source=12 dest: 8}, { cond=(AND (NOT p4) p0), acceptance={0} source=12 dest: 9}, { cond=(AND (NOT p4) p1 p0), acceptance={} source=12 dest: 10}, { cond=(AND p4 (NOT p1) p0), acceptance={} source=12 dest: 11}, { cond=(AND p4 p0), acceptance={} source=12 dest: 12}], [{ cond=(NOT p4), acceptance={} source=13 dest: 7}, { cond=p4, acceptance={} source=13 dest: 13}]], initial=0, aps=[p4:(EQ s523 1), p1:(EQ s225 1), p3:(EQ s139 1), p0:(AND (EQ s225 1) (EQ s523 1)), p2:(EQ s582 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-LTLFireability-05 finished in 2795 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)&&G(X(p2))&&p2)))'
Support contains 3 out of 613 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 613/613 places, 618/618 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 604 transition count 609
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 604 transition count 609
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 604 transition count 608
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 23 place count 600 transition count 604
Iterating global reduction 1 with 4 rules applied. Total rules applied 27 place count 600 transition count 604
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 29 place count 600 transition count 602
Applied a total of 29 rules in 91 ms. Remains 600 /613 variables (removed 13) and now considering 602/618 (removed 16) transitions.
// Phase 1: matrix 602 rows 600 cols
[2022-05-16 22:33:47] [INFO ] Computed 37 place invariants in 4 ms
[2022-05-16 22:33:47] [INFO ] Implicit Places using invariants in 357 ms returned []
// Phase 1: matrix 602 rows 600 cols
[2022-05-16 22:33:47] [INFO ] Computed 37 place invariants in 3 ms
[2022-05-16 22:33:48] [INFO ] Implicit Places using invariants and state equation in 853 ms returned []
Implicit Place search using SMT with State Equation took 1216 ms to find 0 implicit places.
// Phase 1: matrix 602 rows 600 cols
[2022-05-16 22:33:48] [INFO ] Computed 37 place invariants in 4 ms
[2022-05-16 22:33:49] [INFO ] Dead Transitions using invariants and state equation in 644 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 600/613 places, 602/618 transitions.
Finished structural reductions, in 1 iterations. Remains : 600/613 places, 602/618 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), true, (OR (NOT p1) (NOT p2))]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p2), acceptance={0} source=3 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p2:(EQ s112 1), p1:(EQ s73 1), p0:(NEQ s80 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-LTLFireability-06 finished in 2097 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X((F(X(G(p0)))||F(G(p0)))))))'
Support contains 1 out of 613 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 613/613 places, 618/618 transitions.
Graph (trivial) has 505 edges and 613 vertex of which 6 / 613 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 945 edges and 608 vertex of which 568 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.4 ms
Discarding 40 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 299 transitions
Trivial Post-agglo rules discarded 299 transitions
Performed 299 trivial Post agglomeration. Transition count delta: 299
Iterating post reduction 0 with 299 rules applied. Total rules applied 301 place count 567 transition count 309
Reduce places removed 299 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 303 rules applied. Total rules applied 604 place count 268 transition count 305
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 605 place count 267 transition count 305
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 76 Pre rules applied. Total rules applied 605 place count 267 transition count 229
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 3 with 152 rules applied. Total rules applied 757 place count 191 transition count 229
Discarding 36 places :
Symmetric choice reduction at 3 with 36 rule applications. Total rules 793 place count 155 transition count 193
Iterating global reduction 3 with 36 rules applied. Total rules applied 829 place count 155 transition count 193
Performed 110 Post agglomeration using F-continuation condition.Transition count delta: 110
Deduced a syphon composed of 110 places in 0 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 3 with 220 rules applied. Total rules applied 1049 place count 45 transition count 83
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1050 place count 45 transition count 82
Discarding 35 places :
Symmetric choice reduction at 4 with 35 rule applications. Total rules 1085 place count 10 transition count 13
Iterating global reduction 4 with 35 rules applied. Total rules applied 1120 place count 10 transition count 13
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 1122 place count 9 transition count 12
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1123 place count 9 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1124 place count 8 transition count 11
Applied a total of 1124 rules in 59 ms. Remains 8 /613 variables (removed 605) and now considering 11/618 (removed 607) transitions.
// Phase 1: matrix 11 rows 8 cols
[2022-05-16 22:33:49] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 22:33:49] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 11 rows 8 cols
[2022-05-16 22:33:49] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 22:33:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 22:33:49] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2022-05-16 22:33:49] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 11 rows 8 cols
[2022-05-16 22:33:49] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 22:33:49] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/613 places, 11/618 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/613 places, 11/618 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s2 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 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-LTLFireability-08 finished in 230 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&(F(p1) U ((!p0&&F(p1))||G(F(p1))))))))'
Support contains 2 out of 613 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 613/613 places, 618/618 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 604 transition count 609
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 604 transition count 609
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 604 transition count 608
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 23 place count 600 transition count 604
Iterating global reduction 1 with 4 rules applied. Total rules applied 27 place count 600 transition count 604
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 29 place count 600 transition count 602
Applied a total of 29 rules in 77 ms. Remains 600 /613 variables (removed 13) and now considering 602/618 (removed 16) transitions.
// Phase 1: matrix 602 rows 600 cols
[2022-05-16 22:33:49] [INFO ] Computed 37 place invariants in 3 ms
[2022-05-16 22:33:50] [INFO ] Implicit Places using invariants in 298 ms returned []
// Phase 1: matrix 602 rows 600 cols
[2022-05-16 22:33:50] [INFO ] Computed 37 place invariants in 5 ms
[2022-05-16 22:33:50] [INFO ] Implicit Places using invariants and state equation in 681 ms returned []
Implicit Place search using SMT with State Equation took 983 ms to find 0 implicit places.
// Phase 1: matrix 602 rows 600 cols
[2022-05-16 22:33:50] [INFO ] Computed 37 place invariants in 2 ms
[2022-05-16 22:33:51] [INFO ] Dead Transitions using invariants and state equation in 584 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 600/613 places, 602/618 transitions.
Finished structural reductions, in 1 iterations. Remains : 600/613 places, 602/618 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s437 1), p1:(NEQ s246 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-LTLFireability-09 finished in 1796 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(p0) U p1))))'
Support contains 2 out of 613 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 613/613 places, 618/618 transitions.
Graph (trivial) has 504 edges and 613 vertex of which 6 / 613 are part of one of the 1 SCC in 6 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 945 edges and 608 vertex of which 568 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.4 ms
Discarding 40 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 298 transitions
Trivial Post-agglo rules discarded 298 transitions
Performed 298 trivial Post agglomeration. Transition count delta: 298
Iterating post reduction 0 with 298 rules applied. Total rules applied 300 place count 567 transition count 310
Reduce places removed 298 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 301 rules applied. Total rules applied 601 place count 269 transition count 307
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 602 place count 268 transition count 307
Performed 75 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 75 Pre rules applied. Total rules applied 602 place count 268 transition count 232
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 150 rules applied. Total rules applied 752 place count 193 transition count 232
Discarding 36 places :
Symmetric choice reduction at 3 with 36 rule applications. Total rules 788 place count 157 transition count 196
Iterating global reduction 3 with 36 rules applied. Total rules applied 824 place count 157 transition count 196
Performed 110 Post agglomeration using F-continuation condition.Transition count delta: 110
Deduced a syphon composed of 110 places in 0 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 3 with 220 rules applied. Total rules applied 1044 place count 47 transition count 86
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1045 place count 47 transition count 85
Discarding 34 places :
Symmetric choice reduction at 4 with 34 rule applications. Total rules 1079 place count 13 transition count 18
Iterating global reduction 4 with 34 rules applied. Total rules applied 1113 place count 13 transition count 18
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 4 with 4 rules applied. Total rules applied 1117 place count 11 transition count 17
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 1119 place count 11 transition count 17
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1120 place count 10 transition count 16
Applied a total of 1120 rules in 45 ms. Remains 10 /613 variables (removed 603) and now considering 16/618 (removed 602) transitions.
[2022-05-16 22:33:51] [INFO ] Flow matrix only has 15 transitions (discarded 1 similar events)
// Phase 1: matrix 15 rows 10 cols
[2022-05-16 22:33:51] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 22:33:51] [INFO ] Implicit Places using invariants in 19 ms returned []
[2022-05-16 22:33:51] [INFO ] Flow matrix only has 15 transitions (discarded 1 similar events)
// Phase 1: matrix 15 rows 10 cols
[2022-05-16 22:33:51] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 22:33:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 22:33:51] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2022-05-16 22:33:51] [INFO ] Redundant transitions in 11 ms returned []
[2022-05-16 22:33:51] [INFO ] Flow matrix only has 15 transitions (discarded 1 similar events)
// Phase 1: matrix 15 rows 10 cols
[2022-05-16 22:33:51] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 22:33:51] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/613 places, 16/618 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/613 places, 16/618 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={1} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s6 1), p0:(NEQ s3 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-LTLFireability-10 finished in 273 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((X(p0) U (X(p1)&&p0)))||G(X(p2)))))'
Support contains 2 out of 613 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 613/613 places, 618/618 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 604 transition count 609
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 604 transition count 609
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 604 transition count 608
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 23 place count 600 transition count 604
Iterating global reduction 1 with 4 rules applied. Total rules applied 27 place count 600 transition count 604
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 29 place count 600 transition count 602
Applied a total of 29 rules in 88 ms. Remains 600 /613 variables (removed 13) and now considering 602/618 (removed 16) transitions.
// Phase 1: matrix 602 rows 600 cols
[2022-05-16 22:33:51] [INFO ] Computed 37 place invariants in 3 ms
[2022-05-16 22:33:52] [INFO ] Implicit Places using invariants in 348 ms returned []
// Phase 1: matrix 602 rows 600 cols
[2022-05-16 22:33:52] [INFO ] Computed 37 place invariants in 4 ms
[2022-05-16 22:33:53] [INFO ] Implicit Places using invariants and state equation in 896 ms returned []
Implicit Place search using SMT with State Equation took 1249 ms to find 0 implicit places.
// Phase 1: matrix 602 rows 600 cols
[2022-05-16 22:33:53] [INFO ] Computed 37 place invariants in 4 ms
[2022-05-16 22:33:54] [INFO ] Dead Transitions using invariants and state equation in 854 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 600/613 places, 602/618 transitions.
Finished structural reductions, in 1 iterations. Remains : 600/613 places, 602/618 transitions.
Stuttering acceptance computed with spot in 338 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 2}, { cond=p0, acceptance={} source=5 dest: 3}]], initial=4, aps=[p0:(EQ s8 1), p1:(EQ s299 1), p2:(EQ s299 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 6618 steps with 21 reset in 55 ms.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-LTLFireability-11 finished in 2622 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(((X(G(F(p0)))&&X(p1)) U p2)))'
Support contains 1 out of 613 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 613/613 places, 618/618 transitions.
Graph (trivial) has 499 edges and 613 vertex of which 6 / 613 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 945 edges and 608 vertex of which 568 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.4 ms
Discarding 40 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 296 transitions
Trivial Post-agglo rules discarded 296 transitions
Performed 296 trivial Post agglomeration. Transition count delta: 296
Iterating post reduction 0 with 296 rules applied. Total rules applied 298 place count 567 transition count 312
Reduce places removed 296 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 300 rules applied. Total rules applied 598 place count 271 transition count 308
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 600 place count 270 transition count 307
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 601 place count 269 transition count 307
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 74 Pre rules applied. Total rules applied 601 place count 269 transition count 233
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 4 with 148 rules applied. Total rules applied 749 place count 195 transition count 233
Discarding 35 places :
Symmetric choice reduction at 4 with 35 rule applications. Total rules 784 place count 160 transition count 198
Iterating global reduction 4 with 35 rules applied. Total rules applied 819 place count 160 transition count 198
Performed 110 Post agglomeration using F-continuation condition.Transition count delta: 110
Deduced a syphon composed of 110 places in 0 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 4 with 220 rules applied. Total rules applied 1039 place count 50 transition count 88
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1040 place count 50 transition count 87
Discarding 35 places :
Symmetric choice reduction at 5 with 35 rule applications. Total rules 1075 place count 15 transition count 18
Iterating global reduction 5 with 35 rules applied. Total rules applied 1110 place count 15 transition count 18
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 1112 place count 14 transition count 17
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1113 place count 13 transition count 16
Applied a total of 1113 rules in 68 ms. Remains 13 /613 variables (removed 600) and now considering 16/618 (removed 602) transitions.
// Phase 1: matrix 16 rows 13 cols
[2022-05-16 22:33:54] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 22:33:54] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 16 rows 13 cols
[2022-05-16 22:33:54] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 22:33:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 22:33:54] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2022-05-16 22:33:54] [INFO ] Redundant transitions in 17 ms returned []
// Phase 1: matrix 16 rows 13 cols
[2022-05-16 22:33:54] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 22:33:54] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/613 places, 16/618 transitions.
Finished structural reductions, in 1 iterations. Remains : 13/613 places, 16/618 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p2)]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p2:(EQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-LTLFireability-12 finished in 252 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 613 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 613/613 places, 618/618 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 604 transition count 609
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 604 transition count 609
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 604 transition count 608
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 23 place count 600 transition count 604
Iterating global reduction 1 with 4 rules applied. Total rules applied 27 place count 600 transition count 604
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 29 place count 600 transition count 602
Applied a total of 29 rules in 100 ms. Remains 600 /613 variables (removed 13) and now considering 602/618 (removed 16) transitions.
// Phase 1: matrix 602 rows 600 cols
[2022-05-16 22:33:54] [INFO ] Computed 37 place invariants in 5 ms
[2022-05-16 22:33:55] [INFO ] Implicit Places using invariants in 367 ms returned []
// Phase 1: matrix 602 rows 600 cols
[2022-05-16 22:33:55] [INFO ] Computed 37 place invariants in 3 ms
[2022-05-16 22:33:56] [INFO ] Implicit Places using invariants and state equation in 888 ms returned []
Implicit Place search using SMT with State Equation took 1262 ms to find 0 implicit places.
// Phase 1: matrix 602 rows 600 cols
[2022-05-16 22:33:56] [INFO ] Computed 37 place invariants in 3 ms
[2022-05-16 22:33:56] [INFO ] Dead Transitions using invariants and state equation in 780 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 600/613 places, 602/618 transitions.
Finished structural reductions, in 1 iterations. Remains : 600/613 places, 602/618 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s108 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 989 ms.
Product exploration explored 100000 steps with 50000 reset in 1027 ms.
Computed a total of 111 stabilizing places and 111 stable transitions
Graph (complete) has 935 edges and 600 vertex of which 560 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.9 ms
Computed a total of 111 stabilizing places and 111 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-36b-LTLFireability-13 finished in 4337 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F((F(p1)||p0)))&&G(p2))))'
Support contains 3 out of 613 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 613/613 places, 618/618 transitions.
Graph (trivial) has 502 edges and 613 vertex of which 6 / 613 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.
Graph (complete) has 945 edges and 608 vertex of which 568 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.2 ms
Discarding 40 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 295 transitions
Trivial Post-agglo rules discarded 295 transitions
Performed 295 trivial Post agglomeration. Transition count delta: 295
Iterating post reduction 0 with 295 rules applied. Total rules applied 297 place count 567 transition count 313
Reduce places removed 295 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 299 rules applied. Total rules applied 596 place count 272 transition count 309
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 599 place count 271 transition count 307
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 601 place count 269 transition count 307
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 76 Pre rules applied. Total rules applied 601 place count 269 transition count 231
Deduced a syphon composed of 76 places in 1 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 4 with 152 rules applied. Total rules applied 753 place count 193 transition count 231
Discarding 36 places :
Symmetric choice reduction at 4 with 36 rule applications. Total rules 789 place count 157 transition count 195
Iterating global reduction 4 with 36 rules applied. Total rules applied 825 place count 157 transition count 195
Performed 108 Post agglomeration using F-continuation condition.Transition count delta: 108
Deduced a syphon composed of 108 places in 0 ms
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 4 with 216 rules applied. Total rules applied 1041 place count 49 transition count 87
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1042 place count 49 transition count 86
Discarding 35 places :
Symmetric choice reduction at 5 with 35 rule applications. Total rules 1077 place count 14 transition count 17
Iterating global reduction 5 with 35 rules applied. Total rules applied 1112 place count 14 transition count 17
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 1114 place count 13 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1115 place count 12 transition count 15
Applied a total of 1115 rules in 30 ms. Remains 12 /613 variables (removed 601) and now considering 15/618 (removed 603) transitions.
// Phase 1: matrix 15 rows 12 cols
[2022-05-16 22:33:59] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 22:33:59] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 15 rows 12 cols
[2022-05-16 22:33:59] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 22:33:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 22:33:59] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2022-05-16 22:33:59] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 15 rows 12 cols
[2022-05-16 22:33:59] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 22:33:59] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/613 places, 15/618 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/613 places, 15/618 transitions.
Stuttering acceptance computed with spot in 76 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(EQ s4 1), p1:(EQ s8 0), p0:(OR (EQ s8 1) (EQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-LTLFireability-14 finished in 207 ms.
All properties solved by simple procedures.
Total runtime 34424 ms.

BK_STOP 1652740439391

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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-36b"
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-36b, 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 r096-smll-165260576200436"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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