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

About the Execution of ITS-Tools for GPUForwardProgress-PT-24a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16205.771 2324024.00 3937786.00 52233.80 FTFFTFTFFTFFTFFT 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-165260576100380.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-24a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r096-smll-165260576100380
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 276K
-rw-r--r-- 1 mcc users 7.9K Apr 29 12:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Apr 29 12:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 29 12:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 29 12:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 9 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:56 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 38K 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-24a-LTLFireability-00
FORMULA_NAME GPUForwardProgress-PT-24a-LTLFireability-01
FORMULA_NAME GPUForwardProgress-PT-24a-LTLFireability-02
FORMULA_NAME GPUForwardProgress-PT-24a-LTLFireability-03
FORMULA_NAME GPUForwardProgress-PT-24a-LTLFireability-04
FORMULA_NAME GPUForwardProgress-PT-24a-LTLFireability-05
FORMULA_NAME GPUForwardProgress-PT-24a-LTLFireability-06
FORMULA_NAME GPUForwardProgress-PT-24a-LTLFireability-07
FORMULA_NAME GPUForwardProgress-PT-24a-LTLFireability-08
FORMULA_NAME GPUForwardProgress-PT-24a-LTLFireability-09
FORMULA_NAME GPUForwardProgress-PT-24a-LTLFireability-10
FORMULA_NAME GPUForwardProgress-PT-24a-LTLFireability-11
FORMULA_NAME GPUForwardProgress-PT-24a-LTLFireability-12
FORMULA_NAME GPUForwardProgress-PT-24a-LTLFireability-13
FORMULA_NAME GPUForwardProgress-PT-24a-LTLFireability-14
FORMULA_NAME GPUForwardProgress-PT-24a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652726527232

Running Version 202205111006
[2022-05-16 18:42:09] [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 18:42:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 18:42:10] [INFO ] Load time of PNML (sax parser for PT used): 264 ms
[2022-05-16 18:42:10] [INFO ] Transformed 104 places.
[2022-05-16 18:42:10] [INFO ] Transformed 129 transitions.
[2022-05-16 18:42:10] [INFO ] Found NUPN structural information;
[2022-05-16 18:42:10] [INFO ] Parsed PT model containing 104 places and 129 transitions in 510 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 26 transitions
Reduce redundant transitions removed 26 transitions.
FORMULA GPUForwardProgress-PT-24a-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-24a-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-24a-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 103/103 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 103 transition count 103
Applied a total of 1 rules in 21 ms. Remains 103 /104 variables (removed 1) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 103 cols
[2022-05-16 18:42:10] [INFO ] Computed 25 place invariants in 18 ms
[2022-05-16 18:42:11] [INFO ] Implicit Places using invariants in 354 ms returned []
// Phase 1: matrix 103 rows 103 cols
[2022-05-16 18:42:11] [INFO ] Computed 25 place invariants in 9 ms
[2022-05-16 18:42:11] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-16 18:42:11] [INFO ] Implicit Places using invariants and state equation in 406 ms returned []
Implicit Place search using SMT with State Equation took 809 ms to find 0 implicit places.
// Phase 1: matrix 103 rows 103 cols
[2022-05-16 18:42:11] [INFO ] Computed 25 place invariants in 5 ms
[2022-05-16 18:42:11] [INFO ] Dead Transitions using invariants and state equation in 226 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 103/104 places, 103/103 transitions.
Finished structural reductions, in 1 iterations. Remains : 103/104 places, 103/103 transitions.
Support contains 30 out of 103 places after structural reductions.
[2022-05-16 18:42:12] [INFO ] Flatten gal took : 77 ms
[2022-05-16 18:42:12] [INFO ] Flatten gal took : 37 ms
[2022-05-16 18:42:12] [INFO ] Input system was already deterministic with 103 transitions.
Finished random walk after 474 steps, including 3 resets, run visited all 30 properties in 112 ms. (steps per millisecond=4 )
FORMULA GPUForwardProgress-PT-24a-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1 stabilizing places and 1 stable transitions
Graph (complete) has 328 edges and 103 vertex of which 78 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.15 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U X(X(p1)))||X(X(p2))))'
Support contains 5 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 103/103 transitions.
Applied a total of 0 rules in 10 ms. Remains 103 /103 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 103 cols
[2022-05-16 18:42:13] [INFO ] Computed 25 place invariants in 3 ms
[2022-05-16 18:42:13] [INFO ] Implicit Places using invariants in 269 ms returned []
// Phase 1: matrix 103 rows 103 cols
[2022-05-16 18:42:13] [INFO ] Computed 25 place invariants in 2 ms
[2022-05-16 18:42:13] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-16 18:42:13] [INFO ] Implicit Places using invariants and state equation in 349 ms returned []
Implicit Place search using SMT with State Equation took 630 ms to find 0 implicit places.
// Phase 1: matrix 103 rows 103 cols
[2022-05-16 18:42:13] [INFO ] Computed 25 place invariants in 3 ms
[2022-05-16 18:42:13] [INFO ] Dead Transitions using invariants and state equation in 249 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 103/103 transitions.
Stuttering acceptance computed with spot in 738 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : GPUForwardProgress-PT-24a-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 4}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 5}, { cond=p0, acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 7}], [{ cond=p0, acceptance={} source=6 dest: 2}, { cond=(NOT p0), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=7 dest: 4}]], initial=3, aps=[p0:(AND (EQ s92 1) (EQ s98 1) (EQ s102 1)), p1:(EQ s31 1), p2:(EQ s95 1)], 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, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 4 ms.
FORMULA GPUForwardProgress-PT-24a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-24a-LTLFireability-00 finished in 1781 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||F(p1)))'
Support contains 4 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 103/103 transitions.
Applied a total of 0 rules in 10 ms. Remains 103 /103 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 103 cols
[2022-05-16 18:42:14] [INFO ] Computed 25 place invariants in 4 ms
[2022-05-16 18:42:14] [INFO ] Implicit Places using invariants in 167 ms returned []
// Phase 1: matrix 103 rows 103 cols
[2022-05-16 18:42:14] [INFO ] Computed 25 place invariants in 3 ms
[2022-05-16 18:42:15] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-16 18:42:15] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 479 ms to find 0 implicit places.
// Phase 1: matrix 103 rows 103 cols
[2022-05-16 18:42:15] [INFO ] Computed 25 place invariants in 3 ms
[2022-05-16 18:42:15] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 103/103 transitions.
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-24a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(AND (EQ s76 1) (EQ s98 1) (EQ s102 1)), p0:(AND (EQ s66 1) (EQ s98 1) (EQ s102 1))], 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, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 872 ms.
Product exploration explored 100000 steps with 50000 reset in 535 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Graph (complete) has 328 edges and 103 vertex of which 78 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.2 ms
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p0))))
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA GPUForwardProgress-PT-24a-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-24a-LTLFireability-04 finished in 2366 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 103/103 transitions.
Graph (complete) has 328 edges and 103 vertex of which 78 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.1 ms
Discarding 25 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 24 Pre rules applied. Total rules applied 1 place count 77 transition count 77
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 49 place count 53 transition count 77
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 0 with 2 rules applied. Total rules applied 51 place count 52 transition count 76
Applied a total of 51 rules in 33 ms. Remains 52 /103 variables (removed 51) and now considering 76/103 (removed 27) transitions.
// Phase 1: matrix 76 rows 52 cols
[2022-05-16 18:42:17] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 18:42:17] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 76 rows 52 cols
[2022-05-16 18:42:17] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 18:42:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 18:42:17] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
[2022-05-16 18:42:17] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 76 rows 52 cols
[2022-05-16 18:42:17] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 18:42:17] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 52/103 places, 76/103 transitions.
Finished structural reductions, in 1 iterations. Remains : 52/103 places, 76/103 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-24a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s48 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-24a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-24a-LTLFireability-05 finished in 334 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (!p1 U p2))))'
Support contains 5 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 103/103 transitions.
Applied a total of 0 rules in 8 ms. Remains 103 /103 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 103 cols
[2022-05-16 18:42:17] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-16 18:42:17] [INFO ] Implicit Places using invariants in 105 ms returned []
// Phase 1: matrix 103 rows 103 cols
[2022-05-16 18:42:17] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-16 18:42:17] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-16 18:42:17] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
// Phase 1: matrix 103 rows 103 cols
[2022-05-16 18:42:17] [INFO ] Computed 25 place invariants in 5 ms
[2022-05-16 18:42:17] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 103/103 transitions.
Stuttering acceptance computed with spot in 162 ms :[(NOT p2), true, (NOT p2), (NOT p2)]
Running random walk in product with property : GPUForwardProgress-PT-24a-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s48 1) (EQ s98 1) (EQ s102 1)), p1:(AND (EQ s32 1) (EQ s98 1) (EQ s102 1)), p0:(EQ s46 1)], 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, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 649 ms.
Product exploration explored 100000 steps with 50000 reset in 627 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Graph (complete) has 328 edges and 103 vertex of which 78 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.2 ms
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), true, (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p2) (NOT p1) (NOT p0))
Knowledge based reduction with 10 factoid took 337 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA GPUForwardProgress-PT-24a-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-24a-LTLFireability-06 finished in 2337 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 103/103 transitions.
Applied a total of 0 rules in 8 ms. Remains 103 /103 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 103 cols
[2022-05-16 18:42:19] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-16 18:42:19] [INFO ] Implicit Places using invariants in 142 ms returned []
// Phase 1: matrix 103 rows 103 cols
[2022-05-16 18:42:19] [INFO ] Computed 25 place invariants in 4 ms
[2022-05-16 18:42:20] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-16 18:42:20] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
// Phase 1: matrix 103 rows 103 cols
[2022-05-16 18:42:20] [INFO ] Computed 25 place invariants in 5 ms
[2022-05-16 18:42:20] [INFO ] Dead Transitions using invariants and state equation in 178 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 103/103 transitions.
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-24a-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s95 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 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-24a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-24a-LTLFireability-07 finished in 698 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((((p0 U G(X(F(p1)))) U p0) U G(p0)))'
Support contains 4 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 103/103 transitions.
Graph (complete) has 328 edges and 103 vertex of which 78 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.2 ms
Discarding 25 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 23 Pre rules applied. Total rules applied 1 place count 78 transition count 79
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 0 with 46 rules applied. Total rules applied 47 place count 55 transition count 79
Applied a total of 47 rules in 18 ms. Remains 55 /103 variables (removed 48) and now considering 79/103 (removed 24) transitions.
// Phase 1: matrix 79 rows 55 cols
[2022-05-16 18:42:20] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 18:42:20] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 79 rows 55 cols
[2022-05-16 18:42:20] [INFO ] Computed 1 place invariants in 4 ms
[2022-05-16 18:42:20] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-16 18:42:20] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
[2022-05-16 18:42:20] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 79 rows 55 cols
[2022-05-16 18:42:20] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 18:42:20] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 55/103 places, 79/103 transitions.
Finished structural reductions, in 1 iterations. Remains : 55/103 places, 79/103 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p1), (AND (NOT p1) p0)]
Running random walk in product with property : GPUForwardProgress-PT-24a-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s5 1) (EQ s51 1) (EQ s54 1)), p1:(AND (EQ s31 1) (EQ s51 1) (EQ s54 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 7 steps with 2 reset in 0 ms.
FORMULA GPUForwardProgress-PT-24a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-24a-LTLFireability-08 finished in 533 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U G((G(X((G(!p2) U p3)))&&p1))))'
Support contains 6 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 103/103 transitions.
Applied a total of 0 rules in 7 ms. Remains 103 /103 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 103 cols
[2022-05-16 18:42:21] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-16 18:42:21] [INFO ] Implicit Places using invariants in 160 ms returned []
// Phase 1: matrix 103 rows 103 cols
[2022-05-16 18:42:21] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-16 18:42:21] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-16 18:42:21] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 452 ms to find 0 implicit places.
// Phase 1: matrix 103 rows 103 cols
[2022-05-16 18:42:21] [INFO ] Computed 25 place invariants in 2 ms
[2022-05-16 18:42:21] [INFO ] Dead Transitions using invariants and state equation in 188 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 103/103 transitions.
Stuttering acceptance computed with spot in 568 ms :[(OR (NOT p1) (NOT p3)), (NOT p0), (AND (NOT p0) p1 (NOT p3) p2), (NOT p3), (AND (NOT p0) p1 p2), (OR (AND (NOT p1) p2) (AND p2 (NOT p3))), (NOT p3), (AND p2 (NOT p3))]
Running random walk in product with property : GPUForwardProgress-PT-24a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={1, 2} source=0 dest: 0}, { cond=(NOT p1), acceptance={0, 1, 2} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={0, 1, 2} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0, 1, 2} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0) (NOT p3) p2), acceptance={} source=2 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND p1 (NOT p3) p2), acceptance={1, 2} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={0, 1, 2} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) p2), acceptance={} source=3 dest: 1}, { cond=(OR (AND p1 (NOT p0)) (AND (NOT p0) p3)), acceptance={} source=3 dest: 2}, { cond=(OR p3 (NOT p2)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p1 (NOT p3) p2), acceptance={0, 1, 2} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={2} source=3 dest: 5}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={0, 2} source=3 dest: 5}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0, 1, 2} source=3 dest: 6}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={0, 2} source=3 dest: 7}], [{ cond=(AND p1 (NOT p0) p2), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=4 dest: 4}], [{ cond=(AND p1 p2), acceptance={1, 2} source=5 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={0, 1, 2} source=5 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=5 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND p1 p2), acceptance={0, 1, 2} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={2} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 2} source=5 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={0, 2} source=5 dest: 7}], [{ cond=(AND p1 (NOT p3) p2), acceptance={1, 2} source=6 dest: 0}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={0, 1, 2} source=6 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) p2), acceptance={} source=6 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p3)), acceptance={} source=6 dest: 2}, { cond=(AND p1 (NOT p3) p2), acceptance={0, 1, 2} source=6 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=6 dest: 4}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={2} source=6 dest: 5}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={0, 2} source=6 dest: 5}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0, 1, 2} source=6 dest: 6}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={0, 2} source=6 dest: 7}], [{ cond=(AND p1 (NOT p3) p2), acceptance={1, 2} source=7 dest: 0}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={0, 1, 2} source=7 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) p2), acceptance={} source=7 dest: 1}, { cond=(OR (AND p1 (NOT p0)) (AND (NOT p0) p3)), acceptance={} source=7 dest: 2}, { cond=(AND p3 p2), acceptance={0, 1} source=7 dest: 3}, { cond=(AND p1 (NOT p3) p2), acceptance={0, 1, 2} source=7 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=7 dest: 4}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={2} source=7 dest: 5}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={0, 2} source=7 dest: 5}, { cond=(AND p3 (NOT p2)), acceptance={0} source=7 dest: 7}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={0, 2} source=7 dest: 7}]], initial=0, aps=[p1:(AND (EQ s84 1) (EQ s98 1) (EQ s102 1)), p0:(AND (EQ s36 1) (EQ s98 1) (EQ s102 1)), p3:(AND (EQ s84 1) (EQ s98 1) (EQ s102 1)), p2:(OR (AND (EQ s58 1)...], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 4 steps with 1 reset in 1 ms.
FORMULA GPUForwardProgress-PT-24a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-24a-LTLFireability-10 finished in 1281 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))||(X(G(p1))&&G(p2)))))'
Support contains 5 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 103/103 transitions.
Applied a total of 0 rules in 8 ms. Remains 103 /103 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 103 cols
[2022-05-16 18:42:22] [INFO ] Computed 25 place invariants in 2 ms
[2022-05-16 18:42:22] [INFO ] Implicit Places using invariants in 133 ms returned []
// Phase 1: matrix 103 rows 103 cols
[2022-05-16 18:42:22] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-16 18:42:22] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-16 18:42:22] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 428 ms to find 0 implicit places.
// Phase 1: matrix 103 rows 103 cols
[2022-05-16 18:42:22] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-16 18:42:22] [INFO ] Dead Transitions using invariants and state equation in 163 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 103/103 transitions.
Stuttering acceptance computed with spot in 211 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : GPUForwardProgress-PT-24a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(OR (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p2 p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p2:(OR (EQ s44 0) (EQ s98 0) (EQ s102 0)), p0:(EQ s71 1), p1:(EQ s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-24a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-24a-LTLFireability-11 finished in 853 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F(!(G(p0) U (F(p1)&&p2))))))'
Support contains 3 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 103/103 transitions.
Graph (complete) has 328 edges and 103 vertex of which 78 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.1 ms
Discarding 25 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 22 Pre rules applied. Total rules applied 1 place count 77 transition count 79
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 45 place count 55 transition count 79
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 0 with 2 rules applied. Total rules applied 47 place count 54 transition count 78
Applied a total of 47 rules in 17 ms. Remains 54 /103 variables (removed 49) and now considering 78/103 (removed 25) transitions.
// Phase 1: matrix 78 rows 54 cols
[2022-05-16 18:42:23] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 18:42:23] [INFO ] Implicit Places using invariants in 85 ms returned []
// Phase 1: matrix 78 rows 54 cols
[2022-05-16 18:42:23] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 18:42:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 18:42:23] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
[2022-05-16 18:42:23] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 78 rows 54 cols
[2022-05-16 18:42:23] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 18:42:23] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/103 places, 78/103 transitions.
Finished structural reductions, in 1 iterations. Remains : 54/103 places, 78/103 transitions.
Stuttering acceptance computed with spot in 281 ms :[(AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p2 p0 p1), (AND p2 p0 p1)]
Running random walk in product with property : GPUForwardProgress-PT-24a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p2 p1), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(OR (AND p0 (NOT p2)) (AND p0 (NOT p1))), acceptance={} source=0 dest: 3}], [{ cond=(AND p2 p1), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={1} source=1 dest: 2}, { cond=(OR (AND p0 (NOT p2)) (AND p0 (NOT p1))), acceptance={} source=1 dest: 3}], [{ cond=(AND p2 p1), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={1} source=2 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(OR (AND p0 (NOT p2)) (AND p0 (NOT p1))), acceptance={0} source=3 dest: 3}, { cond=(AND p0 p2 p1), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p0 p2 (NOT p1)), acceptance={1} source=3 dest: 4}], [{ cond=(AND p0 (NOT p2) p1), acceptance={0} source=4 dest: 3}, { cond=(AND p0 p2 p1), acceptance={0, 1} source=4 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND p0 p2 (NOT p1)), acceptance={1} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s7 1), p1:(EQ s52 1), p0:(EQ s46 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 1990 reset in 798 ms.
Product exploration explored 100000 steps with 1984 reset in 558 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND p2 p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p0 (NOT p2) p1))))]
False Knowledge obtained : [(X (OR (AND p0 (NOT p2)) (AND p0 (NOT p1)))), (X (NOT (OR (AND p0 (NOT p2)) (AND p0 (NOT p1))))), (X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X (OR (AND p0 (NOT p2)) (AND p0 (NOT p1))))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p0 (NOT p1)))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1)))))]
Knowledge based reduction with 9 factoid took 1347 ms. Reduced automaton from 5 states, 18 edges and 3 AP to 5 states, 18 edges and 3 AP.
Stuttering acceptance computed with spot in 332 ms :[(AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p0 p2), (AND p1 p0 p2)]
Finished random walk after 6933 steps, including 37 resets, run visited all 7 properties in 405 ms. (steps per millisecond=17 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND p2 p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p0 (NOT p2) p1))))]
False Knowledge obtained : [(X (OR (AND p0 (NOT p2)) (AND p0 (NOT p1)))), (X (NOT (OR (AND p0 (NOT p2)) (AND p0 (NOT p1))))), (X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X (OR (AND p0 (NOT p2)) (AND p0 (NOT p1))))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p0 (NOT p1)))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND p0 p1 (NOT p2))), (F (AND p0 (NOT p1) p2)), (F (AND p0 p1 p2)), (F (AND p1 p2)), (F (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))), (F (AND (NOT p1) p2))]
Knowledge based reduction with 9 factoid took 1280 ms. Reduced automaton from 5 states, 18 edges and 3 AP to 5 states, 18 edges and 3 AP.
Stuttering acceptance computed with spot in 277 ms :[(AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p0 p2), (AND p1 p0 p2)]
Stuttering acceptance computed with spot in 277 ms :[(AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p0 p2), (AND p1 p0 p2)]
Support contains 3 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 78/78 transitions.
Applied a total of 0 rules in 9 ms. Remains 54 /54 variables (removed 0) and now considering 78/78 (removed 0) transitions.
// Phase 1: matrix 78 rows 54 cols
[2022-05-16 18:42:29] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 18:42:29] [INFO ] Implicit Places using invariants in 74 ms returned []
// Phase 1: matrix 78 rows 54 cols
[2022-05-16 18:42:29] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 18:42:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 18:42:29] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2022-05-16 18:42:29] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 78 rows 54 cols
[2022-05-16 18:42:29] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 18:42:29] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 78/78 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p1 p2))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p1 p2))))]
False Knowledge obtained : [(X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2))))]
Knowledge based reduction with 9 factoid took 1114 ms. Reduced automaton from 5 states, 18 edges and 3 AP to 5 states, 18 edges and 3 AP.
Stuttering acceptance computed with spot in 267 ms :[(AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p0 p2), (AND p1 p0 p2)]
Incomplete random walk after 10000 steps, including 76 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 7) seen :6
Finished Best-First random walk after 113 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=56 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p1 p2))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p1 p2))))]
False Knowledge obtained : [(X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND p0 p1 (NOT p2))), (F (AND p0 (NOT p1) p2)), (F (AND p0 p1 p2)), (F (AND p1 p2)), (F (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))), (F (AND (NOT p1) p2))]
Knowledge based reduction with 9 factoid took 1279 ms. Reduced automaton from 5 states, 18 edges and 3 AP to 5 states, 18 edges and 3 AP.
Stuttering acceptance computed with spot in 263 ms :[(AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p0 p2), (AND p1 p0 p2)]
Stuttering acceptance computed with spot in 268 ms :[(AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p0 p2), (AND p1 p0 p2)]
Stuttering acceptance computed with spot in 269 ms :[(AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p0 p2), (AND p1 p0 p2)]
Product exploration explored 100000 steps with 2001 reset in 746 ms.
Product exploration explored 100000 steps with 1963 reset in 665 ms.
Built C files in :
/tmp/ltsmin15253699670656767594
[2022-05-16 18:42:34] [INFO ] Computing symmetric may disable matrix : 78 transitions.
[2022-05-16 18:42:34] [INFO ] Computation of Complete disable matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 18:42:34] [INFO ] Computing symmetric may enable matrix : 78 transitions.
[2022-05-16 18:42:34] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 18:42:34] [INFO ] Computing Do-Not-Accords matrix : 78 transitions.
[2022-05-16 18:42:34] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 18:42:34] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15253699670656767594
Running compilation step : cd /tmp/ltsmin15253699670656767594;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 489 ms.
Running link step : cd /tmp/ltsmin15253699670656767594;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 67 ms.
Running LTSmin : cd /tmp/ltsmin15253699670656767594;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14964960914024816388.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 78/78 transitions.
Applied a total of 0 rules in 5 ms. Remains 54 /54 variables (removed 0) and now considering 78/78 (removed 0) transitions.
// Phase 1: matrix 78 rows 54 cols
[2022-05-16 18:42:49] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 18:42:49] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 78 rows 54 cols
[2022-05-16 18:42:49] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 18:42:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 18:42:49] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2022-05-16 18:42:49] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 78 rows 54 cols
[2022-05-16 18:42:49] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 18:42:49] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 78/78 transitions.
Built C files in :
/tmp/ltsmin2648366110156315279
[2022-05-16 18:42:50] [INFO ] Computing symmetric may disable matrix : 78 transitions.
[2022-05-16 18:42:50] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 18:42:50] [INFO ] Computing symmetric may enable matrix : 78 transitions.
[2022-05-16 18:42:50] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 18:42:50] [INFO ] Computing Do-Not-Accords matrix : 78 transitions.
[2022-05-16 18:42:50] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 18:42:50] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2648366110156315279
Running compilation step : cd /tmp/ltsmin2648366110156315279;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 369 ms.
Running link step : cd /tmp/ltsmin2648366110156315279;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin2648366110156315279;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13909815666233155889.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 18:43:05] [INFO ] Flatten gal took : 17 ms
[2022-05-16 18:43:05] [INFO ] Flatten gal took : 15 ms
[2022-05-16 18:43:05] [INFO ] Time to serialize gal into /tmp/LTL12085054542012466571.gal : 5 ms
[2022-05-16 18:43:05] [INFO ] Time to serialize properties into /tmp/LTL12881773717292168042.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12085054542012466571.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12881773717292168042.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1208505...268
Read 1 LTL properties
Checking formula 0 : !((X(G(F(!((G("(p91==1)"))U((F("(p101==1)"))&&("(p15==1)"))))))))
Formula 0 simplified : !XGF!(G"(p91==1)" U ("(p15==1)" & F"(p101==1)"))
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t54, t55, t68, t52.t66, t50.t67, t48.t65, t44.t64, t42.t69, t40.t63, t38.t70, t36.t62...380
Computing Next relation with stutter on 1.67772e+07 deadlock states
Detected timeout of ITS tools.
[2022-05-16 18:43:20] [INFO ] Flatten gal took : 9 ms
[2022-05-16 18:43:20] [INFO ] Applying decomposition
[2022-05-16 18:43:20] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph14167288153426165054.txt' '-o' '/tmp/graph14167288153426165054.bin' '-w' '/tmp/graph14167288153426165054.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14167288153426165054.bin' '-l' '-1' '-v' '-w' '/tmp/graph14167288153426165054.weights' '-q' '0' '-e' '0.001'
[2022-05-16 18:43:20] [INFO ] Decomposing Gal with order
[2022-05-16 18:43:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 18:43:20] [INFO ] Removed a total of 92 redundant transitions.
[2022-05-16 18:43:20] [INFO ] Flatten gal took : 84 ms
[2022-05-16 18:43:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2022-05-16 18:43:20] [INFO ] Time to serialize gal into /tmp/LTL3921159113258216707.gal : 4 ms
[2022-05-16 18:43:20] [INFO ] Time to serialize properties into /tmp/LTL11264276160589594255.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3921159113258216707.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11264276160589594255.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3921159...246
Read 1 LTL properties
Checking formula 0 : !((X(G(F(!((G("(u22.p91==1)"))U((F("(i24.u25.p101==1)"))&&("(u3.p15==1)"))))))))
Formula 0 simplified : !XGF!(G"(u22.p91==1)" U ("(u3.p15==1)" & F"(i24.u25.p101==1)"))
Reverse transition relation is NOT exact ! Due to transitions t55, t68, t52_t66, t50_t67, t48_t65, t44_t64, t42_t69, t40_t63, t38_t70, t36_t62, t34_t71, t3...400
Computing Next relation with stutter on 1.67772e+07 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17086412843370798615
[2022-05-16 18:43:35] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17086412843370798615
Running compilation step : cd /tmp/ltsmin17086412843370798615;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 333 ms.
Running link step : cd /tmp/ltsmin17086412843370798615;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin17086412843370798615;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](<>(!([]((LTLAPp0==true)) U (<>((LTLAPp1==true))&&(LTLAPp2==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property GPUForwardProgress-PT-24a-LTLFireability-12 finished in 87579 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(p0))||(p1 U X(G(X(p2))))))'
Support contains 5 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 103/103 transitions.
Applied a total of 0 rules in 1 ms. Remains 103 /103 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 103 cols
[2022-05-16 18:43:50] [INFO ] Computed 25 place invariants in 2 ms
[2022-05-16 18:43:50] [INFO ] Implicit Places using invariants in 117 ms returned []
// Phase 1: matrix 103 rows 103 cols
[2022-05-16 18:43:50] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-16 18:43:50] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-16 18:43:51] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
// Phase 1: matrix 103 rows 103 cols
[2022-05-16 18:43:51] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-16 18:43:51] [INFO ] Dead Transitions using invariants and state equation in 201 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 103/103 transitions.
Stuttering acceptance computed with spot in 435 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0)), true, (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-24a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 7}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 2}, { cond=(AND p0 p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 8}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 2}], [{ cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=(AND p1 p2), acceptance={} source=6 dest: 6}, { cond=(AND p1 (NOT p2)), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) p0), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=7 dest: 6}, { cond=(AND p1 p0), acceptance={} source=7 dest: 7}], [{ cond=(NOT p0), acceptance={} source=8 dest: 4}, { cond=p0, acceptance={} source=8 dest: 8}]], initial=0, aps=[p1:(AND (EQ s6 1) (EQ s98 1) (EQ s102 1)), p0:(EQ s70 1), p2:(NEQ s51 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 125 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-24a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-24a-LTLFireability-13 finished in 980 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U (X(p1)||p1)))'
Support contains 4 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 103/103 transitions.
Applied a total of 0 rules in 3 ms. Remains 103 /103 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 103 cols
[2022-05-16 18:43:51] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-16 18:43:51] [INFO ] Implicit Places using invariants in 154 ms returned []
// Phase 1: matrix 103 rows 103 cols
[2022-05-16 18:43:51] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-16 18:43:52] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-16 18:43:52] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 450 ms to find 0 implicit places.
// Phase 1: matrix 103 rows 103 cols
[2022-05-16 18:43:52] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-16 18:43:52] [INFO ] Dead Transitions using invariants and state equation in 179 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 103/103 transitions.
Stuttering acceptance computed with spot in 216 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-24a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s87 1), p0:(AND (EQ s40 1) (EQ s98 1) (EQ s102 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-24a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-24a-LTLFireability-14 finished in 873 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(F(p0)))||G(F(p1))))'
Support contains 4 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 103/103 transitions.
Graph (complete) has 328 edges and 103 vertex of which 78 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.1 ms
Discarding 25 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 23 Pre rules applied. Total rules applied 1 place count 78 transition count 79
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 0 with 46 rules applied. Total rules applied 47 place count 55 transition count 79
Applied a total of 47 rules in 15 ms. Remains 55 /103 variables (removed 48) and now considering 79/103 (removed 24) transitions.
// Phase 1: matrix 79 rows 55 cols
[2022-05-16 18:43:52] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 18:43:52] [INFO ] Implicit Places using invariants in 77 ms returned []
// Phase 1: matrix 79 rows 55 cols
[2022-05-16 18:43:52] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 18:43:52] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-16 18:43:52] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2022-05-16 18:43:52] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 79 rows 55 cols
[2022-05-16 18:43:52] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 18:43:52] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 55/103 places, 79/103 transitions.
Finished structural reductions, in 1 iterations. Remains : 55/103 places, 79/103 transitions.
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-24a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s19 0) (EQ s51 0) (EQ s54 0)), p1:(AND (EQ s2 1) (EQ s51 1) (EQ s54 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 205 reset in 620 ms.
Product exploration explored 100000 steps with 214 reset in 558 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 7250 steps, including 21 resets, run visited all 1 properties in 74 ms. (steps per millisecond=97 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 153 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 55 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 55/55 places, 79/79 transitions.
Applied a total of 0 rules in 7 ms. Remains 55 /55 variables (removed 0) and now considering 79/79 (removed 0) transitions.
// Phase 1: matrix 79 rows 55 cols
[2022-05-16 18:43:54] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 18:43:54] [INFO ] Implicit Places using invariants in 70 ms returned []
// Phase 1: matrix 79 rows 55 cols
[2022-05-16 18:43:54] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 18:43:55] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-16 18:43:55] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
[2022-05-16 18:43:55] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 79 rows 55 cols
[2022-05-16 18:43:55] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 18:43:55] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 55/55 places, 79/79 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 226 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 8522 steps, including 27 resets, run visited all 1 properties in 89 ms. (steps per millisecond=95 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 184 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 177 reset in 618 ms.
Product exploration explored 100000 steps with 182 reset in 529 ms.
Built C files in :
/tmp/ltsmin16372937655371578158
[2022-05-16 18:43:57] [INFO ] Computing symmetric may disable matrix : 79 transitions.
[2022-05-16 18:43:57] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 18:43:57] [INFO ] Computing symmetric may enable matrix : 79 transitions.
[2022-05-16 18:43:57] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 18:43:57] [INFO ] Computing Do-Not-Accords matrix : 79 transitions.
[2022-05-16 18:43:57] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 18:43:57] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16372937655371578158
Running compilation step : cd /tmp/ltsmin16372937655371578158;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 289 ms.
Running link step : cd /tmp/ltsmin16372937655371578158;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin16372937655371578158;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10096765446926131617.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 55 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 55/55 places, 79/79 transitions.
Applied a total of 0 rules in 5 ms. Remains 55 /55 variables (removed 0) and now considering 79/79 (removed 0) transitions.
// Phase 1: matrix 79 rows 55 cols
[2022-05-16 18:44:12] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 18:44:12] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 79 rows 55 cols
[2022-05-16 18:44:12] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 18:44:12] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-16 18:44:12] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
[2022-05-16 18:44:12] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 79 rows 55 cols
[2022-05-16 18:44:12] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 18:44:12] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 55/55 places, 79/79 transitions.
Built C files in :
/tmp/ltsmin1109017861494152760
[2022-05-16 18:44:12] [INFO ] Computing symmetric may disable matrix : 79 transitions.
[2022-05-16 18:44:12] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 18:44:12] [INFO ] Computing symmetric may enable matrix : 79 transitions.
[2022-05-16 18:44:12] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 18:44:12] [INFO ] Computing Do-Not-Accords matrix : 79 transitions.
[2022-05-16 18:44:12] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 18:44:12] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1109017861494152760
Running compilation step : cd /tmp/ltsmin1109017861494152760;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 414 ms.
Running link step : cd /tmp/ltsmin1109017861494152760;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin1109017861494152760;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7461266910095734373.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 18:44:27] [INFO ] Flatten gal took : 13 ms
[2022-05-16 18:44:27] [INFO ] Flatten gal took : 8 ms
[2022-05-16 18:44:27] [INFO ] Time to serialize gal into /tmp/LTL5722386284914275762.gal : 3 ms
[2022-05-16 18:44:27] [INFO ] Time to serialize properties into /tmp/LTL17053894335130627848.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5722386284914275762.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17053894335130627848.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5722386...267
Read 1 LTL properties
Checking formula 0 : !(((X(G(F("(((p38==0)||(p99==0))||(p103==0))"))))||(G(F("(((p4==1)&&(p99==1))&&(p103==1))")))))
Formula 0 simplified : !(XGF"(((p38==0)||(p99==0))||(p103==0))" | GF"(((p4==1)&&(p99==1))&&(p103==1))")
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t54, t71, t52.t66, t50.t67, t48.t65, t46.t68, t44.t64, t42.t69, t40.t63, t38.t70,...387
Computing Next relation with stutter on 1.67772e+07 deadlock states
3 unique states visited
0 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
118 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.21085,36296,1,0,242,141775,191,111,2506,67390,298
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA GPUForwardProgress-PT-24a-LTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property GPUForwardProgress-PT-24a-LTLFireability-15 finished in 36562 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F(!(G(p0) U (F(p1)&&p2))))))'
[2022-05-16 18:44:29] [INFO ] Flatten gal took : 10 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13822044139467615787
[2022-05-16 18:44:29] [INFO ] Applying decomposition
[2022-05-16 18:44:29] [INFO ] Computing symmetric may disable matrix : 103 transitions.
[2022-05-16 18:44:29] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 18:44:29] [INFO ] Computing symmetric may enable matrix : 103 transitions.
[2022-05-16 18:44:29] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 18:44:29] [INFO ] Computing Do-Not-Accords matrix : 103 transitions.
[2022-05-16 18:44:29] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 18:44:29] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13822044139467615787
Running compilation step : cd /tmp/ltsmin13822044139467615787;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-16 18:44:29] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph9544589133882751284.txt' '-o' '/tmp/graph9544589133882751284.bin' '-w' '/tmp/graph9544589133882751284.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9544589133882751284.bin' '-l' '-1' '-v' '-w' '/tmp/graph9544589133882751284.weights' '-q' '0' '-e' '0.001'
[2022-05-16 18:44:29] [INFO ] Decomposing Gal with order
[2022-05-16 18:44:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 18:44:29] [INFO ] Removed a total of 92 redundant transitions.
[2022-05-16 18:44:29] [INFO ] Flatten gal took : 48 ms
[2022-05-16 18:44:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2022-05-16 18:44:29] [INFO ] Time to serialize gal into /tmp/LTLFireability5738688666483941298.gal : 5 ms
[2022-05-16 18:44:29] [INFO ] Time to serialize properties into /tmp/LTLFireability5087939320777674165.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability5738688666483941298.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5087939320777674165.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...267
Read 1 LTL properties
Checking formula 0 : !((X(G(F(!((G("(u22.p91==1)"))U((F("(i24.u25.p101==1)"))&&("(u3.p15==1)"))))))))
Formula 0 simplified : !XGF!(G"(u22.p91==1)" U ("(u3.p15==1)" & F"(i24.u25.p101==1)"))
Reverse transition relation is NOT exact ! Due to transitions t53, i24.u24.t4, i24.u25.t1, i24.u25.t2, Intersection with reachable at each step enabled. (...201
Computing Next relation with stutter on 1.67772e+07 deadlock states
Compilation finished in 505 ms.
Running link step : cd /tmp/ltsmin13822044139467615787;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin13822044139467615787;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](<>(!([]((LTLAPp0==true)) U (<>((LTLAPp1==true))&&(LTLAPp2==true))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.004: LTL layer: formula: X([](<>(!([]((LTLAPp0==true)) U (<>((LTLAPp1==true))&&(LTLAPp2==true))))))
pins2lts-mc-linux64( 1/ 8), 0.004: "X([](<>(!([]((LTLAPp0==true)) U (<>((LTLAPp1==true))&&(LTLAPp2==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.004: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.007: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.044: There are 107 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.044: State length is 104, there are 123 groups
pins2lts-mc-linux64( 0/ 8), 0.044: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.044: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.044: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.044: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 0.099: [Blue] ~114 levels ~960 states ~8832 transitions
pins2lts-mc-linux64( 2/ 8), 0.148: [Blue] ~222 levels ~1920 states ~16960 transitions
pins2lts-mc-linux64( 2/ 8), 0.240: [Blue] ~433 levels ~3840 states ~34880 transitions
pins2lts-mc-linux64( 2/ 8), 0.428: [Blue] ~860 levels ~7680 states ~71048 transitions
pins2lts-mc-linux64( 1/ 8), 0.625: [Blue] ~207 levels ~15360 states ~84784 transitions
pins2lts-mc-linux64( 5/ 8), 1.016: [Blue] ~1013 levels ~30720 states ~114584 transitions
pins2lts-mc-linux64( 7/ 8), 1.393: [Blue] ~1917 levels ~61440 states ~234872 transitions
pins2lts-mc-linux64( 7/ 8), 2.053: [Blue] ~2321 levels ~122880 states ~402200 transitions
pins2lts-mc-linux64( 7/ 8), 2.875: [Blue] ~2428 levels ~245760 states ~760576 transitions
pins2lts-mc-linux64( 7/ 8), 4.105: [Blue] ~3615 levels ~491520 states ~1500088 transitions
pins2lts-mc-linux64( 5/ 8), 5.787: [Blue] ~2784 levels ~983040 states ~3032736 transitions
pins2lts-mc-linux64( 5/ 8), 8.627: [Blue] ~6614 levels ~1966080 states ~6303984 transitions
pins2lts-mc-linux64( 5/ 8), 14.352: [Blue] ~6798 levels ~3932160 states ~13227008 transitions
pins2lts-mc-linux64( 5/ 8), 25.865: [Blue] ~18576 levels ~7864320 states ~27367712 transitions
pins2lts-mc-linux64( 5/ 8), 49.607: [Blue] ~18721 levels ~15728640 states ~56809720 transitions
pins2lts-mc-linux64( 5/ 8), 98.233: [Blue] ~55075 levels ~31457280 states ~117946360 transitions
pins2lts-mc-linux64( 5/ 8), 197.847: [Blue] ~55075 levels ~62914560 states ~244012576 transitions
pins2lts-mc-linux64( 5/ 8), 409.486: [Blue] ~164905 levels ~125829120 states ~507864280 transitions
pins2lts-mc-linux64( 3/ 8), 503.347: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 503.400:
pins2lts-mc-linux64( 0/ 8), 503.400: Explored 129050568 states 687326343 transitions, fanout: 5.326
pins2lts-mc-linux64( 0/ 8), 503.400: Total exploration time 503.300 sec (503.240 sec minimum, 503.271 sec on average)
pins2lts-mc-linux64( 0/ 8), 503.400: States per second: 256409, Transitions per second: 1365640
pins2lts-mc-linux64( 0/ 8), 503.400:
pins2lts-mc-linux64( 0/ 8), 503.400: State space has 134217301 states, 11764925 are accepting
pins2lts-mc-linux64( 0/ 8), 503.400: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 503.400: blue states: 129050568 (96.15%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 503.400: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 503.400: all-red states: 59338575 (44.21%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 503.400:
pins2lts-mc-linux64( 0/ 8), 503.400: Total memory used for local state coloring: 31.5MB
pins2lts-mc-linux64( 0/ 8), 503.400:
pins2lts-mc-linux64( 0/ 8), 503.400: Queue width: 8B, total height: 2061875, memory: 15.73MB
pins2lts-mc-linux64( 0/ 8), 503.400: Tree memory: 1027.0MB, 8.0 B/state, compr.: 1.9%
pins2lts-mc-linux64( 0/ 8), 503.400: Tree fill ratio (roots/leafs): 99.0%/1.0%
pins2lts-mc-linux64( 0/ 8), 503.400: Stored 103 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 503.400: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 503.400: Est. total memory use: 1042.8MB (~1039.7MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin13822044139467615787;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](<>(!([]((LTLAPp0==true)) U (<>((LTLAPp1==true))&&(LTLAPp2==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin13822044139467615787;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](<>(!([]((LTLAPp0==true)) U (<>((LTLAPp1==true))&&(LTLAPp2==true))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-16 19:05:18] [INFO ] Applying decomposition
[2022-05-16 19:05:19] [INFO ] Flatten gal took : 364 ms
[2022-05-16 19:05:19] [INFO ] Decomposing Gal with order
[2022-05-16 19:05:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 19:05:19] [INFO ] Removed a total of 92 redundant transitions.
[2022-05-16 19:05:19] [INFO ] Flatten gal took : 165 ms
[2022-05-16 19:05:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 19 ms.
[2022-05-16 19:05:19] [INFO ] Time to serialize gal into /tmp/LTLFireability2959940628087039011.gal : 62 ms
[2022-05-16 19:05:19] [INFO ] Time to serialize properties into /tmp/LTLFireability16925789046197027603.ltl : 11 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2959940628087039011.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16925789046197027603.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 1 LTL properties
Checking formula 0 : !((X(G(F(!((G("(u23.p91==1)"))U((F("(u26.p101==1)"))&&("(u4.p15==1)"))))))))
Formula 0 simplified : !XGF!(G"(u23.p91==1)" U ("(u4.p15==1)" & F"(u26.p101==1)"))
Reverse transition relation is NOT exact ! Due to transitions t53, u25.t4, u26.t1, u26.t2, Intersection with reachable at each step enabled. (destroyed/re...189
Computing Next relation with stutter on 1.67772e+07 deadlock states
80373 unique states visited
0 strongly connected components in search stack
257694 transitions explored
556 items max in DFS search stack
71610 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,716.157,14920164,1,0,3.55634e+07,134,1551,4.29496e+07,128,342,44607046
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA GPUForwardProgress-PT-24a-LTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 2319960 ms.

BK_STOP 1652728851256

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

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