fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r201-smll-167840347300092
Last Updated
May 14, 2023

About the Execution of LTSMin+red for GPUForwardProgress-PT-24b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
463.896 31111.00 54202.00 702.10 FFTFFFFFFFTFFFFF normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 6.7K Feb 25 14:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 25 14:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 14:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 14:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Feb 25 14:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 25 14:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 14:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 14:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 122K Mar 5 18:22 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-24b-LTLFireability-00
FORMULA_NAME GPUForwardProgress-PT-24b-LTLFireability-01
FORMULA_NAME GPUForwardProgress-PT-24b-LTLFireability-02
FORMULA_NAME GPUForwardProgress-PT-24b-LTLFireability-03
FORMULA_NAME GPUForwardProgress-PT-24b-LTLFireability-04
FORMULA_NAME GPUForwardProgress-PT-24b-LTLFireability-05
FORMULA_NAME GPUForwardProgress-PT-24b-LTLFireability-06
FORMULA_NAME GPUForwardProgress-PT-24b-LTLFireability-07
FORMULA_NAME GPUForwardProgress-PT-24b-LTLFireability-08
FORMULA_NAME GPUForwardProgress-PT-24b-LTLFireability-09
FORMULA_NAME GPUForwardProgress-PT-24b-LTLFireability-10
FORMULA_NAME GPUForwardProgress-PT-24b-LTLFireability-11
FORMULA_NAME GPUForwardProgress-PT-24b-LTLFireability-12
FORMULA_NAME GPUForwardProgress-PT-24b-LTLFireability-13
FORMULA_NAME GPUForwardProgress-PT-24b-LTLFireability-14
FORMULA_NAME GPUForwardProgress-PT-24b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678538465113

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-24b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-11 12:41:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 12:41:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 12:41:08] [INFO ] Load time of PNML (sax parser for PT used): 115 ms
[2023-03-11 12:41:08] [INFO ] Transformed 492 places.
[2023-03-11 12:41:08] [INFO ] Transformed 517 transitions.
[2023-03-11 12:41:08] [INFO ] Found NUPN structural information;
[2023-03-11 12:41:08] [INFO ] Parsed PT model containing 492 places and 517 transitions and 1277 arcs in 250 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA GPUForwardProgress-PT-24b-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-24b-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-24b-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 492 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 492/492 places, 517/517 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 491 transition count 517
Discarding 49 places :
Symmetric choice reduction at 1 with 49 rule applications. Total rules 50 place count 442 transition count 468
Iterating global reduction 1 with 49 rules applied. Total rules applied 99 place count 442 transition count 468
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 122 place count 419 transition count 445
Iterating global reduction 1 with 23 rules applied. Total rules applied 145 place count 419 transition count 445
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 165 place count 419 transition count 425
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 166 place count 418 transition count 424
Iterating global reduction 2 with 1 rules applied. Total rules applied 167 place count 418 transition count 424
Applied a total of 167 rules in 156 ms. Remains 418 /492 variables (removed 74) and now considering 424/517 (removed 93) transitions.
// Phase 1: matrix 424 rows 418 cols
[2023-03-11 12:41:08] [INFO ] Computed 25 place invariants in 32 ms
[2023-03-11 12:41:09] [INFO ] Implicit Places using invariants in 529 ms returned []
[2023-03-11 12:41:09] [INFO ] Invariant cache hit.
[2023-03-11 12:41:09] [INFO ] Implicit Places using invariants and state equation in 568 ms returned []
Implicit Place search using SMT with State Equation took 1142 ms to find 0 implicit places.
[2023-03-11 12:41:09] [INFO ] Invariant cache hit.
[2023-03-11 12:41:10] [INFO ] Dead Transitions using invariants and state equation in 353 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 418/492 places, 424/517 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1654 ms. Remains : 418/492 places, 424/517 transitions.
Support contains 32 out of 418 places after structural reductions.
[2023-03-11 12:41:10] [INFO ] Flatten gal took : 97 ms
[2023-03-11 12:41:10] [INFO ] Flatten gal took : 35 ms
[2023-03-11 12:41:10] [INFO ] Input system was already deterministic with 424 transitions.
Support contains 31 out of 418 places (down from 32) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 48 resets, run finished after 734 ms. (steps per millisecond=13 ) properties (out of 28) seen :9
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
[2023-03-11 12:41:11] [INFO ] Invariant cache hit.
[2023-03-11 12:41:11] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 19 ms returned sat
[2023-03-11 12:41:12] [INFO ] After 398ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2023-03-11 12:41:12] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 19 ms returned sat
[2023-03-11 12:41:13] [INFO ] After 622ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2023-03-11 12:41:13] [INFO ] After 1319ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :19
Attempting to minimize the solution found.
Minimization took 406 ms.
[2023-03-11 12:41:14] [INFO ] After 2217ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :19
Fused 19 Parikh solutions to 18 different solutions.
Finished Parikh walk after 114 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=114 )
Parikh walk visited 19 properties in 216 ms.
FORMULA GPUForwardProgress-PT-24b-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 79 stabilizing places and 79 stable transitions
Graph (complete) has 649 edges and 418 vertex of which 390 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.15 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p0) U p1)&&X(X(p2)))))'
Support contains 3 out of 418 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 418/418 places, 424/424 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 410 transition count 416
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 410 transition count 416
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 410 transition count 414
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 408 transition count 412
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 408 transition count 412
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 408 transition count 410
Applied a total of 24 rules in 53 ms. Remains 408 /418 variables (removed 10) and now considering 410/424 (removed 14) transitions.
// Phase 1: matrix 410 rows 408 cols
[2023-03-11 12:41:14] [INFO ] Computed 25 place invariants in 4 ms
[2023-03-11 12:41:15] [INFO ] Implicit Places using invariants in 204 ms returned []
[2023-03-11 12:41:15] [INFO ] Invariant cache hit.
[2023-03-11 12:41:15] [INFO ] Implicit Places using invariants and state equation in 418 ms returned []
Implicit Place search using SMT with State Equation took 625 ms to find 0 implicit places.
[2023-03-11 12:41:15] [INFO ] Invariant cache hit.
[2023-03-11 12:41:15] [INFO ] Dead Transitions using invariants and state equation in 304 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 408/418 places, 410/424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 986 ms. Remains : 408/418 places, 410/424 transitions.
Stuttering acceptance computed with spot in 468 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p0), (NOT p1), (NOT p2), (NOT p2)]
Running random walk in product with property : GPUForwardProgress-PT-24b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 4}, { cond=(OR p1 p0), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=(NOT p2), acceptance={} source=6 dest: 2}]], initial=0, aps=[p1:(EQ s271 1), p0:(EQ s175 1), p2:(EQ s198 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, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA GPUForwardProgress-PT-24b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-24b-LTLFireability-00 finished in 1539 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(p1||G(p2))))))'
Support contains 2 out of 418 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 418/418 places, 424/424 transitions.
Graph (trivial) has 345 edges and 418 vertex of which 6 / 418 are part of one of the 1 SCC in 8 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 643 edges and 413 vertex of which 385 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.8 ms
Discarding 28 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 0 with 198 rules applied. Total rules applied 200 place count 384 transition count 216
Reduce places removed 198 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 204 rules applied. Total rules applied 404 place count 186 transition count 210
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 407 place count 184 transition count 209
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 408 place count 183 transition count 209
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 52 Pre rules applied. Total rules applied 408 place count 183 transition count 157
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 4 with 104 rules applied. Total rules applied 512 place count 131 transition count 157
Discarding 23 places :
Symmetric choice reduction at 4 with 23 rule applications. Total rules 535 place count 108 transition count 134
Iterating global reduction 4 with 23 rules applied. Total rules applied 558 place count 108 transition count 134
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 4 with 146 rules applied. Total rules applied 704 place count 35 transition count 61
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 705 place count 35 transition count 60
Discarding 23 places :
Symmetric choice reduction at 5 with 23 rule applications. Total rules 728 place count 12 transition count 15
Iterating global reduction 5 with 23 rules applied. Total rules applied 751 place count 12 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 753 place count 11 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 754 place count 10 transition count 13
Applied a total of 754 rules in 77 ms. Remains 10 /418 variables (removed 408) and now considering 13/424 (removed 411) transitions.
// Phase 1: matrix 13 rows 10 cols
[2023-03-11 12:41:16] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 12:41:16] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-11 12:41:16] [INFO ] Invariant cache hit.
[2023-03-11 12:41:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 12:41:16] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-03-11 12:41:16] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-11 12:41:16] [INFO ] Invariant cache hit.
[2023-03-11 12:41:16] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/418 places, 13/424 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 181 ms. Remains : 10/418 places, 13/424 transitions.
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : GPUForwardProgress-PT-24b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p1)) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND p2 p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s3 0), p0:(OR (EQ s3 0) (EQ s5 0)), p2:(EQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 133 steps with 14 reset in 3 ms.
FORMULA GPUForwardProgress-PT-24b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-24b-LTLFireability-01 finished in 308 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p1)||p0))))'
Support contains 6 out of 418 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 418/418 places, 424/424 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 413 transition count 419
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 413 transition count 419
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 413 transition count 418
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 412 transition count 417
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 412 transition count 417
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 412 transition count 416
Applied a total of 14 rules in 56 ms. Remains 412 /418 variables (removed 6) and now considering 416/424 (removed 8) transitions.
// Phase 1: matrix 416 rows 412 cols
[2023-03-11 12:41:16] [INFO ] Computed 25 place invariants in 3 ms
[2023-03-11 12:41:16] [INFO ] Implicit Places using invariants in 203 ms returned []
[2023-03-11 12:41:16] [INFO ] Invariant cache hit.
[2023-03-11 12:41:17] [INFO ] Implicit Places using invariants and state equation in 397 ms returned []
Implicit Place search using SMT with State Equation took 603 ms to find 0 implicit places.
[2023-03-11 12:41:17] [INFO ] Invariant cache hit.
[2023-03-11 12:41:17] [INFO ] Dead Transitions using invariants and state equation in 340 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 412/418 places, 416/424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1004 ms. Remains : 412/418 places, 416/424 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPUForwardProgress-PT-24b-LTLFireability-02 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 s193 0), p0:(OR (EQ s268 0) (EQ s298 0) (AND (EQ s120 1) (EQ s399 1) (EQ s410 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 50000 reset in 604 ms.
Product exploration explored 100000 steps with 50000 reset in 532 ms.
Computed a total of 76 stabilizing places and 76 stable transitions
Graph (complete) has 641 edges and 412 vertex of which 384 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.6 ms
Computed a total of 76 stabilizing places and 76 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 p0)
Knowledge based reduction with 5 factoid took 281 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPUForwardProgress-PT-24b-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-24b-LTLFireability-02 finished in 2553 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 418 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 418/418 places, 424/424 transitions.
Graph (trivial) has 346 edges and 418 vertex of which 6 / 418 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 643 edges and 413 vertex of which 385 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.2 ms
Discarding 28 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 202 place count 384 transition count 214
Reduce places removed 200 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 206 rules applied. Total rules applied 408 place count 184 transition count 208
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 411 place count 182 transition count 207
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 412 place count 181 transition count 207
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 52 Pre rules applied. Total rules applied 412 place count 181 transition count 155
Deduced a syphon composed of 52 places in 1 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 4 with 104 rules applied. Total rules applied 516 place count 129 transition count 155
Discarding 23 places :
Symmetric choice reduction at 4 with 23 rule applications. Total rules 539 place count 106 transition count 132
Iterating global reduction 4 with 23 rules applied. Total rules applied 562 place count 106 transition count 132
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 4 with 142 rules applied. Total rules applied 704 place count 35 transition count 61
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 705 place count 35 transition count 60
Discarding 23 places :
Symmetric choice reduction at 5 with 23 rule applications. Total rules 728 place count 12 transition count 15
Iterating global reduction 5 with 23 rules applied. Total rules applied 751 place count 12 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 753 place count 11 transition count 14
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 754 place count 11 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 755 place count 10 transition count 13
Applied a total of 755 rules in 42 ms. Remains 10 /418 variables (removed 408) and now considering 13/424 (removed 411) transitions.
// Phase 1: matrix 13 rows 10 cols
[2023-03-11 12:41:19] [INFO ] Computed 0 place invariants in 4 ms
[2023-03-11 12:41:19] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-11 12:41:19] [INFO ] Invariant cache hit.
[2023-03-11 12:41:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 12:41:19] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2023-03-11 12:41:19] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-11 12:41:19] [INFO ] Invariant cache hit.
[2023-03-11 12:41:19] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/418 places, 13/424 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 146 ms. Remains : 10/418 places, 13/424 transitions.
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-24b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s6 1), p1:(EQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-24b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-24b-LTLFireability-03 finished in 310 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (p1 U (G(p2) U p3))))'
Support contains 4 out of 418 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 418/418 places, 424/424 transitions.
Graph (complete) has 649 edges and 418 vertex of which 390 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.2 ms
Discarding 28 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 0 with 198 rules applied. Total rules applied 199 place count 389 transition count 222
Reduce places removed 198 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 206 rules applied. Total rules applied 405 place count 191 transition count 214
Reduce places removed 3 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 7 rules applied. Total rules applied 412 place count 188 transition count 210
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 416 place count 184 transition count 210
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 52 Pre rules applied. Total rules applied 416 place count 184 transition count 158
Deduced a syphon composed of 52 places in 1 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 4 with 104 rules applied. Total rules applied 520 place count 132 transition count 158
Discarding 23 places :
Symmetric choice reduction at 4 with 23 rule applications. Total rules 543 place count 109 transition count 135
Iterating global reduction 4 with 23 rules applied. Total rules applied 566 place count 109 transition count 135
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 4 with 144 rules applied. Total rules applied 710 place count 37 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 711 place count 37 transition count 62
Discarding 21 places :
Symmetric choice reduction at 5 with 21 rule applications. Total rules 732 place count 16 transition count 21
Iterating global reduction 5 with 21 rules applied. Total rules applied 753 place count 16 transition count 21
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 755 place count 15 transition count 20
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 756 place count 15 transition count 20
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 757 place count 14 transition count 19
Applied a total of 757 rules in 38 ms. Remains 14 /418 variables (removed 404) and now considering 19/424 (removed 405) transitions.
[2023-03-11 12:41:19] [INFO ] Flow matrix only has 18 transitions (discarded 1 similar events)
// Phase 1: matrix 18 rows 14 cols
[2023-03-11 12:41:19] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 12:41:19] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-11 12:41:19] [INFO ] Flow matrix only has 18 transitions (discarded 1 similar events)
[2023-03-11 12:41:19] [INFO ] Invariant cache hit.
[2023-03-11 12:41:19] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-03-11 12:41:19] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-11 12:41:19] [INFO ] Flow matrix only has 18 transitions (discarded 1 similar events)
[2023-03-11 12:41:19] [INFO ] Invariant cache hit.
[2023-03-11 12:41:19] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/418 places, 19/424 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 146 ms. Remains : 14/418 places, 19/424 transitions.
Stuttering acceptance computed with spot in 210 ms :[(NOT p2), true, (OR (NOT p2) (NOT p3)), (NOT p3), (NOT p3)]
Running random walk in product with property : GPUForwardProgress-PT-24b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p3 p2), acceptance={0} source=2 dest: 0}, { cond=(NOT p2), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p3) p2 (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p3) p0), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p3) p1 (NOT p0)), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p3) p1), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p2:(NEQ s12 1), p3:(EQ s9 1), p1:(EQ s2 1), p0:(EQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-24b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-24b-LTLFireability-04 finished in 381 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0 U (p1||F(G(((p2||X(G(p1))) U p0))))))))'
Support contains 3 out of 418 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 418/418 places, 424/424 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 411 transition count 417
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 411 transition count 417
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 411 transition count 415
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 410 transition count 414
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 410 transition count 414
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 19 place count 410 transition count 413
Applied a total of 19 rules in 39 ms. Remains 410 /418 variables (removed 8) and now considering 413/424 (removed 11) transitions.
// Phase 1: matrix 413 rows 410 cols
[2023-03-11 12:41:19] [INFO ] Computed 25 place invariants in 3 ms
[2023-03-11 12:41:20] [INFO ] Implicit Places using invariants in 160 ms returned []
[2023-03-11 12:41:20] [INFO ] Invariant cache hit.
[2023-03-11 12:41:20] [INFO ] Implicit Places using invariants and state equation in 414 ms returned []
Implicit Place search using SMT with State Equation took 587 ms to find 0 implicit places.
[2023-03-11 12:41:20] [INFO ] Invariant cache hit.
[2023-03-11 12:41:20] [INFO ] Dead Transitions using invariants and state equation in 351 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 410/418 places, 413/424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 981 ms. Remains : 410/418 places, 413/424 transitions.
Stuttering acceptance computed with spot in 279 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-24b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=2 dest: 3}, { cond=(NOT p0), acceptance={0, 1} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={1} source=3 dest: 2}, { cond=(OR (AND p1 p0) (AND p1 p2)), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=3 dest: 4}, { cond=(AND p1 (NOT p0) p2), acceptance={0} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=4 dest: 3}, { cond=(NOT p0), acceptance={0, 1} source=4 dest: 4}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=5 dest: 4}, { cond=(AND p1 (NOT p0) p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s131 1), p0:(EQ s78 1), p2:(EQ s335 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 201 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-24b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-24b-LTLFireability-05 finished in 1294 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((p0&&F(!p0)) U (p0&&F(!p0)&&(p1||G(p2)))))))'
Support contains 3 out of 418 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 418/418 places, 424/424 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 411 transition count 417
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 411 transition count 417
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 411 transition count 415
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 409 transition count 413
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 409 transition count 413
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 409 transition count 411
Applied a total of 22 rules in 36 ms. Remains 409 /418 variables (removed 9) and now considering 411/424 (removed 13) transitions.
// Phase 1: matrix 411 rows 409 cols
[2023-03-11 12:41:21] [INFO ] Computed 25 place invariants in 3 ms
[2023-03-11 12:41:21] [INFO ] Implicit Places using invariants in 174 ms returned []
[2023-03-11 12:41:21] [INFO ] Invariant cache hit.
[2023-03-11 12:41:21] [INFO ] Implicit Places using invariants and state equation in 424 ms returned []
Implicit Place search using SMT with State Equation took 600 ms to find 0 implicit places.
[2023-03-11 12:41:21] [INFO ] Invariant cache hit.
[2023-03-11 12:41:22] [INFO ] Dead Transitions using invariants and state equation in 350 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 409/418 places, 411/424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 988 ms. Remains : 409/418 places, 411/424 transitions.
Stuttering acceptance computed with spot in 271 ms :[(NOT p2), true, true, true, true, (OR (NOT p2) p0), p0]
Running random walk in product with property : GPUForwardProgress-PT-24b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=4 dest: 5}, { cond=(AND p0 p1), acceptance={0} source=4 dest: 6}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=5 dest: 5}, { cond=(AND p0 p1), acceptance={0} source=5 dest: 6}], [{ cond=p0, acceptance={0} source=6 dest: 6}]], initial=3, aps=[p2:(NEQ s253 1), p0:(EQ s257 1), p1:(EQ s318 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-24b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-24b-LTLFireability-07 finished in 1285 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((X(G(p0))&&(p1||X(p1)))))))'
Support contains 4 out of 418 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 418/418 places, 424/424 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 411 transition count 417
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 411 transition count 417
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 411 transition count 416
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 409 transition count 414
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 409 transition count 414
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 21 place count 409 transition count 412
Applied a total of 21 rules in 27 ms. Remains 409 /418 variables (removed 9) and now considering 412/424 (removed 12) transitions.
// Phase 1: matrix 412 rows 409 cols
[2023-03-11 12:41:22] [INFO ] Computed 25 place invariants in 6 ms
[2023-03-11 12:41:22] [INFO ] Implicit Places using invariants in 170 ms returned []
[2023-03-11 12:41:22] [INFO ] Invariant cache hit.
[2023-03-11 12:41:23] [INFO ] Implicit Places using invariants and state equation in 404 ms returned []
Implicit Place search using SMT with State Equation took 576 ms to find 0 implicit places.
[2023-03-11 12:41:23] [INFO ] Invariant cache hit.
[2023-03-11 12:41:23] [INFO ] Dead Transitions using invariants and state equation in 328 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 409/418 places, 412/424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 935 ms. Remains : 409/418 places, 412/424 transitions.
Stuttering acceptance computed with spot in 205 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-24b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s376 1) (EQ s396 1) (EQ s407 1)), p0:(EQ s87 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 477 reset in 247 ms.
Stack based approach found an accepted trace after 77416 steps with 368 reset with depth 325 and stack size 325 in 277 ms.
FORMULA GPUForwardProgress-PT-24b-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property GPUForwardProgress-PT-24b-LTLFireability-08 finished in 1685 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 418 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 418/418 places, 424/424 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 411 transition count 417
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 411 transition count 417
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 411 transition count 415
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 409 transition count 413
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 409 transition count 413
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 409 transition count 411
Applied a total of 22 rules in 30 ms. Remains 409 /418 variables (removed 9) and now considering 411/424 (removed 13) transitions.
// Phase 1: matrix 411 rows 409 cols
[2023-03-11 12:41:24] [INFO ] Computed 25 place invariants in 2 ms
[2023-03-11 12:41:24] [INFO ] Implicit Places using invariants in 157 ms returned []
[2023-03-11 12:41:24] [INFO ] Invariant cache hit.
[2023-03-11 12:41:24] [INFO ] Implicit Places using invariants and state equation in 351 ms returned []
Implicit Place search using SMT with State Equation took 520 ms to find 0 implicit places.
[2023-03-11 12:41:24] [INFO ] Invariant cache hit.
[2023-03-11 12:41:25] [INFO ] Dead Transitions using invariants and state equation in 330 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 409/418 places, 411/424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 882 ms. Remains : 409/418 places, 411/424 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-24b-LTLFireability-10 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 s208 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 359 ms.
Product exploration explored 100000 steps with 33333 reset in 495 ms.
Computed a total of 76 stabilizing places and 76 stable transitions
Graph (complete) has 636 edges and 409 vertex of which 381 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.5 ms
Computed a total of 76 stabilizing places and 76 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 56 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPUForwardProgress-PT-24b-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-24b-LTLFireability-10 finished in 1933 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 418 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 418/418 places, 424/424 transitions.
Graph (trivial) has 346 edges and 418 vertex of which 6 / 418 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 643 edges and 413 vertex of which 385 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.2 ms
Discarding 28 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 202 transitions
Trivial Post-agglo rules discarded 202 transitions
Performed 202 trivial Post agglomeration. Transition count delta: 202
Iterating post reduction 0 with 202 rules applied. Total rules applied 204 place count 384 transition count 212
Reduce places removed 202 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 208 rules applied. Total rules applied 412 place count 182 transition count 206
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 414 place count 180 transition count 206
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 51 Pre rules applied. Total rules applied 414 place count 180 transition count 155
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 516 place count 129 transition count 155
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 539 place count 106 transition count 132
Iterating global reduction 3 with 23 rules applied. Total rules applied 562 place count 106 transition count 132
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 148 rules applied. Total rules applied 710 place count 32 transition count 58
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 711 place count 32 transition count 57
Discarding 23 places :
Symmetric choice reduction at 4 with 23 rule applications. Total rules 734 place count 9 transition count 11
Iterating global reduction 4 with 23 rules applied. Total rules applied 757 place count 9 transition count 11
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 759 place count 7 transition count 9
Applied a total of 759 rules in 27 ms. Remains 7 /418 variables (removed 411) and now considering 9/424 (removed 415) transitions.
// Phase 1: matrix 9 rows 7 cols
[2023-03-11 12:41:26] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 12:41:26] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-11 12:41:26] [INFO ] Invariant cache hit.
[2023-03-11 12:41:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 12:41:26] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2023-03-11 12:41:26] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-11 12:41:26] [INFO ] Invariant cache hit.
[2023-03-11 12:41:26] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/418 places, 9/424 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 111 ms. Remains : 7/418 places, 9/424 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-24b-LTLFireability-11 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 s5 0)], 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 4 steps with 1 reset in 0 ms.
FORMULA GPUForwardProgress-PT-24b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-24b-LTLFireability-11 finished in 200 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&X(X(p1)))))'
Support contains 2 out of 418 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 418/418 places, 424/424 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 410 transition count 416
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 410 transition count 416
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 410 transition count 414
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 408 transition count 412
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 408 transition count 412
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 408 transition count 410
Applied a total of 24 rules in 27 ms. Remains 408 /418 variables (removed 10) and now considering 410/424 (removed 14) transitions.
// Phase 1: matrix 410 rows 408 cols
[2023-03-11 12:41:26] [INFO ] Computed 25 place invariants in 2 ms
[2023-03-11 12:41:26] [INFO ] Implicit Places using invariants in 169 ms returned []
[2023-03-11 12:41:26] [INFO ] Invariant cache hit.
[2023-03-11 12:41:26] [INFO ] Implicit Places using invariants and state equation in 385 ms returned []
Implicit Place search using SMT with State Equation took 562 ms to find 0 implicit places.
[2023-03-11 12:41:26] [INFO ] Invariant cache hit.
[2023-03-11 12:41:27] [INFO ] Dead Transitions using invariants and state equation in 298 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 408/418 places, 410/424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 896 ms. Remains : 408/418 places, 410/424 transitions.
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : GPUForwardProgress-PT-24b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s84 0) (EQ s227 0)), p1:(EQ s84 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]]
Product exploration explored 100000 steps with 25143 reset in 273 ms.
Product exploration explored 100000 steps with 24989 reset in 312 ms.
Computed a total of 75 stabilizing places and 75 stable transitions
Graph (complete) has 635 edges and 408 vertex of which 380 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.4 ms
Computed a total of 75 stabilizing places and 75 stable transitions
Detected a total of 75/408 stabilizing places and 75/410 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 230 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Incomplete random walk after 10000 steps, including 48 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 12:41:28] [INFO ] Invariant cache hit.
[2023-03-11 12:41:28] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 12:41:28] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 17 ms returned sat
[2023-03-11 12:41:28] [INFO ] After 185ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 12:41:28] [INFO ] After 217ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-11 12:41:28] [INFO ] After 346ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 100 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=100 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 369 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Support contains 2 out of 408 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 408/408 places, 410/410 transitions.
Applied a total of 0 rules in 8 ms. Remains 408 /408 variables (removed 0) and now considering 410/410 (removed 0) transitions.
[2023-03-11 12:41:29] [INFO ] Invariant cache hit.
[2023-03-11 12:41:29] [INFO ] Implicit Places using invariants in 170 ms returned []
[2023-03-11 12:41:29] [INFO ] Invariant cache hit.
[2023-03-11 12:41:30] [INFO ] Implicit Places using invariants and state equation in 391 ms returned []
Implicit Place search using SMT with State Equation took 564 ms to find 0 implicit places.
[2023-03-11 12:41:30] [INFO ] Invariant cache hit.
[2023-03-11 12:41:30] [INFO ] Dead Transitions using invariants and state equation in 371 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 949 ms. Remains : 408/408 places, 410/410 transitions.
Computed a total of 75 stabilizing places and 75 stable transitions
Graph (complete) has 635 edges and 408 vertex of which 380 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.6 ms
Computed a total of 75 stabilizing places and 75 stable transitions
Detected a total of 75/408 stabilizing places and 75/410 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 228 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Incomplete random walk after 10000 steps, including 45 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 12:41:31] [INFO ] Invariant cache hit.
[2023-03-11 12:41:31] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 12:41:31] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 17 ms returned sat
[2023-03-11 12:41:31] [INFO ] After 194ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 12:41:31] [INFO ] After 226ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-11 12:41:31] [INFO ] After 364ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 97 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=97 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 267 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 24980 reset in 280 ms.
Product exploration explored 100000 steps with 25006 reset in 307 ms.
Applying partial POR strategy [false, true, false, true, true]
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Support contains 2 out of 408 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 408/408 places, 410/410 transitions.
Graph (trivial) has 330 edges and 408 vertex of which 6 / 408 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 629 edges and 403 vertex of which 375 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.1 ms
Discarding 28 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Performed 192 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 192 rules applied. Total rules applied 194 place count 375 transition count 401
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 27 Pre rules applied. Total rules applied 194 place count 375 transition count 403
Deduced a syphon composed of 219 places in 0 ms
Iterating global reduction 1 with 27 rules applied. Total rules applied 221 place count 375 transition count 403
Discarding 143 places :
Symmetric choice reduction at 1 with 143 rule applications. Total rules 364 place count 232 transition count 260
Deduced a syphon composed of 99 places in 1 ms
Iterating global reduction 1 with 143 rules applied. Total rules applied 507 place count 232 transition count 260
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 530 place count 209 transition count 237
Deduced a syphon composed of 76 places in 0 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 553 place count 209 transition count 237
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 152 places in 1 ms
Iterating global reduction 1 with 76 rules applied. Total rules applied 629 place count 209 transition count 238
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 631 place count 209 transition count 236
Discarding 53 places :
Symmetric choice reduction at 2 with 53 rule applications. Total rules 684 place count 156 transition count 182
Deduced a syphon composed of 99 places in 0 ms
Iterating global reduction 2 with 53 rules applied. Total rules applied 737 place count 156 transition count 182
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 100 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 738 place count 156 transition count 182
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 739 place count 155 transition count 181
Deduced a syphon composed of 99 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 740 place count 155 transition count 181
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: -69
Deduced a syphon composed of 122 places in 1 ms
Iterating global reduction 2 with 23 rules applied. Total rules applied 763 place count 155 transition count 250
Discarding 45 places :
Symmetric choice reduction at 2 with 45 rule applications. Total rules 808 place count 110 transition count 160
Deduced a syphon composed of 99 places in 0 ms
Iterating global reduction 2 with 45 rules applied. Total rules applied 853 place count 110 transition count 160
Discarding 65 places :
Symmetric choice reduction at 2 with 65 rule applications. Total rules 918 place count 45 transition count 51
Deduced a syphon composed of 34 places in 0 ms
Iterating global reduction 2 with 65 rules applied. Total rules applied 983 place count 45 transition count 51
Deduced a syphon composed of 34 places in 0 ms
Applied a total of 983 rules in 85 ms. Remains 45 /408 variables (removed 363) and now considering 51/410 (removed 359) transitions.
[2023-03-11 12:41:33] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 51 rows 45 cols
[2023-03-11 12:41:33] [INFO ] Computed 0 place invariants in 3 ms
[2023-03-11 12:41:33] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/408 places, 51/410 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 156 ms. Remains : 45/408 places, 51/410 transitions.
Support contains 2 out of 408 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 408/408 places, 410/410 transitions.
Applied a total of 0 rules in 16 ms. Remains 408 /408 variables (removed 0) and now considering 410/410 (removed 0) transitions.
// Phase 1: matrix 410 rows 408 cols
[2023-03-11 12:41:33] [INFO ] Computed 25 place invariants in 3 ms
[2023-03-11 12:41:33] [INFO ] Implicit Places using invariants in 148 ms returned []
[2023-03-11 12:41:33] [INFO ] Invariant cache hit.
[2023-03-11 12:41:33] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 512 ms to find 0 implicit places.
[2023-03-11 12:41:33] [INFO ] Invariant cache hit.
[2023-03-11 12:41:34] [INFO ] Dead Transitions using invariants and state equation in 324 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 856 ms. Remains : 408/408 places, 410/410 transitions.
Treatment of property GPUForwardProgress-PT-24b-LTLFireability-13 finished in 8032 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 418 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 418/418 places, 424/424 transitions.
Graph (trivial) has 347 edges and 418 vertex of which 6 / 418 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 643 edges and 413 vertex of which 385 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.1 ms
Discarding 28 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 202 place count 384 transition count 214
Reduce places removed 200 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 206 rules applied. Total rules applied 408 place count 184 transition count 208
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 410 place count 182 transition count 208
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 52 Pre rules applied. Total rules applied 410 place count 182 transition count 156
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 3 with 104 rules applied. Total rules applied 514 place count 130 transition count 156
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 537 place count 107 transition count 133
Iterating global reduction 3 with 23 rules applied. Total rules applied 560 place count 107 transition count 133
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 148 rules applied. Total rules applied 708 place count 33 transition count 59
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 709 place count 33 transition count 58
Discarding 23 places :
Symmetric choice reduction at 4 with 23 rule applications. Total rules 732 place count 10 transition count 13
Iterating global reduction 4 with 23 rules applied. Total rules applied 755 place count 10 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 757 place count 9 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 758 place count 8 transition count 11
Applied a total of 758 rules in 48 ms. Remains 8 /418 variables (removed 410) and now considering 11/424 (removed 413) transitions.
// Phase 1: matrix 11 rows 8 cols
[2023-03-11 12:41:34] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-11 12:41:34] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-11 12:41:34] [INFO ] Invariant cache hit.
[2023-03-11 12:41:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 12:41:34] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2023-03-11 12:41:34] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-11 12:41:34] [INFO ] Invariant cache hit.
[2023-03-11 12:41:34] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/418 places, 11/424 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 194 ms. Remains : 8/418 places, 11/424 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-24b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 3 steps with 1 reset in 0 ms.
FORMULA GPUForwardProgress-PT-24b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-24b-LTLFireability-14 finished in 266 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&X(X(p1)))))'
Found a Lengthening insensitive property : GPUForwardProgress-PT-24b-LTLFireability-13
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Support contains 2 out of 418 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 418/418 places, 424/424 transitions.
Graph (trivial) has 344 edges and 418 vertex of which 6 / 418 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 643 edges and 413 vertex of which 385 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.2 ms
Discarding 28 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 0 with 199 rules applied. Total rules applied 201 place count 384 transition count 215
Reduce places removed 199 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 205 rules applied. Total rules applied 406 place count 185 transition count 209
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 409 place count 183 transition count 208
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 410 place count 182 transition count 208
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 52 Pre rules applied. Total rules applied 410 place count 182 transition count 156
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 4 with 104 rules applied. Total rules applied 514 place count 130 transition count 156
Discarding 23 places :
Symmetric choice reduction at 4 with 23 rule applications. Total rules 537 place count 107 transition count 133
Iterating global reduction 4 with 23 rules applied. Total rules applied 560 place count 107 transition count 133
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 4 with 144 rules applied. Total rules applied 704 place count 35 transition count 61
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 705 place count 35 transition count 60
Discarding 23 places :
Symmetric choice reduction at 5 with 23 rule applications. Total rules 728 place count 12 transition count 15
Iterating global reduction 5 with 23 rules applied. Total rules applied 751 place count 12 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 753 place count 11 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 754 place count 10 transition count 13
Applied a total of 754 rules in 24 ms. Remains 10 /418 variables (removed 408) and now considering 13/424 (removed 411) transitions.
// Phase 1: matrix 13 rows 10 cols
[2023-03-11 12:41:34] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 12:41:35] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-11 12:41:35] [INFO ] Invariant cache hit.
[2023-03-11 12:41:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 12:41:35] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2023-03-11 12:41:35] [INFO ] Invariant cache hit.
[2023-03-11 12:41:35] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 10/418 places, 13/424 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 140 ms. Remains : 10/418 places, 13/424 transitions.
Running random walk in product with property : GPUForwardProgress-PT-24b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s3 0) (EQ s5 0)), p1:(EQ s3 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 14 steps with 3 reset in 0 ms.
Treatment of property GPUForwardProgress-PT-24b-LTLFireability-13 finished in 466 ms.
FORMULA GPUForwardProgress-PT-24b-LTLFireability-13 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2023-03-11 12:41:35] [INFO ] Flatten gal took : 49 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 27108 ms.
ITS solved all properties within timeout

BK_STOP 1678538496224

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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-24b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is GPUForwardProgress-PT-24b, 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 r201-smll-167840347300092"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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