Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r197-tall-171640625400338.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is GPUForwardProgress-PT-20b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-tall-171640625400338
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 22:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Apr 11 22:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Apr 11 22:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Apr 11 22:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 103K May 18 16:42 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-20b-LTLFireability-00
FORMULA_NAME GPUForwardProgress-PT-20b-LTLFireability-01
FORMULA_NAME GPUForwardProgress-PT-20b-LTLFireability-02
FORMULA_NAME GPUForwardProgress-PT-20b-LTLFireability-03
FORMULA_NAME GPUForwardProgress-PT-20b-LTLFireability-04
FORMULA_NAME GPUForwardProgress-PT-20b-LTLFireability-05
FORMULA_NAME GPUForwardProgress-PT-20b-LTLFireability-06
FORMULA_NAME GPUForwardProgress-PT-20b-LTLFireability-07
FORMULA_NAME GPUForwardProgress-PT-20b-LTLFireability-08
FORMULA_NAME GPUForwardProgress-PT-20b-LTLFireability-09
FORMULA_NAME GPUForwardProgress-PT-20b-LTLFireability-10
FORMULA_NAME GPUForwardProgress-PT-20b-LTLFireability-11
FORMULA_NAME GPUForwardProgress-PT-20b-LTLFireability-12
FORMULA_NAME GPUForwardProgress-PT-20b-LTLFireability-13
FORMULA_NAME GPUForwardProgress-PT-20b-LTLFireability-14
FORMULA_NAME GPUForwardProgress-PT-20b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716554889058

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-20b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-24 12:48:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 12:48:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 12:48:10] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2024-05-24 12:48:10] [INFO ] Transformed 416 places.
[2024-05-24 12:48:10] [INFO ] Transformed 437 transitions.
[2024-05-24 12:48:10] [INFO ] Found NUPN structural information;
[2024-05-24 12:48:10] [INFO ] Parsed PT model containing 416 places and 437 transitions and 1077 arcs in 127 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA GPUForwardProgress-PT-20b-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-20b-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 416 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 416/416 places, 437/437 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 415 transition count 437
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 43 place count 373 transition count 395
Iterating global reduction 1 with 42 rules applied. Total rules applied 85 place count 373 transition count 395
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 102 place count 356 transition count 378
Iterating global reduction 1 with 17 rules applied. Total rules applied 119 place count 356 transition count 378
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 134 place count 356 transition count 363
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 135 place count 355 transition count 362
Iterating global reduction 2 with 1 rules applied. Total rules applied 136 place count 355 transition count 362
Applied a total of 136 rules in 322 ms. Remains 355 /416 variables (removed 61) and now considering 362/437 (removed 75) transitions.
// Phase 1: matrix 362 rows 355 cols
[2024-05-24 12:48:11] [INFO ] Computed 21 invariants in 10 ms
[2024-05-24 12:48:11] [INFO ] Implicit Places using invariants in 248 ms returned []
[2024-05-24 12:48:11] [INFO ] Invariant cache hit.
[2024-05-24 12:48:11] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 508 ms to find 0 implicit places.
[2024-05-24 12:48:11] [INFO ] Invariant cache hit.
[2024-05-24 12:48:11] [INFO ] Dead Transitions using invariants and state equation in 175 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 355/416 places, 362/437 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1006 ms. Remains : 355/416 places, 362/437 transitions.
Support contains 30 out of 355 places after structural reductions.
[2024-05-24 12:48:11] [INFO ] Flatten gal took : 52 ms
[2024-05-24 12:48:12] [INFO ] Flatten gal took : 19 ms
[2024-05-24 12:48:12] [INFO ] Input system was already deterministic with 362 transitions.
Support contains 29 out of 355 places (down from 30) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 58 resets, run finished after 361 ms. (steps per millisecond=27 ) properties (out of 27) seen :17
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :3
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-24 12:48:12] [INFO ] Invariant cache hit.
[2024-05-24 12:48:13] [INFO ] [Real]Absence check using 0 positive and 21 generalized place invariants in 9 ms returned sat
[2024-05-24 12:48:13] [INFO ] After 241ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:4
[2024-05-24 12:48:13] [INFO ] After 292ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-24 12:48:13] [INFO ] After 513ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-24 12:48:13] [INFO ] [Nat]Absence check using 0 positive and 21 generalized place invariants in 8 ms returned sat
[2024-05-24 12:48:13] [INFO ] After 230ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-24 12:48:13] [INFO ] After 402ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 110 ms.
[2024-05-24 12:48:14] [INFO ] After 665ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 1 different solutions.
Finished Parikh walk after 143 steps, including 0 resets, run visited all 6 properties in 11 ms. (steps per millisecond=13 )
Parikh walk visited 6 properties in 12 ms.
Computed a total of 66 stabilizing places and 66 stable transitions
Graph (complete) has 551 edges and 355 vertex of which 331 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.14 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G((p0&&X(G(p1))))) U (p0||X(F(p2)))))'
Support contains 3 out of 355 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 355/355 places, 362/362 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 348 transition count 355
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 348 transition count 355
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 348 transition count 353
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 346 transition count 351
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 346 transition count 351
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 22 place count 346 transition count 349
Applied a total of 22 rules in 47 ms. Remains 346 /355 variables (removed 9) and now considering 349/362 (removed 13) transitions.
// Phase 1: matrix 349 rows 346 cols
[2024-05-24 12:48:14] [INFO ] Computed 21 invariants in 3 ms
[2024-05-24 12:48:14] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-24 12:48:14] [INFO ] Invariant cache hit.
[2024-05-24 12:48:14] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 462 ms to find 0 implicit places.
[2024-05-24 12:48:14] [INFO ] Invariant cache hit.
[2024-05-24 12:48:15] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 346/355 places, 349/362 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 666 ms. Remains : 346/355 places, 349/362 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 267 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Running random walk in product with property : GPUForwardProgress-PT-20b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s179 1), p2:(NEQ s308 1), p1:(EQ s196 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 320 ms.
Product exploration explored 100000 steps with 50000 reset in 222 ms.
Computed a total of 63 stabilizing places and 63 stable transitions
Graph (complete) has 538 edges and 346 vertex of which 322 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.7 ms
Computed a total of 63 stabilizing places and 63 stable transitions
Detected a total of 63/346 stabilizing places and 63/349 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X p2)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 17 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPUForwardProgress-PT-20b-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-20b-LTLFireability-00 finished in 1563 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p1)||p0)))'
Support contains 3 out of 355 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 355/355 places, 362/362 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 347 transition count 354
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 347 transition count 354
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 347 transition count 352
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 344 transition count 349
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 344 transition count 349
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 27 place count 344 transition count 346
Applied a total of 27 rules in 32 ms. Remains 344 /355 variables (removed 11) and now considering 346/362 (removed 16) transitions.
// Phase 1: matrix 346 rows 344 cols
[2024-05-24 12:48:15] [INFO ] Computed 21 invariants in 4 ms
[2024-05-24 12:48:16] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-24 12:48:16] [INFO ] Invariant cache hit.
[2024-05-24 12:48:16] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
[2024-05-24 12:48:16] [INFO ] Invariant cache hit.
[2024-05-24 12:48:16] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 344/355 places, 346/362 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 484 ms. Remains : 344/355 places, 346/362 transitions.
Stuttering acceptance computed with spot in 105 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-20b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s223 1) (EQ s212 1)), p1:(EQ s122 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, 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-20b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-20b-LTLFireability-02 finished in 608 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 355 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 355/355 places, 362/362 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 348 transition count 355
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 348 transition count 355
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 348 transition count 353
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 346 transition count 351
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 346 transition count 351
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 22 place count 346 transition count 349
Applied a total of 22 rules in 33 ms. Remains 346 /355 variables (removed 9) and now considering 349/362 (removed 13) transitions.
// Phase 1: matrix 349 rows 346 cols
[2024-05-24 12:48:16] [INFO ] Computed 21 invariants in 2 ms
[2024-05-24 12:48:16] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-24 12:48:16] [INFO ] Invariant cache hit.
[2024-05-24 12:48:16] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
[2024-05-24 12:48:16] [INFO ] Invariant cache hit.
[2024-05-24 12:48:16] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 346/355 places, 349/362 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 476 ms. Remains : 346/355 places, 349/362 transitions.
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-20b-LTLFireability-03 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:(NEQ s82 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 31733 steps with 177 reset in 87 ms.
FORMULA GPUForwardProgress-PT-20b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-20b-LTLFireability-03 finished in 661 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 355 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 355/355 places, 362/362 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 347 transition count 354
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 347 transition count 354
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 347 transition count 352
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 344 transition count 349
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 344 transition count 349
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 27 place count 344 transition count 346
Applied a total of 27 rules in 23 ms. Remains 344 /355 variables (removed 11) and now considering 346/362 (removed 16) transitions.
// Phase 1: matrix 346 rows 344 cols
[2024-05-24 12:48:17] [INFO ] Computed 21 invariants in 5 ms
[2024-05-24 12:48:17] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-24 12:48:17] [INFO ] Invariant cache hit.
[2024-05-24 12:48:17] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
[2024-05-24 12:48:17] [INFO ] Invariant cache hit.
[2024-05-24 12:48:17] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 344/355 places, 346/362 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 466 ms. Remains : 344/355 places, 346/362 transitions.
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-20b-LTLFireability-04 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 s122 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 1 ms.
FORMULA GPUForwardProgress-PT-20b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-20b-LTLFireability-04 finished in 579 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 355 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 355/355 places, 362/362 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 347 transition count 354
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 347 transition count 354
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 347 transition count 352
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 345 transition count 350
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 345 transition count 350
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 24 place count 345 transition count 348
Applied a total of 24 rules in 21 ms. Remains 345 /355 variables (removed 10) and now considering 348/362 (removed 14) transitions.
// Phase 1: matrix 348 rows 345 cols
[2024-05-24 12:48:17] [INFO ] Computed 21 invariants in 5 ms
[2024-05-24 12:48:17] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-24 12:48:17] [INFO ] Invariant cache hit.
[2024-05-24 12:48:18] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
[2024-05-24 12:48:18] [INFO ] Invariant cache hit.
[2024-05-24 12:48:18] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 345/355 places, 348/362 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 444 ms. Remains : 345/355 places, 348/362 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-20b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s113 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 156 ms.
Product exploration explored 100000 steps with 50000 reset in 186 ms.
Computed a total of 63 stabilizing places and 63 stable transitions
Graph (complete) has 537 edges and 345 vertex of which 321 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.3 ms
Computed a total of 63 stabilizing places and 63 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPUForwardProgress-PT-20b-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-20b-LTLFireability-05 finished in 902 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 355 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 355/355 places, 362/362 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 347 transition count 354
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 347 transition count 354
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 347 transition count 352
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 344 transition count 349
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 344 transition count 349
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 27 place count 344 transition count 346
Applied a total of 27 rules in 23 ms. Remains 344 /355 variables (removed 11) and now considering 346/362 (removed 16) transitions.
// Phase 1: matrix 346 rows 344 cols
[2024-05-24 12:48:18] [INFO ] Computed 21 invariants in 5 ms
[2024-05-24 12:48:18] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-24 12:48:18] [INFO ] Invariant cache hit.
[2024-05-24 12:48:18] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
[2024-05-24 12:48:18] [INFO ] Invariant cache hit.
[2024-05-24 12:48:19] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 344/355 places, 346/362 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 451 ms. Remains : 344/355 places, 346/362 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-20b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s182 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 969 reset in 134 ms.
Product exploration explored 100000 steps with 984 reset in 269 ms.
Computed a total of 63 stabilizing places and 63 stable transitions
Graph (complete) has 535 edges and 344 vertex of which 320 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.3 ms
Computed a total of 63 stabilizing places and 63 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 79 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 94 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=47 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 84 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-24 12:48:20] [INFO ] Invariant cache hit.
[2024-05-24 12:48:20] [INFO ] [Real]Absence check using 0 positive and 21 generalized place invariants in 6 ms returned sat
[2024-05-24 12:48:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:48:20] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2024-05-24 12:48:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 12:48:20] [INFO ] [Nat]Absence check using 0 positive and 21 generalized place invariants in 6 ms returned sat
[2024-05-24 12:48:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 12:48:20] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2024-05-24 12:48:20] [INFO ] Computed and/alt/rep : 340/446/340 causal constraints (skipped 5 transitions) in 19 ms.
[2024-05-24 12:48:22] [INFO ] Added : 326 causal constraints over 66 iterations in 1568 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 344 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 344/344 places, 346/346 transitions.
Applied a total of 0 rules in 10 ms. Remains 344 /344 variables (removed 0) and now considering 346/346 (removed 0) transitions.
[2024-05-24 12:48:22] [INFO ] Invariant cache hit.
[2024-05-24 12:48:22] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-24 12:48:22] [INFO ] Invariant cache hit.
[2024-05-24 12:48:22] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
[2024-05-24 12:48:22] [INFO ] Invariant cache hit.
[2024-05-24 12:48:22] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 436 ms. Remains : 344/344 places, 346/346 transitions.
Computed a total of 63 stabilizing places and 63 stable transitions
Graph (complete) has 535 edges and 344 vertex of which 320 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.4 ms
Computed a total of 63 stabilizing places and 63 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 77 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 75 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=37 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 98 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-24 12:48:23] [INFO ] Invariant cache hit.
[2024-05-24 12:48:23] [INFO ] [Real]Absence check using 0 positive and 21 generalized place invariants in 5 ms returned sat
[2024-05-24 12:48:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:48:23] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2024-05-24 12:48:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 12:48:23] [INFO ] [Nat]Absence check using 0 positive and 21 generalized place invariants in 5 ms returned sat
[2024-05-24 12:48:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 12:48:23] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2024-05-24 12:48:23] [INFO ] Computed and/alt/rep : 340/446/340 causal constraints (skipped 5 transitions) in 18 ms.
[2024-05-24 12:48:25] [INFO ] Added : 326 causal constraints over 66 iterations in 1475 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 967 reset in 144 ms.
Product exploration explored 100000 steps with 977 reset in 153 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 344 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 344/344 places, 346/346 transitions.
Graph (trivial) has 281 edges and 344 vertex of which 6 / 344 are part of one of the 1 SCC in 7 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 529 edges and 339 vertex of which 315 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.1 ms
Discarding 24 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Performed 160 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 160 rules applied. Total rules applied 162 place count 315 transition count 337
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 22 Pre rules applied. Total rules applied 162 place count 315 transition count 339
Deduced a syphon composed of 182 places in 0 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 184 place count 315 transition count 339
Discarding 116 places :
Symmetric choice reduction at 1 with 116 rule applications. Total rules 300 place count 199 transition count 223
Deduced a syphon composed of 85 places in 0 ms
Iterating global reduction 1 with 116 rules applied. Total rules applied 416 place count 199 transition count 223
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 435 place count 180 transition count 204
Deduced a syphon composed of 66 places in 1 ms
Iterating global reduction 1 with 19 rules applied. Total rules applied 454 place count 180 transition count 204
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 132 places in 0 ms
Iterating global reduction 1 with 66 rules applied. Total rules applied 520 place count 180 transition count 205
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 522 place count 180 transition count 203
Discarding 47 places :
Symmetric choice reduction at 2 with 47 rule applications. Total rules 569 place count 133 transition count 155
Deduced a syphon composed of 85 places in 0 ms
Iterating global reduction 2 with 47 rules applied. Total rules applied 616 place count 133 transition count 155
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 86 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 617 place count 133 transition count 155
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 618 place count 132 transition count 154
Deduced a syphon composed of 85 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 619 place count 132 transition count 154
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -59
Deduced a syphon composed of 105 places in 0 ms
Iterating global reduction 2 with 20 rules applied. Total rules applied 639 place count 132 transition count 213
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 677 place count 94 transition count 137
Deduced a syphon composed of 85 places in 0 ms
Iterating global reduction 2 with 38 rules applied. Total rules applied 715 place count 94 transition count 137
Discarding 54 places :
Symmetric choice reduction at 2 with 54 rule applications. Total rules 769 place count 40 transition count 47
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 2 with 54 rules applied. Total rules applied 823 place count 40 transition count 47
Deduced a syphon composed of 31 places in 0 ms
Applied a total of 823 rules in 81 ms. Remains 40 /344 variables (removed 304) and now considering 47/346 (removed 299) transitions.
[2024-05-24 12:48:25] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 47 rows 40 cols
[2024-05-24 12:48:25] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 12:48:26] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/344 places, 47/346 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 136 ms. Remains : 40/344 places, 47/346 transitions.
Built C files in :
/tmp/ltsmin3230552887193109411
[2024-05-24 12:48:26] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3230552887193109411
Running compilation step : cd /tmp/ltsmin3230552887193109411;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 551 ms.
Running link step : cd /tmp/ltsmin3230552887193109411;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin3230552887193109411;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16271501053437702495.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 344 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 344/344 places, 346/346 transitions.
Applied a total of 0 rules in 15 ms. Remains 344 /344 variables (removed 0) and now considering 346/346 (removed 0) transitions.
// Phase 1: matrix 346 rows 344 cols
[2024-05-24 12:48:41] [INFO ] Computed 21 invariants in 3 ms
[2024-05-24 12:48:41] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-24 12:48:41] [INFO ] Invariant cache hit.
[2024-05-24 12:48:41] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
[2024-05-24 12:48:41] [INFO ] Invariant cache hit.
[2024-05-24 12:48:41] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 429 ms. Remains : 344/344 places, 346/346 transitions.
Built C files in :
/tmp/ltsmin17046335244628264736
[2024-05-24 12:48:41] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17046335244628264736
Running compilation step : cd /tmp/ltsmin17046335244628264736;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 458 ms.
Running link step : cd /tmp/ltsmin17046335244628264736;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin17046335244628264736;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12103791322421577938.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 12:48:56] [INFO ] Flatten gal took : 14 ms
[2024-05-24 12:48:56] [INFO ] Flatten gal took : 14 ms
[2024-05-24 12:48:56] [INFO ] Time to serialize gal into /tmp/LTL7910482292225984168.gal : 4 ms
[2024-05-24 12:48:56] [INFO ] Time to serialize properties into /tmp/LTL1077633378066160485.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7910482292225984168.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9914695487387143627.hoa' '-atoms' '/tmp/LTL1077633378066160485.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL1077633378066160485.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9914695487387143627.hoa
Detected timeout of ITS tools.
[2024-05-24 12:49:11] [INFO ] Flatten gal took : 15 ms
[2024-05-24 12:49:11] [INFO ] Flatten gal took : 13 ms
[2024-05-24 12:49:11] [INFO ] Time to serialize gal into /tmp/LTL8173738725314835770.gal : 3 ms
[2024-05-24 12:49:11] [INFO ] Time to serialize properties into /tmp/LTL13712425373005529304.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8173738725314835770.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13712425373005529304.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(p214==1)")))))
Formula 0 simplified : XXG!"(p214==1)"
Detected timeout of ITS tools.
[2024-05-24 12:49:26] [INFO ] Flatten gal took : 13 ms
[2024-05-24 12:49:26] [INFO ] Applying decomposition
[2024-05-24 12:49:26] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph4193966864204667797.txt' '-o' '/tmp/graph4193966864204667797.bin' '-w' '/tmp/graph4193966864204667797.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4193966864204667797.bin' '-l' '-1' '-v' '-w' '/tmp/graph4193966864204667797.weights' '-q' '0' '-e' '0.001'
[2024-05-24 12:49:27] [INFO ] Decomposing Gal with order
[2024-05-24 12:49:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 12:49:27] [INFO ] Removed a total of 101 redundant transitions.
[2024-05-24 12:49:27] [INFO ] Flatten gal took : 68 ms
[2024-05-24 12:49:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2024-05-24 12:49:27] [INFO ] Time to serialize gal into /tmp/LTL15127679913144904735.gal : 6 ms
[2024-05-24 12:49:27] [INFO ] Time to serialize properties into /tmp/LTL7901193469113342414.ltl : 9 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15127679913144904735.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7901193469113342414.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(i10.i1.u77.p214==1)")))))
Formula 0 simplified : XXG!"(i10.i1.u77.p214==1)"
Reverse transition relation is NOT exact ! Due to transitions t320, i0.t315, i0.i2.u13.t308, i1.i0.t294, i1.i0.u14.t302, i2.t287, i2.i1.u20.t278, i3.i0.t26...751
Computing Next relation with stutter on 6.97252e+09 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
94 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,0.979563,56276,1,0,89676,281,4034,108690,149,752,183341
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-20b-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property GPUForwardProgress-PT-20b-LTLFireability-06 finished in 69622 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(X(p1))||G(p2)||F(p3))))'
Support contains 5 out of 355 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 355/355 places, 362/362 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 347 transition count 354
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 347 transition count 354
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 347 transition count 352
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 344 transition count 349
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 344 transition count 349
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 27 place count 344 transition count 346
Applied a total of 27 rules in 19 ms. Remains 344 /355 variables (removed 11) and now considering 346/362 (removed 16) transitions.
[2024-05-24 12:49:28] [INFO ] Invariant cache hit.
[2024-05-24 12:49:28] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-24 12:49:28] [INFO ] Invariant cache hit.
[2024-05-24 12:49:28] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
[2024-05-24 12:49:28] [INFO ] Invariant cache hit.
[2024-05-24 12:49:28] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 344/355 places, 346/362 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 454 ms. Remains : 344/355 places, 346/362 transitions.
Stuttering acceptance computed with spot in 275 ms :[(AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p1)), (NOT p3)]
Running random walk in product with property : GPUForwardProgress-PT-20b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=0 dest: 7}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=4 dest: 0}, { cond=(AND p2 (NOT p3)), acceptance={} source=4 dest: 5}], [{ cond=(AND p2 (NOT p3) (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=5 dest: 7}], [{ cond=(NOT p3), acceptance={} source=6 dest: 0}], [{ cond=(NOT p3), acceptance={0} source=7 dest: 7}]], initial=1, aps=[p3:(EQ s77 1), p1:(EQ s59 1), p2:(EQ s59 0), p0:(AND (EQ s195 1) (EQ s331 1) (EQ s342 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]]
Product exploration explored 100000 steps with 654 reset in 165 ms.
Product exploration explored 100000 steps with 656 reset in 184 ms.
Computed a total of 63 stabilizing places and 63 stable transitions
Graph (complete) has 535 edges and 344 vertex of which 320 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.2 ms
Computed a total of 63 stabilizing places and 63 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p1) p2 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (AND (NOT p0) p2 (NOT p3))), (X (X (AND p2 (NOT p3)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 187 ms. Reduced automaton from 8 states, 12 edges and 4 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[(NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 57 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-24 12:49:29] [INFO ] Invariant cache hit.
[2024-05-24 12:49:29] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 12:49:30] [INFO ] [Nat]Absence check using 0 positive and 21 generalized place invariants in 8 ms returned sat
[2024-05-24 12:49:30] [INFO ] After 88ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-05-24 12:49:30] [INFO ] After 108ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2024-05-24 12:49:30] [INFO ] After 203ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 99 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=99 )
Parikh walk visited 1 properties in 4 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p3) (NOT p1) p2 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (AND (NOT p0) p2 (NOT p3))), (X (X (AND p2 (NOT p3)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (G (NOT (AND (NOT p2) (NOT p3) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p2 (NOT p3) (NOT p1)))), (F p3), (F (NOT (AND p2 (NOT p3)))), (F (AND (NOT p2) (NOT p3)))]
Knowledge based reduction with 7 factoid took 194 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[(NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 210 ms :[(NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1))]
Support contains 2 out of 344 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 344/344 places, 346/346 transitions.
Applied a total of 0 rules in 7 ms. Remains 344 /344 variables (removed 0) and now considering 346/346 (removed 0) transitions.
[2024-05-24 12:49:30] [INFO ] Invariant cache hit.
[2024-05-24 12:49:30] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-24 12:49:30] [INFO ] Invariant cache hit.
[2024-05-24 12:49:31] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
[2024-05-24 12:49:31] [INFO ] Invariant cache hit.
[2024-05-24 12:49:31] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 414 ms. Remains : 344/344 places, 346/346 transitions.
Computed a total of 63 stabilizing places and 63 stable transitions
Graph (complete) has 535 edges and 344 vertex of which 320 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.2 ms
Computed a total of 63 stabilizing places and 63 stable transitions
Knowledge obtained : [(AND (NOT p3) p2 (NOT p1)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 69 ms. Reduced automaton from 6 states, 7 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[(NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 58 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-24 12:49:31] [INFO ] Invariant cache hit.
[2024-05-24 12:49:31] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 12:49:31] [INFO ] [Nat]Absence check using 0 positive and 21 generalized place invariants in 7 ms returned sat
[2024-05-24 12:49:31] [INFO ] After 87ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 12:49:31] [INFO ] After 107ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2024-05-24 12:49:31] [INFO ] After 182ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 344 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 344/344 places, 346/346 transitions.
Graph (trivial) has 280 edges and 344 vertex of which 6 / 344 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 528 edges and 339 vertex of which 315 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.1 ms
Discarding 24 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 159 transitions
Trivial Post-agglo rules discarded 159 transitions
Performed 159 trivial Post agglomeration. Transition count delta: 159
Iterating post reduction 0 with 161 rules applied. Total rules applied 163 place count 315 transition count 175
Reduce places removed 159 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 161 rules applied. Total rules applied 324 place count 156 transition count 173
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 326 place count 154 transition count 173
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 326 place count 154 transition count 131
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 410 place count 112 transition count 131
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 431 place count 91 transition count 110
Iterating global reduction 3 with 21 rules applied. Total rules applied 452 place count 91 transition count 110
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 452 place count 91 transition count 109
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 454 place count 90 transition count 109
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 578 place count 28 transition count 47
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 76 edges and 28 vertex of which 27 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 2 rules applied. Total rules applied 580 place count 27 transition count 46
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 581 place count 27 transition count 45
Discarding 17 places :
Symmetric choice reduction at 5 with 17 rule applications. Total rules 598 place count 10 transition count 11
Iterating global reduction 5 with 17 rules applied. Total rules applied 615 place count 10 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 618 place count 8 transition count 10
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 11 edges and 8 vertex of which 7 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 2 rules applied. Total rules applied 620 place count 7 transition count 9
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 621 place count 7 transition count 8
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 622 place count 6 transition count 7
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 3 rules applied. Total rules applied 625 place count 5 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 626 place count 4 transition count 5
Applied a total of 626 rules in 21 ms. Remains 4 /344 variables (removed 340) and now considering 5/346 (removed 341) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 4/344 places, 5/346 transitions.
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p3) p2 (NOT p1)), true]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p3)))), (F p3), (F (NOT (AND p2 (NOT p3)))), (F (AND (NOT p2) (NOT p3)))]
Knowledge based reduction with 2 factoid took 150 ms. Reduced automaton from 6 states, 7 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 237 ms :[(NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 218 ms :[(NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 218 ms :[(NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 658 reset in 138 ms.
Product exploration explored 100000 steps with 660 reset in 154 ms.
Applying partial POR strategy [true, true, false, false, false, false]
Stuttering acceptance computed with spot in 220 ms :[(NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1))]
Support contains 2 out of 344 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 344/344 places, 346/346 transitions.
Graph (trivial) has 280 edges and 344 vertex of which 6 / 344 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 529 edges and 339 vertex of which 315 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.3 ms
Discarding 24 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Performed 160 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 160 rules applied. Total rules applied 162 place count 315 transition count 337
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 22 Pre rules applied. Total rules applied 162 place count 315 transition count 339
Deduced a syphon composed of 182 places in 0 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 184 place count 315 transition count 339
Discarding 116 places :
Symmetric choice reduction at 1 with 116 rule applications. Total rules 300 place count 199 transition count 223
Deduced a syphon composed of 85 places in 0 ms
Iterating global reduction 1 with 116 rules applied. Total rules applied 416 place count 199 transition count 223
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 435 place count 180 transition count 204
Deduced a syphon composed of 66 places in 0 ms
Iterating global reduction 1 with 19 rules applied. Total rules applied 454 place count 180 transition count 204
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 131 places in 0 ms
Iterating global reduction 1 with 65 rules applied. Total rules applied 519 place count 180 transition count 205
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 521 place count 180 transition count 203
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 567 place count 134 transition count 156
Deduced a syphon composed of 85 places in 0 ms
Iterating global reduction 2 with 46 rules applied. Total rules applied 613 place count 134 transition count 156
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 86 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 614 place count 134 transition count 156
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 615 place count 133 transition count 155
Deduced a syphon composed of 85 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 616 place count 133 transition count 155
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -58
Deduced a syphon composed of 105 places in 0 ms
Iterating global reduction 2 with 20 rules applied. Total rules applied 636 place count 133 transition count 213
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 673 place count 96 transition count 139
Deduced a syphon composed of 85 places in 0 ms
Iterating global reduction 2 with 37 rules applied. Total rules applied 710 place count 96 transition count 139
Discarding 51 places :
Symmetric choice reduction at 2 with 51 rule applications. Total rules 761 place count 45 transition count 54
Deduced a syphon composed of 34 places in 0 ms
Iterating global reduction 2 with 51 rules applied. Total rules applied 812 place count 45 transition count 54
Deduced a syphon composed of 34 places in 0 ms
Applied a total of 812 rules in 71 ms. Remains 45 /344 variables (removed 299) and now considering 54/346 (removed 292) transitions.
[2024-05-24 12:49:33] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 54 rows 45 cols
[2024-05-24 12:49:33] [INFO ] Computed 0 invariants in 1 ms
[2024-05-24 12:49:33] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/344 places, 54/346 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 124 ms. Remains : 45/344 places, 54/346 transitions.
Built C files in :
/tmp/ltsmin2523398933778611366
[2024-05-24 12:49:33] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2523398933778611366
Running compilation step : cd /tmp/ltsmin2523398933778611366;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 481 ms.
Running link step : cd /tmp/ltsmin2523398933778611366;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin2523398933778611366;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16137647687943583869.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 344 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 344/344 places, 346/346 transitions.
Applied a total of 0 rules in 8 ms. Remains 344 /344 variables (removed 0) and now considering 346/346 (removed 0) transitions.
// Phase 1: matrix 346 rows 344 cols
[2024-05-24 12:49:48] [INFO ] Computed 21 invariants in 3 ms
[2024-05-24 12:49:48] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-24 12:49:48] [INFO ] Invariant cache hit.
[2024-05-24 12:49:48] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
[2024-05-24 12:49:48] [INFO ] Invariant cache hit.
[2024-05-24 12:49:48] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 461 ms. Remains : 344/344 places, 346/346 transitions.
Built C files in :
/tmp/ltsmin11121739705734709968
[2024-05-24 12:49:49] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11121739705734709968
Running compilation step : cd /tmp/ltsmin11121739705734709968;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 449 ms.
Running link step : cd /tmp/ltsmin11121739705734709968;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin11121739705734709968;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5006905120597329623.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 12:50:04] [INFO ] Flatten gal took : 11 ms
[2024-05-24 12:50:04] [INFO ] Flatten gal took : 10 ms
[2024-05-24 12:50:04] [INFO ] Time to serialize gal into /tmp/LTL5059975709836416174.gal : 3 ms
[2024-05-24 12:50:04] [INFO ] Time to serialize properties into /tmp/LTL9506274714944480098.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5059975709836416174.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18283866003808339548.hoa' '-atoms' '/tmp/LTL9506274714944480098.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL9506274714944480098.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18283866003808339548.hoa
Detected timeout of ITS tools.
[2024-05-24 12:50:19] [INFO ] Flatten gal took : 21 ms
[2024-05-24 12:50:19] [INFO ] Flatten gal took : 19 ms
[2024-05-24 12:50:19] [INFO ] Time to serialize gal into /tmp/LTL16544149709975083563.gal : 20 ms
[2024-05-24 12:50:19] [INFO ] Time to serialize properties into /tmp/LTL10388697429831026942.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16544149709975083563.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10388697429831026942.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(((X(X("(p67==1)")))||(G("(p67==0)")))||((F("(p88==1)"))||("(((p230==1)&&(p397==1))&&(p412==1))")))))
Formula 0 simplified : X(!"(((p230==1)&&(p397==1))&&(p412==1))" & XX!"(p67==1)" & F!"(p67==0)" & G!"(p88==1)")
Detected timeout of ITS tools.
[2024-05-24 12:50:34] [INFO ] Flatten gal took : 22 ms
[2024-05-24 12:50:34] [INFO ] Applying decomposition
[2024-05-24 12:50:34] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph9104599371453268175.txt' '-o' '/tmp/graph9104599371453268175.bin' '-w' '/tmp/graph9104599371453268175.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9104599371453268175.bin' '-l' '-1' '-v' '-w' '/tmp/graph9104599371453268175.weights' '-q' '0' '-e' '0.001'
[2024-05-24 12:50:34] [INFO ] Decomposing Gal with order
[2024-05-24 12:50:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 12:50:34] [INFO ] Removed a total of 101 redundant transitions.
[2024-05-24 12:50:34] [INFO ] Flatten gal took : 22 ms
[2024-05-24 12:50:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-24 12:50:34] [INFO ] Time to serialize gal into /tmp/LTL5413839700098370681.gal : 20 ms
[2024-05-24 12:50:34] [INFO ] Time to serialize properties into /tmp/LTL7017599015709186185.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5413839700098370681.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7017599015709186185.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(((X(X("(i2.i0.u22.p67==1)")))||(G("(i2.i0.u22.p67==0)")))||((F("(i3.i1.u30.p88==1)"))||("(((i12.i0.u80.p230==1)&&(i21.u141.p397==...185
Formula 0 simplified : X(!"(((i12.i0.u80.p230==1)&&(i21.u141.p397==1))&&(i21.u142.p412==1))" & XX!"(i2.i0.u22.p67==1)" & F!"(i2.i0.u22.p67==0)" & G!"(i3.i1...169
Reverse transition relation is NOT exact ! Due to transitions t320, i0.t315, i0.i1.u7.t308, i1.t302, i1.i2.t294, i2.t287, i2.i2.t278, i3.t271, i3.i1.u32.t2...739
Computing Next relation with stutter on 6.97252e+09 deadlock states
168 unique states visited
168 strongly connected components in search stack
169 transitions explored
168 items max in DFS search stack
296 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,3.00772,106964,1,0,210815,381,3871,297094,168,1255,293978
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-20b-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property GPUForwardProgress-PT-20b-LTLFireability-08 finished in 69745 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0 U G(p1)))||F(p2)))'
Support contains 5 out of 355 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 355/355 places, 362/362 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 348 transition count 355
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 348 transition count 355
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 348 transition count 353
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 19 place count 345 transition count 350
Iterating global reduction 1 with 3 rules applied. Total rules applied 22 place count 345 transition count 350
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 25 place count 345 transition count 347
Applied a total of 25 rules in 19 ms. Remains 345 /355 variables (removed 10) and now considering 347/362 (removed 15) transitions.
// Phase 1: matrix 347 rows 345 cols
[2024-05-24 12:50:38] [INFO ] Computed 21 invariants in 5 ms
[2024-05-24 12:50:38] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-24 12:50:38] [INFO ] Invariant cache hit.
[2024-05-24 12:50:38] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
[2024-05-24 12:50:38] [INFO ] Invariant cache hit.
[2024-05-24 12:50:38] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 345/355 places, 347/362 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 446 ms. Remains : 345/355 places, 347/362 transitions.
Stuttering acceptance computed with spot in 210 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-20b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s151 1) (EQ s332 1) (EQ s343 1)), p1:(NEQ s240 1), p0:(EQ s50 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 17389 steps with 99 reset in 40 ms.
FORMULA GPUForwardProgress-PT-20b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-20b-LTLFireability-09 finished in 712 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))&&F((G(F(p1))||(p2&&F(p1))))))'
Support contains 3 out of 355 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 355/355 places, 362/362 transitions.
Graph (trivial) has 295 edges and 355 vertex of which 6 / 355 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 545 edges and 350 vertex of which 326 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.1 ms
Discarding 24 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 168 transitions
Trivial Post-agglo rules discarded 168 transitions
Performed 168 trivial Post agglomeration. Transition count delta: 168
Iterating post reduction 0 with 168 rules applied. Total rules applied 170 place count 325 transition count 184
Reduce places removed 168 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 176 rules applied. Total rules applied 346 place count 157 transition count 176
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 350 place count 154 transition count 175
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 351 place count 153 transition count 175
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 41 Pre rules applied. Total rules applied 351 place count 153 transition count 134
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 433 place count 112 transition count 134
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 453 place count 92 transition count 114
Iterating global reduction 4 with 20 rules applied. Total rules applied 473 place count 92 transition count 114
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 4 with 118 rules applied. Total rules applied 591 place count 33 transition count 55
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 608 place count 16 transition count 21
Iterating global reduction 4 with 17 rules applied. Total rules applied 625 place count 16 transition count 21
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 629 place count 14 transition count 20
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 630 place count 13 transition count 19
Applied a total of 630 rules in 19 ms. Remains 13 /355 variables (removed 342) and now considering 19/362 (removed 343) transitions.
[2024-05-24 12:50:38] [INFO ] Flow matrix only has 18 transitions (discarded 1 similar events)
// Phase 1: matrix 18 rows 13 cols
[2024-05-24 12:50:38] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 12:50:39] [INFO ] Implicit Places using invariants in 317 ms returned []
[2024-05-24 12:50:39] [INFO ] Flow matrix only has 18 transitions (discarded 1 similar events)
[2024-05-24 12:50:39] [INFO ] Invariant cache hit.
[2024-05-24 12:50:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 12:50:39] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
[2024-05-24 12:50:39] [INFO ] Redundant transitions in 14 ms returned []
[2024-05-24 12:50:39] [INFO ] Flow matrix only has 18 transitions (discarded 1 similar events)
[2024-05-24 12:50:39] [INFO ] Invariant cache hit.
[2024-05-24 12:50:39] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/355 places, 19/362 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 450 ms. Remains : 13/355 places, 19/362 transitions.
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-20b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(EQ s9 1), p1:(NEQ s1 1), p0:(EQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-20b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-20b-LTLFireability-10 finished in 660 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&(p0||G((p1||X(G(p0))))))))'
Support contains 2 out of 355 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 355/355 places, 362/362 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 347 transition count 354
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 347 transition count 354
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 347 transition count 352
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 344 transition count 349
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 344 transition count 349
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 27 place count 344 transition count 346
Applied a total of 27 rules in 13 ms. Remains 344 /355 variables (removed 11) and now considering 346/362 (removed 16) transitions.
// Phase 1: matrix 346 rows 344 cols
[2024-05-24 12:50:39] [INFO ] Computed 21 invariants in 4 ms
[2024-05-24 12:50:39] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-24 12:50:39] [INFO ] Invariant cache hit.
[2024-05-24 12:50:39] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
[2024-05-24 12:50:39] [INFO ] Invariant cache hit.
[2024-05-24 12:50:39] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 344/355 places, 346/362 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 458 ms. Remains : 344/355 places, 346/362 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (NOT p0), false, true]
Running random walk in product with property : GPUForwardProgress-PT-20b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(OR p0 p1), acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s44 1), p1:(EQ s167 0)], 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]]
Stuttering criterion allowed to conclude after 171 steps with 1 reset in 2 ms.
FORMULA GPUForwardProgress-PT-20b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-20b-LTLFireability-11 finished in 634 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 355 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 355/355 places, 362/362 transitions.
Graph (trivial) has 297 edges and 355 vertex of which 6 / 355 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 545 edges and 350 vertex of which 326 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.2 ms
Discarding 24 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 171 transitions
Trivial Post-agglo rules discarded 171 transitions
Performed 171 trivial Post agglomeration. Transition count delta: 171
Iterating post reduction 0 with 171 rules applied. Total rules applied 173 place count 325 transition count 181
Reduce places removed 171 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 180 rules applied. Total rules applied 353 place count 154 transition count 172
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 356 place count 151 transition count 172
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 43 Pre rules applied. Total rules applied 356 place count 151 transition count 129
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 442 place count 108 transition count 129
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 462 place count 88 transition count 109
Iterating global reduction 3 with 20 rules applied. Total rules applied 482 place count 88 transition count 109
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 602 place count 28 transition count 49
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 620 place count 10 transition count 13
Iterating global reduction 3 with 18 rules applied. Total rules applied 638 place count 10 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 640 place count 9 transition count 12
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 641 place count 9 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 642 place count 8 transition count 11
Applied a total of 642 rules in 22 ms. Remains 8 /355 variables (removed 347) and now considering 11/362 (removed 351) transitions.
// Phase 1: matrix 11 rows 8 cols
[2024-05-24 12:50:40] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 12:50:40] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-24 12:50:40] [INFO ] Invariant cache hit.
[2024-05-24 12:50:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 12:50:40] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2024-05-24 12:50:40] [INFO ] Redundant transitions in 13 ms returned []
[2024-05-24 12:50:40] [INFO ] Invariant cache hit.
[2024-05-24 12:50:40] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/355 places, 11/362 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 117 ms. Remains : 8/355 places, 11/362 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-20b-LTLFireability-12 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:(EQ s2 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 0 ms.
FORMULA GPUForwardProgress-PT-20b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-20b-LTLFireability-12 finished in 203 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G(p1))))'
Support contains 2 out of 355 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 355/355 places, 362/362 transitions.
Graph (trivial) has 296 edges and 355 vertex of which 6 / 355 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 545 edges and 350 vertex of which 326 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.2 ms
Discarding 24 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 170 transitions
Trivial Post-agglo rules discarded 170 transitions
Performed 170 trivial Post agglomeration. Transition count delta: 170
Iterating post reduction 0 with 170 rules applied. Total rules applied 172 place count 325 transition count 182
Reduce places removed 170 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 177 rules applied. Total rules applied 349 place count 155 transition count 175
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 352 place count 153 transition count 174
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 353 place count 152 transition count 174
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 44 Pre rules applied. Total rules applied 353 place count 152 transition count 130
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 4 with 88 rules applied. Total rules applied 441 place count 108 transition count 130
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 460 place count 89 transition count 111
Iterating global reduction 4 with 19 rules applied. Total rules applied 479 place count 89 transition count 111
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 4 with 118 rules applied. Total rules applied 597 place count 30 transition count 52
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 616 place count 11 transition count 14
Iterating global reduction 4 with 19 rules applied. Total rules applied 635 place count 11 transition count 14
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 637 place count 9 transition count 12
Applied a total of 637 rules in 21 ms. Remains 9 /355 variables (removed 346) and now considering 12/362 (removed 350) transitions.
// Phase 1: matrix 12 rows 9 cols
[2024-05-24 12:50:40] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 12:50:40] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-24 12:50:40] [INFO ] Invariant cache hit.
[2024-05-24 12:50:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 12:50:40] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2024-05-24 12:50:40] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-24 12:50:40] [INFO ] Invariant cache hit.
[2024-05-24 12:50:40] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/355 places, 12/362 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 109 ms. Remains : 9/355 places, 12/362 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPUForwardProgress-PT-20b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s3 1), p0:(EQ s7 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 70 steps with 10 reset in 2 ms.
FORMULA GPUForwardProgress-PT-20b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-20b-LTLFireability-13 finished in 201 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)))))'
Support contains 2 out of 355 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 355/355 places, 362/362 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 347 transition count 354
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 347 transition count 354
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 347 transition count 352
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 344 transition count 349
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 344 transition count 349
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 27 place count 344 transition count 346
Applied a total of 27 rules in 17 ms. Remains 344 /355 variables (removed 11) and now considering 346/362 (removed 16) transitions.
// Phase 1: matrix 346 rows 344 cols
[2024-05-24 12:50:40] [INFO ] Computed 21 invariants in 3 ms
[2024-05-24 12:50:40] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-24 12:50:40] [INFO ] Invariant cache hit.
[2024-05-24 12:50:40] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
[2024-05-24 12:50:40] [INFO ] Invariant cache hit.
[2024-05-24 12:50:40] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 344/355 places, 346/362 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 426 ms. Remains : 344/355 places, 346/362 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPUForwardProgress-PT-20b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(EQ s222 1), p0:(EQ s214 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 1445 reset in 159 ms.
Product exploration explored 100000 steps with 1453 reset in 149 ms.
Computed a total of 63 stabilizing places and 63 stable transitions
Graph (complete) has 535 edges and 344 vertex of which 320 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.1 ms
Computed a total of 63 stabilizing places and 63 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 83 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Incomplete random walk after 10000 steps, including 55 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-24 12:50:41] [INFO ] Invariant cache hit.
[2024-05-24 12:50:41] [INFO ] [Real]Absence check using 0 positive and 21 generalized place invariants in 8 ms returned sat
[2024-05-24 12:50:41] [INFO ] After 106ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-05-24 12:50:41] [INFO ] After 129ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2024-05-24 12:50:41] [INFO ] After 221ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:1
[2024-05-24 12:50:41] [INFO ] [Nat]Absence check using 0 positive and 21 generalized place invariants in 8 ms returned sat
[2024-05-24 12:50:42] [INFO ] After 109ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 12:50:42] [INFO ] After 152ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 24 ms.
[2024-05-24 12:50:42] [INFO ] After 254ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 344 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 344/344 places, 346/346 transitions.
Graph (trivial) has 279 edges and 344 vertex of which 6 / 344 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 528 edges and 339 vertex of which 315 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.1 ms
Discarding 24 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 0 with 162 rules applied. Total rules applied 164 place count 315 transition count 174
Reduce places removed 160 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 161 rules applied. Total rules applied 325 place count 155 transition count 173
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 326 place count 154 transition count 173
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 326 place count 154 transition count 131
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 410 place count 112 transition count 131
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 431 place count 91 transition count 110
Iterating global reduction 3 with 21 rules applied. Total rules applied 452 place count 91 transition count 110
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 452 place count 91 transition count 109
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 454 place count 90 transition count 109
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 122 rules applied. Total rules applied 576 place count 29 transition count 48
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 77 edges and 29 vertex of which 28 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 2 rules applied. Total rules applied 578 place count 28 transition count 47
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 579 place count 28 transition count 46
Discarding 17 places :
Symmetric choice reduction at 5 with 17 rule applications. Total rules 596 place count 11 transition count 12
Iterating global reduction 5 with 17 rules applied. Total rules applied 613 place count 11 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 616 place count 9 transition count 11
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 12 edges and 9 vertex of which 8 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 2 rules applied. Total rules applied 618 place count 8 transition count 10
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 619 place count 8 transition count 9
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 620 place count 8 transition count 9
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 621 place count 8 transition count 8
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 622 place count 7 transition count 7
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 3 rules applied. Total rules applied 625 place count 6 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 626 place count 5 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 626 place count 5 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 628 place count 4 transition count 4
Applied a total of 628 rules in 17 ms. Remains 4 /344 variables (removed 340) and now considering 4/346 (removed 342) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 4/344 places, 4/346 transitions.
Finished random walk after 3335 steps, including 1 resets, run visited all 2 properties in 4 ms. (steps per millisecond=833 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(F (AND p0 p1)), (F (AND (NOT p0) p1)), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 181 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
[2024-05-24 12:50:42] [INFO ] Invariant cache hit.
[2024-05-24 12:50:42] [INFO ] [Real]Absence check using 0 positive and 21 generalized place invariants in 6 ms returned sat
[2024-05-24 12:50:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:50:42] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2024-05-24 12:50:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 12:50:42] [INFO ] [Nat]Absence check using 0 positive and 21 generalized place invariants in 6 ms returned sat
[2024-05-24 12:50:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 12:50:43] [INFO ] [Nat]Absence check using state equation in 122 ms returned sat
[2024-05-24 12:50:43] [INFO ] Computed and/alt/rep : 340/446/340 causal constraints (skipped 5 transitions) in 25 ms.
[2024-05-24 12:50:44] [INFO ] Added : 316 causal constraints over 64 iterations in 1552 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 2 out of 344 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 344/344 places, 346/346 transitions.
Graph (trivial) has 279 edges and 344 vertex of which 6 / 344 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 529 edges and 339 vertex of which 315 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.14 ms
Discarding 24 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 159 transitions
Trivial Post-agglo rules discarded 159 transitions
Performed 159 trivial Post agglomeration. Transition count delta: 159
Iterating post reduction 0 with 159 rules applied. Total rules applied 161 place count 314 transition count 177
Reduce places removed 159 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 160 rules applied. Total rules applied 321 place count 155 transition count 176
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 322 place count 154 transition count 176
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 43 Pre rules applied. Total rules applied 322 place count 154 transition count 133
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 408 place count 111 transition count 133
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 427 place count 92 transition count 114
Iterating global reduction 3 with 19 rules applied. Total rules applied 446 place count 92 transition count 114
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 122 rules applied. Total rules applied 568 place count 31 transition count 53
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 569 place count 31 transition count 52
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 587 place count 13 transition count 17
Iterating global reduction 4 with 18 rules applied. Total rules applied 605 place count 13 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 607 place count 12 transition count 16
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 608 place count 12 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 609 place count 11 transition count 15
Applied a total of 609 rules in 27 ms. Remains 11 /344 variables (removed 333) and now considering 15/346 (removed 331) transitions.
[2024-05-24 12:50:44] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
// Phase 1: matrix 14 rows 11 cols
[2024-05-24 12:50:44] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 12:50:44] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-24 12:50:44] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
[2024-05-24 12:50:44] [INFO ] Invariant cache hit.
[2024-05-24 12:50:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 12:50:44] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-05-24 12:50:44] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-24 12:50:44] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
[2024-05-24 12:50:44] [INFO ] Invariant cache hit.
[2024-05-24 12:50:44] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/344 places, 15/346 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 117 ms. Remains : 11/344 places, 15/346 transitions.
Computed a total of 5 stabilizing places and 7 stable transitions
Computed a total of 5 stabilizing places and 7 stable transitions
Detected a total of 5/11 stabilizing places and 7/15 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 5 factoid took 318 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, false]
Finished random walk after 74 steps, including 6 resets, run visited all 4 properties in 2 ms. (steps per millisecond=37 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND p1 p0)), (F (AND p1 (NOT p0))), (F (AND (NOT p1) p0)), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 5 factoid took 436 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, false]
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, false]
[2024-05-24 12:50:46] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
[2024-05-24 12:50:46] [INFO ] Invariant cache hit.
[2024-05-24 12:50:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:50:46] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-24 12:50:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 12:50:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 12:50:46] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-24 12:50:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 12:50:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 12:50:46] [INFO ] Computed and/alt/rep : 9/21/9 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-24 12:50:46] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, false]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-20b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-20b-LTLFireability-14 finished in 5820 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&(p1||G(p2))))))'
Support contains 3 out of 355 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 355/355 places, 362/362 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 349 transition count 356
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 349 transition count 356
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 346 transition count 353
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 346 transition count 353
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 21 place count 346 transition count 350
Applied a total of 21 rules in 19 ms. Remains 346 /355 variables (removed 9) and now considering 350/362 (removed 12) transitions.
// Phase 1: matrix 350 rows 346 cols
[2024-05-24 12:50:46] [INFO ] Computed 21 invariants in 6 ms
[2024-05-24 12:50:46] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-24 12:50:46] [INFO ] Invariant cache hit.
[2024-05-24 12:50:46] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
[2024-05-24 12:50:46] [INFO ] Invariant cache hit.
[2024-05-24 12:50:46] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 346/355 places, 350/362 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 447 ms. Remains : 346/355 places, 350/362 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : GPUForwardProgress-PT-20b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0} source=2 dest: 1}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s53 0), p1:(EQ s60 1), p2:(EQ s255 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 169 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-20b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-20b-LTLFireability-15 finished in 592 ms.
All properties solved by simple procedures.
Total runtime 156377 ms.

BK_STOP 1716555047948

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-20b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is GPUForwardProgress-PT-20b, 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 r197-tall-171640625400338"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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